Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Lie Theory

Spectral Properties of Convex Bodies

H. Barnum, J. Hilgert

Published Jan 1, 2020• 1 citation
Publisher

Abstract

We use the Madden-Robertson classification of regular convex bodies to show that convex bodies are spectral and strongly symmetric if and only if they are affinely isomorphic to the normalized state spaces of simple euclidean Jordan algebras, or to simplices.Further, we discuss the relevance of this result for general probabilistic theories of quantum and classical physical systems, and its relation to other characterizations of various classes of euclidean Jordan algebra state spaces.

DOI
10.5802/jolt.1118

Related papers

Strongly symmetric spectral convex bodies are Jordan algebra state spaces

Howard Barnum, Joachim Hilgert

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.

arXiv:1904.03753•Apr 7, 2019•34 citations

Three characterisations of the sequential product

John van de Wetering

It has already been established that the properties required of an abstract sequential product as introduced by Gudder and Greechie are not enough to characterise the standard sequential product a◦b=aba on an operator algebra. We give three additional properties, each of which characterises the standard sequential product on either a von Neumann algebra or a Euclidean Jordan algebra. These properties are (1) invariance under the application of unital order isomorphisms, (2) symmetry of the sequential product with respect to a certain inner product, and (3) preservation of invertibility of the effects. To give these characterisations, we first have to study convex σ-sequential effect algebras. We show that these objects correspond to unit intervals of spectral order unit spaces with a homogeneous positive cone.

arXiv:1803.08453•Journal of Mathematical Physics•Aug 1, 2018•11 citations

Continuous symmetry entails the Jordan algebra structure of finite-dimensional quantum theory

Gerd Niestegge

Symmetry postulates play a crucial role in various approaches to reconstruct quantum theory from a few basic principles. Discrete and continuous symmetries are under consideration. The continuous case better matches the physical needs for mathematical models of dynamical processes and is studied here. Applying the representation theory of the orthomodular lattices and a generalized version of Gleason's theorem for Jordan matrix algebras, we show that the continuous symmetry, together with three further requirements, entails that the underlying mathematical structure of a finite-dimensional generalized probabilistic theory becomes a simple Euclidean Jordan algebra. The further requirements are: spectrality, a strong state space and a condition called gbit property.

arXiv:2411.19672•Nov 29, 2024•1 citation

Quantum transition probability in convex sets and self-dual cones

Gerd Niestegge

The interplay between the algebraic structure (operator algebras) for the quantum observables and the convex structure of the state space has been explored for a long time, and most advanced results are due to Alfsen and Shultz. Here we present a more elementary approach with a more general structure for the observables, which focuses on the transition probability of the quantum logical atoms. The binary case gives rise to the generalized qubit models and was fully developed in a preceding paper. Here we consider any case with finite information capacity (binary means that the information capacity is 2). A novel geometric property that makes any compact convex set a matching state space is presented. Generally, the transition probability is not symmetric; if it is symmetric, we get an inner product and a self-dual cone. The emerging mathematical structure comes close to the Euclidean Jordan algebras and becomes a new mathematical model for a potential extension of quantum theory.

arXiv:2312.13213•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Nov 1, 2024•4 citations

On the homogeneity of the quantum transition probability

Gerd Niestegge

In the years 1952 and 1965, H.-C. Wang and U. Hirzebruch showed that the two-point homogeneous compact spaces with convex metrics are isometric to the spheres, the real, complex, octonion projective spaces and the Moufang plane and as well to the sets of the minimal idempotents or pure states in the simple Euclidean Jordan algebras. Here we reveal the physical meaning of these mathematical achievements for the quantum mechanical transition probability. We show that this transition probability features a maximum degree of homogeneity in all simple Euclidean Jordan algebras, which includes common finite-dimensional Hilbert space quantum theory. The atomic parts of these algebras or, equivalently, the extreme boundaries of their state spaces can be characterized by purely topological means. This is an important difference to many other recent approaches that aim to distinguish the entire state spaces among the convex compact sets. An interesting case with non-homogeneous transition probability arises, when the $E_6$-symmetric bioctonionic projective plane is used as quantum logic.

quant-pharXiv:2601.01936•Jan 6, 2026•1 citation

Quantum information on spectral sets

Peter Harremoës

