QMATH at STOC´25
This week two works co-authored by QMATH'ers will be presented at the Symposium on Theory of Computing 2025 (STOC'25), one of the leading conferences in the field of theoretical computer science.
The first work is titled "Asymptotic tensor rank is characterized by polynomials", authored by Matthias Christandl, Koen Hoeberechts, Harold Nieuwboer, Péter Vrana and Jeroen Zuiddam investigates the structure of all quantum states for which a certain type of asymptotic entanglement cost is a fixed number, showing the incredibly surprising result that it admits an algebraic description. This is also intricately connected to the fundamental matrix multiplication exponent ω, whose value is currently unknown.
The second work is on "Computing moment polytopes of tensors with applications in algebraic complexity and quantum information", authored by Maxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter and Jeroen Zuiddam. They pushed computational methods to the limit, and the results led (among other things) to a proof that there are surprising limitations on the tripartite quantum states that can be created from bipartite-only entanglement.