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

arXiv:1607.02259 · AIP conference proceedings

Maximum entropy and sufficiency

Peter Harremoës

Published Jan 1, 2017• 6 citations
arXivHTMLPDF

Abstract

The notion of Bregman divergence and sufficiency will be defined on general convex state spaces. It is demonstrated that only spectral sets can have a Bregman divergence that satisfies a sufficiency condition. Positive elements with trace 1 in a Jordan algebra are examples of spectral sets, and the most important example is the set of density matrices with complex entries. It is conjectured that information theoretic considerations lead directly to the notion of Jordan algebra under some regularity conditions.

DOI
10.1063/1.4985352

Related papers

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

Maps on Quantum States in -algebras Preserving von Neumann Entropy or Schatten -norm of Convex Combinations

Marcell Gaál

Abstract Very recently, Karder and Petek completely described maps on density matrices (positive semidefinite matrices with unit trace) preserving certain entropy-like convex functionals of any convex combination. As a result, maps could be characterized that preserve von Neumann entropy or Schatten $p$ -norm of any convex combination of quantum states (whose mathematical representatives are the density matrices). In this note we consider these latter two problems on the set of invertible density operators, in a much more general setting, on the set of positive invertible elements with unit trace in a $C^{\ast }$ -algebra.

Canadian Mathematical Bulletin•Mar 22, 2018•3 citations

Sufficiency and Petz recovery for positive maps

Lauritz van Luijk, Henrik Wilming

We study the interconversion of families of quantum states ("statistical experiments") via positive, trace-preserving (PTP) maps and clarify its mathematical structure in terms of minimal sufficient Jordan algebras, which can be seen to generalize the Koashi-Imoto decomposition to the PTP setting. In particular, we show that Neyman-Pearson tests generate the minimal sufficient Jordan algebra, and hence also the minimal sufficient *-algebra corresponding to the Koashi-Imoto decomposition. As applications, we show that a) equality in the data-processing inequality for the relative entropy or the $α$-$z$ quantum Rényi divergence implies the existence of a recovery map also in the PTP case and b) that two dichotomies can be interconverted by PTP maps if and only if they can be interconverted by decomposable, trace-preserving maps. We thoroughly review the necessary mathematical background on Jordan algebras. As a step beyond the finite-dimensional case, we prove Frenkel's formula for approximately finite-dimensional von Neumann algebras.

quant-pharXiv:2604.08380•Apr 10, 2026•4 citations

Spectral Geometric Means, Quantum Relative Entropy and Post-Quantum Primitives on Jordan Algebras An Extension of the Koufany-Lim Framework: Eigenvalue Geometry, Quantum Information and Exceptional Structures (Albert Algebra) in the Mostow Product Setting

Syed Muntasir Mamun

The spectral geometric mean of Koufany and Lim (2026), already known to encode the eigenvalue geometry of a pair of positive elements in a Euclidean Jordan algebra, sits at a largely unexplored intersection of quantum information theory and post-quantum cryptography. On the cone of positive-definite Hermitian matrices the spectral mean recovers the Fiedler–Pták construction whose spectrum consists of the geometric means of the eigenvalues of the product; the same construction extends verbatim to any simple Euclidean Jordan algebra, including the exceptional Albert algebra \(\mathfrak{h}_3(\mathbb{O})\). This extension examines three interlocking questions: (i) the relation between the spectral geometric mean and quantum relative entropies (Umegaki, Belavkin–Staszewski, and their Jordan-algebraic analogues); (ii) the possible use of Mostow product metrics \(d_\sigma\) as alternative geometries for quantum state spaces and for divergence-based learning; and (iii) the prospect that the exceptional Jordan structure of the Albert algebra, together with its Mostow decompositions, may furnish new hardness assumptions or algebraic primitives for post-quantum cryptography. Concrete open problems and a stratified ontological reading of the exceptional cone are offered. C S Also available on Academia.edu: https://www.academia.edu/attachments/133701404/download_file?s=portfolio

•Aug 2, 2026•0 citations

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

From ƒ-Divergence to Quantum Quasi-Entropies and Their Use

Dénes Petz