For convex optimization problems Bregman divergences appear as regret functions. Such regret functions can be defined on any convex set, but if a sufficiency condition is added the regret function must be proportional to information divergence and the convex set must be spectral. Spectral sets are sets where different orthogonal decompositions of a state into pure states have unique mixing coefficients. Only on such spectral sets it is possible to define well behaved information theoretic quantities like entropy and divergence. It is only possible to perform measurements in a reversible way if the state space is spectral. The most important spectral sets can be represented as positive elements of Jordan algebras with trace 1. This means that Jordan algebras provide a natural framework for studying quantum information.

arXiv:1701.06688•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•4 citations
We use the Madden-Robertson classification of regular convex bodies to show that convex bodies are spectral and strongly symmetric if and only if they are affinely isomorphic to the normalized state spaces of simple euclidean Jordan algebras, or to simplices.Further, we discuss the relevance of this result for general probabilistic theories of quantum and classical physical systems, and its relation to other characterizations of various classes of euclidean Jordan algebra state spaces.
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.
It has already been established that the properties required of an abstract sequential product as introduced by Gudder and Greechie are not enough to characterise the standard sequential product a◦b=aba on an operator algebra. We give three additional properties, each of which characterises the standard sequential product on either a von Neumann algebra or a Euclidean Jordan algebra. These properties are (1) invariance under the application of unital order isomorphisms, (2) symmetry of the sequential product with respect to a certain inner product, and (3) preservation of invertibility of the effects. To give these characterisations, we first have to study convex σ-sequential effect algebras. We show that these objects correspond to unit intervals of spectral order unit spaces with a homogeneous positive cone.
Symmetry postulates play a crucial role in various approaches to reconstruct quantum theory from a few basic principles. Discrete and continuous symmetries are under consideration. The continuous case better matches the physical needs for mathematical models of dynamical processes and is studied here. Applying the representation theory of the orthomodular lattices and a generalized version of Gleason's theorem for Jordan matrix algebras, we show that the continuous symmetry, together with three further requirements, entails that the underlying mathematical structure of a finite-dimensional generalized probabilistic theory becomes a simple Euclidean Jordan algebra. The further requirements are: spectrality, a strong state space and a condition called gbit property.
The interplay between the algebraic structure (operator algebras) for the quantum observables and the convex structure of the state space has been explored for a long time, and most advanced results are due to Alfsen and Shultz. Here we present a more elementary approach with a more general structure for the observables, which focuses on the transition probability of the quantum logical atoms. The binary case gives rise to the generalized qubit models and was fully developed in a preceding paper. Here we consider any case with finite information capacity (binary means that the information capacity is 2). A novel geometric property that makes any compact convex set a matching state space is presented. Generally, the transition probability is not symmetric; if it is symmetric, we get an inner product and a self-dual cone. The emerging mathematical structure comes close to the Euclidean Jordan algebras and becomes a new mathematical model for a potential extension of quantum theory.
In the years 1952 and 1965, H.-C. Wang and U. Hirzebruch showed that the two-point homogeneous compact spaces with convex metrics are isometric to the spheres, the real, complex, octonion projective spaces and the Moufang plane and as well to the sets of the minimal idempotents or pure states in the simple Euclidean Jordan algebras. Here we reveal the physical meaning of these mathematical achievements for the quantum mechanical transition probability. We show that this transition probability features a maximum degree of homogeneity in all simple Euclidean Jordan algebras, which includes common finite-dimensional Hilbert space quantum theory. The atomic parts of these algebras or, equivalently, the extreme boundaries of their state spaces can be characterized by purely topological means. This is an important difference to many other recent approaches that aim to distinguish the entire state spaces among the convex compact sets. An interesting case with non-homogeneous transition probability arises, when the E6E_6E6​-symmetric bioctonionic projective plane is used as quantum logic.
For convex optimization problems Bregman divergences appear as regret functions. Such regret functions can be defined on any convex set, but if a sufficiency condition is added the regret function must be proportional to information divergence and the convex set must be spectral. Spectral sets are sets where different orthogonal decompositions of a state into pure states have unique mixing coefficients. Only on such spectral sets it is possible to define well behaved information theoretic quantities like entropy and divergence. It is only possible to perform measurements in a reversible way if the state space is spectral. The most important spectral sets can be represented as positive elements of Jordan algebras with trace 1. This means that Jordan algebras provide a natural framework for studying quantum information.