Strongly symmetric spectral convex bodies are Jordan algebra state spaces

Abstract

We show that the strongly symmetric spectral convex compact sets are precisely the normalized state spaces of finite-dimensional simple Euclidean Jordan algebras and the simplices. Spectrality is the property that every state has a convex decomposition into perfectly distinguishable pure states; strong symmetry is transitivity, for each integer N, of the affine automorphism group of the state space on lists of N perfectly distinguishable pure states. Additional assumptions combine with this theorem to give simple characterizations of finite-dimensional complex quantum state space. Important aspects of quantum and classical thermodynamics and of query complexity have been generalized to classes of general probabilistic theories (GPTs) satisfying natural postulates including or implying spectrality and strong symmetry; our result shows that these apply to a narrower class of theories than might have been hoped. Sorkin's notion of irreducibly k-th order interference has been studied in the GPT framework and looked for in experiments. Our result shows that the assumption of no higher-order (k > 2) interference, used along with spectrality and strong symmetry to characterize the same class of Jordan-algebraic convex sets by Barnum, Mueller, and Ududec in arXiv:1403.4147, was superfluous. It also implies that Lee and Selby's extension, on the assumption that interference has fixed maximal degree k, of the important order square root of N lower bound on the quantum black-box query complexity of searching N possibilities for one having a desired property (which is achieved by Grover's quantum algorithm), to a class of theories satisfying certain postulates allowing the formulation of a generalized notion of query algorithm, actually applies in the Jordan-algebraic setting where higher-order interference is not possible.

References in corpus (15)

• Quantum Mechanics helps in searching for a needle in a haystack
• Strengths and Weaknesses of Quantum Computing
• Quantum Theory From Five Reasonable Axioms
• Quantum Mechanics as Quantum Measure Theory
• The structure of reversible computation determines the self-duality of quantum theory
• Three Slit Experiments and the Structure of Quantum Theory
• All measurements in a probabilistic theory are compatible if and only if the state space is a simplex
• Deriving Grover's lower bound from simple physical principles
• Ruling out higher-order interference from purity principles
• Operational axioms for diagonalizing states
• Entropy, majorization and thermodynamics in general probabilistic theories
• Conditional probability, three-slit experiments, and the Jordan algebra structure of quantum mechanics
• Oracles and query lower bounds in generalised probabilistic theories
• Entanglement as an axiomatic foundation for statistical mechanics
• A Note On Polar Representations

Cited by in corpus (7)

• General probabilistic theories: An introduction
• Probabilistic Theories and Reconstructions of Quantum Theory (Les Houches 2019 lecture notes)
• Quantum Theory as Symmetry Broken by Vitality
• The three types of normal sequential effect algebras
• On Relationalist Reconstructions of Quantum Theory
• Quantum Theory from Principles, Quantum Software from Diagrams
• Characterization of the probabilistic models that can be embedded in quantum theory