Csiszár’s ƒ-divergence of two probability distributions was extended to the quantum case by the author in 1985. In the quantum setting, positive semidefinite matrices are in the place of probability distributions and the quantum generalization is called quasi-entropy, which is related to some other important concepts as covariance, quadratic costs, Fisher information, Cram´er-Rao inequality and uncertainty relation. It is remarkable that in the quantum case theoretically there are several Fisher information and variances. Fisher information are obtained as the Hessian of a quasi-entropy. A conjecture about the scalar curvature of a Fisher information geometry is explained. The described subjects are overviewed in details in the matrix setting. The von Neumann algebra approach is also discussed for uncertainty relation.

arXiv:0909.3647•Entropy•Mar 1, 2010•40 citations
The notion of Bregman divergence and sufficiency will be defined on general convex state spaces. It is demonstrated that only spectral sets can have a Bregman divergence that satisfies a sufficiency condition. Positive elements with trace 1 in a Jordan algebra are examples of spectral sets, and the most important example is the set of density matrices with complex entries. It is conjectured that information theoretic considerations lead directly to the notion of Jordan algebra under some regularity conditions.
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.
Abstract Very recently, Karder and Petek completely described maps on density matrices (positive semidefinite matrices with unit trace) preserving certain entropy-like convex functionals of any convex combination. As a result, maps could be characterized that preserve von Neumann entropy or Schatten ppp -norm of any convex combination of quantum states (whose mathematical representatives are the density matrices). In this note we consider these latter two problems on the set of invertible density operators, in a much more general setting, on the set of positive invertible elements with unit trace in a C∗C^{\ast }C∗ -algebra.
We study the interconversion of families of quantum states ("statistical experiments") via positive, trace-preserving (PTP) maps and clarify its mathematical structure in terms of minimal sufficient Jordan algebras, which can be seen to generalize the Koashi-Imoto decomposition to the PTP setting. In particular, we show that Neyman-Pearson tests generate the minimal sufficient Jordan algebra, and hence also the minimal sufficient *-algebra corresponding to the Koashi-Imoto decomposition. As applications, we show that a) equality in the data-processing inequality for the relative entropy or the ααα-zzz quantum Rényi divergence implies the existence of a recovery map also in the PTP case and b) that two dichotomies can be interconverted by PTP maps if and only if they can be interconverted by decomposable, trace-preserving maps. We thoroughly review the necessary mathematical background on Jordan algebras. As a step beyond the finite-dimensional case, we prove Frenkel's formula for approximately finite-dimensional von Neumann algebras.
The spectral geometric mean of Koufany and Lim (2026), already known to encode the eigenvalue geometry of a pair of positive elements in a Euclidean Jordan algebra, sits at a largely unexplored intersection of quantum information theory and post-quantum cryptography. On the cone of positive-definite Hermitian matrices the spectral mean recovers the Fiedler–Pták construction whose spectrum consists of the geometric means of the eigenvalues of the product; the same construction extends verbatim to any simple Euclidean Jordan algebra, including the exceptional Albert algebra h3(O)\mathfrak{h}_3(\mathbb{O})h3​(O). This extension examines three interlocking questions: (i) the relation between the spectral geometric mean and quantum relative entropies (Umegaki, Belavkin–Staszewski, and their Jordan-algebraic analogues); (ii) the possible use of Mostow product metrics dσd_\sigmadσ​ as alternative geometries for quantum state spaces and for divergence-based learning; and (iii) the prospect that the exceptional Jordan structure of the Albert algebra, together with its Mostow decompositions, may furnish new hardness assumptions or algebraic primitives for post-quantum cryptography. Concrete open problems and a stratified ontological reading of the exceptional cone are offered. C S Also available on Academia.edu: https://www.academia.edu/attachments/133701404/download_file?s=portfolio
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.
Csiszár’s ƒ-divergence of two probability distributions was extended to the quantum case by the author in 1985. In the quantum setting, positive semidefinite matrices are in the place of probability distributions and the quantum generalization is called quasi-entropy, which is related to some other important concepts as covariance, quadratic costs, Fisher information, Cram´er-Rao inequality and uncertainty relation. It is remarkable that in the quantum case theoretically there are several Fisher information and variances. Fisher information are obtained as the Hessian of a quasi-entropy. A conjecture about the scalar curvature of a Fisher information geometry is explained. The described subjects are overviewed in details in the matrix setting. The von Neumann algebra approach is also discussed for uncertainty relation.