Abstract

Motivated by the problem of constructing fast matrix multiplication algorithms, Strassen (FOCS 1986, Crelle 1987–1991) introduced and developed the theory of asymptotic spectra of tensors. For any sub-semiring X \mathcal {X} of tensors (under direct sum and tensor product), the duality theorem that is at the core of this theory characterizes basic asymptotic properties of the elements of X \mathcal {X} in terms of the asymptotic spectrum of X \mathcal {X} , which is defined as the collection of semiring homomorphisms from X \mathcal {X} to the non-negative reals with a natural monotonicity property. The asymptotic properties characterized by this duality encompass fundamental problems in complexity theory, combinatorics and quantum information. Universal spectral points are elements in the asymptotic spectrum of the semiring of all tensors. Finding all universal spectral points suffices to find the asymptotic spectrum of any sub-semiring. The construction of non-trivial universal spectral points has been an open problem for more than thirty years. We construct, for the first time, a family of non-trivial universal spectral points over the complex numbers, called quantum functionals. We moreover prove that the quantum functionals precisely characterise the asymptotic slice rank of complex tensors. Our construction, which relies on techniques from quantum information theory and representation theory, connects the asymptotic spectrum of tensors to the quantum marginal problem and entanglement polytopes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.