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:2406.08803 · Journal of Physics A Mathematical and Theoretical

Birkhoff violation in even-polygon general probabilistic theories: implications for state transformations and information processing

Ananya Chakraborty, Sahil Gopalkrishna Naik, Samrat Sen, Ram Krishan Parta, Pratik Ghosal, Mir Alimuddin, Manik Banik

Published Oct 14, 2026• 0 citations
arXivHTMLPDF

Abstract

Abstract The entropy principle asserts that spontaneous processes drive systems toward states of higher disorder. Operational origin of such randomness is a question of utmost importance. The seminal Birkhoff theorem (also known as Birkhoff-von Neumann theorem) identifies doubly stochastic transformations as convex mixtures of reversible transformations, thereby providing an epistemic account of disorder. Quantum theory, however, does not satisfy this equivalence in general. In this work, we investigate this question within the framework of generalized probabilistic theories (GPTs). We prove a violation of the Birkhoff theorem in the square-bit model, a canonical non-quantum GPT, and further show that this violation persists asymptotically under tensor products of any finite, yet arbitrarily large, number of copies of even-polygon models. This provides evidence that the failure of the Birkhoff theorem is an intrinsic operational feature of a wide class of GPTs, rather than a peculiarity of quantum theory. Furthermore, we show that, beyond quantum theory, the preorder over states induced by mixtures of reversible transformations can differ from that induced by doubly stochastic transformations, leading to inequivalent notions of state convertibility and distinct resource theories of purity. Beyond its foundational significance, we show that the violation of the Birkhoff theorem admits a concrete operational interpretation: in the square-bit theory, it serves as a genuine resource for enhancing the performance of Random Access Codes. Finally, we discuss the construction of entropy functions in GPTs that remain consistent with thermodynamic principles, in the spirit of von Neumann’s formulation.

DOI
10.1088/1751-8121/aeb45a

Related papers

Birkhoff–von Neumann's theorem, doubly normalized tensors, and joint measurability

Leonardo Guerini, Alexandre Baraviera

Quantum measurements can be interpreted as a generalization of probability vectors, in which non-negative real numbers are replaced by positive semi-definite operators. We extrapolate this analogy to define a generalization of doubly stochastic matrices that we call doubly normalized tensors (DNTs), and investigate a corresponding version of Birkhoff–von Neumann's theorem, which states that permutations are the extremal points of the set of doubly stochastic matrices. We prove that joint measurability appears naturally as a mathematical feature of DNTs in this context and that this feature is necessary and sufficient for a characterization similar to Birkhoff–von Neumann's. Conversely, we also show that DNTs arise from a particular instance of a joint measurability problem, remarking the relevance of this quantum-theoretical property in general operator theory.

arXiv:1809.07366•Linear and Multilinear Algebra•Dec 31, 2022•1 citation

Information Thermodynamics in Generalized Probabilistic Theories

Koki Ono, Shun Umekawa, Hiroyasu Tajima

Generalized probabilistic theories (GPTs) provide a unified framework for describing probabilistic physical theories, encompassing classical and quantum theories as well as hypothetical theories beyond quantum mechanics. Since most GPTs are highly unrealistic and far removed from known physical theories, it is important to constrain them by physically reasonable principles. One of the most important such principles is consistency with thermodynamics, which has been extensively studied through toy models involving semipermeable membranes (SPMs) implementing measurements. On the other hand, information thermodynamics, which plays a central role in understanding the relationship between measurement and thermodynamics in classical and quantum theory, has remained largely undeveloped in GPTs. In this work, we construct information thermodynamics in GPTs and provide a unified framework for analyzing the relationship between measurement, feedback, information erasure, and the second law of thermodynamics. We also formulate a general framework for SPM models and analyze the thermodynamic cost of measurements implemented by SPMs. As a result, we show that no work can be extracted in contradiction with the second law as long as the measurement processes are consistent with entropy nondecrease, and derive sufficient conditions for this property for several entropy definitions proposed in GPTs. Moreover, by considering measurement processes violating these conditions, we construct explicit GPT systems realizing isothermal SPM cycles from which positive work can be extracted. These results demonstrate that violations of the second law can arise from the lack of fundamental entropy properties or discrepancies between entropy definitions, and provide a unified and model-independent foundation for understanding the relationship between thermodynamics and measurement in GPTs.

quant-pharXiv:2605.12331•May 13, 2026•0 citations

Information and communication in polygon theories

Serge Massar, Manas K. Patra

Generalized probabilistic theories (GPTs) provide a framework in which one can formulate physical theories that includes classical and quantum theories, but also many other alternative theories. In order to compare different GPTs, we advocate an approach in which one views a state in a GPT as a resource and quantifies the cost of interconverting between different such resources. We illustrate this approach on polygon theories [New J. Phys. 13, 063024 (2011).] that interpolate (as the number $n$ of edges of the polygon increases) between a classical trit (when $n=3$) and a real quantum bit (when $n=\ensuremath{\infty}$). Our main results are that simulating the transmission of a single $n$-gon state requires more than one qubit, or more than $log(log(n))$ bits, and that $n$-gon states with $n$ odd cannot be simulated by ${n}^{\ensuremath{'}}$-gon states with ${n}^{\ensuremath{'}}$ even (for all $n,{n}^{\ensuremath{'}}$). These results are obtained by showing that the classical capacity of a single $n$-gon state with $n$ even is 1 bit, whereas it is larger than 1 bit when $n$ is odd; by showing that transmitting a single $n$-gon state with $n$ even violates information causality; and by studying the communication complexity cost of the nondeterministic not-equal function using $n$-gon states.

arXiv:1403.2509•Physical Review A•May 20, 2014•21 citations

Antidistinguishability of states in General Probabilistic Theories

Satyaki Manna, Anandamay Das Bhowmik

We investigate antidistinguishability of states within the framework of general probabilistic theories (GPTs). We formulate antidistinguishability, strong and equal antidistinguishability as refined notions that imposed additional constraint on the measurement effects. We establish general results relating these notions of antidistinguishability and derive an upper bound on the cardinality of equally antidistinguishable sets in terms of the affine dimension of the state space. We then study antidistinguishability in polygonal theories, obtaining conditions for antidistinguishability of a set of states. In consequence, we show that the set of all pure states in a polygon model is antidistinguishable. Additionally, we identify broad families of strongly and equally antidistinguishable states. Finally, using Random Exclusion Codes, whose success probability is governed by the antidistinguishability of different sets of encoding states, we probe the nonclassicality of polygon theories. We find that certain polygon models can outperform the optimal quantum value, while their optimal performance converges to the quantum limit in the large-polygon limit.

quant-pharXiv:2609.17498•Sep 16, 2026•1 citation

Entropy of mixing exists only for classical and quantum-like theories among the regular polygon theories

Ryo Takakura

Abstract The thermodynamical entropy of a system which consists of different kinds of ideal gases is known to be defined successfully in the case when the differences are described by classical or quantum theory. Since these theories are special examples in the framework of generalized probabilistic theories (GPTs), it is natural to generalize the notion of thermodynamical entropy to systems where the internal degrees of particles are described by other possible theories. In this paper, we consider thermodynamical entropy of mixing in a specific series of theories of GPTs called the regular polygon theories, which can be regarded from a geometrical perspective as intermediate theories between a classical trit and a quantum bit with real coefficients. We prove that the operationally natural thermodynamical entropy of mixing does not exist in those inbetween theories, that is, the existence of the natural entropy results in classical and quantum-like theories among the regular polygon theories.

arXiv:1803.07388•Journal of Physics A Mathematical and Theoretical•Oct 2, 2019•6 citations

Purity in microcanonical thermodynamics: a tale of three resource theories.

Giulio Chiribella, Carlo Maria Scandolo

Resource theories provide a framework for thermodynamics beyond the thermodynamic limit. For systems with definite energy,the key resource is purity. In this paper we formulate three alternative resource theories of purity in the framework of general probabilistic theories (GPTs). Each resource theory corresponds to a different choice of free operations, including i)random reversible operations, ii)noisy operations, generated by reversible interactions with ancillas in the microcanonical state, and iii)unital operations, which preserve the microcanonical state.We determine the requirements the underlying GPT must satisfy in order to support well-behaved resource theories with the above sets as free operations. Then, we focus on a special class of physical theories, called sharp theories with purification, which are appealing for an information-theoretic foundation of thermodynamics. For every sharp theory with purification we show that the convertibility of states implies the validity of a majorisation condition. Moreover, we characterise exactly when majorisation is sufficient for convertibility via random reversible operations. Under this condition, we prove that i) random reversible, noisy, and unital operations obey inclusion relations like in quantum theory, ii) despite being different, the three sets of operations are equivalent in terms of convertibility, iii) there exists a one-to-one correspondence between measures of purity and Schur-convex functions, and iv) purity resources are dual to entanglement resources.

•Aug 16, 2016•4 citations
Abstract The entropy principle asserts that spontaneous processes drive systems toward states of higher disorder. Operational origin of such randomness is a question of utmost importance. The seminal Birkhoff theorem (also known as Birkhoff-von Neumann theorem) identifies doubly stochastic transformations as convex mixtures of reversible transformations, thereby providing an epistemic account of disorder. Quantum theory, however, does not satisfy this equivalence in general. In this work, we investigate this question within the framework of generalized probabilistic theories (GPTs). We prove a violation of the Birkhoff theorem in the square-bit model, a canonical non-quantum GPT, and further show that this violation persists asymptotically under tensor products of any finite, yet arbitrarily large, number of copies of even-polygon models. This provides evidence that the failure of the Birkhoff theorem is an intrinsic operational feature of a wide class of GPTs, rather than a peculiarity of quantum theory. Furthermore, we show that, beyond quantum theory, the preorder over states induced by mixtures of reversible transformations can differ from that induced by doubly stochastic transformations, leading to inequivalent notions of state convertibility and distinct resource theories of purity. Beyond its foundational significance, we show that the violation of the Birkhoff theorem admits a concrete operational interpretation: in the square-bit theory, it serves as a genuine resource for enhancing the performance of Random Access Codes. Finally, we discuss the construction of entropy functions in GPTs that remain consistent with thermodynamic principles, in the spirit of von Neumann’s formulation.
Quantum measurements can be interpreted as a generalization of probability vectors, in which non-negative real numbers are replaced by positive semi-definite operators. We extrapolate this analogy to define a generalization of doubly stochastic matrices that we call doubly normalized tensors (DNTs), and investigate a corresponding version of Birkhoff–von Neumann's theorem, which states that permutations are the extremal points of the set of doubly stochastic matrices. We prove that joint measurability appears naturally as a mathematical feature of DNTs in this context and that this feature is necessary and sufficient for a characterization similar to Birkhoff–von Neumann's. Conversely, we also show that DNTs arise from a particular instance of a joint measurability problem, remarking the relevance of this quantum-theoretical property in general operator theory.
Generalized probabilistic theories (GPTs) provide a unified framework for describing probabilistic physical theories, encompassing classical and quantum theories as well as hypothetical theories beyond quantum mechanics. Since most GPTs are highly unrealistic and far removed from known physical theories, it is important to constrain them by physically reasonable principles. One of the most important such principles is consistency with thermodynamics, which has been extensively studied through toy models involving semipermeable membranes (SPMs) implementing measurements. On the other hand, information thermodynamics, which plays a central role in understanding the relationship between measurement and thermodynamics in classical and quantum theory, has remained largely undeveloped in GPTs. In this work, we construct information thermodynamics in GPTs and provide a unified framework for analyzing the relationship between measurement, feedback, information erasure, and the second law of thermodynamics. We also formulate a general framework for SPM models and analyze the thermodynamic cost of measurements implemented by SPMs. As a result, we show that no work can be extracted in contradiction with the second law as long as the measurement processes are consistent with entropy nondecrease, and derive sufficient conditions for this property for several entropy definitions proposed in GPTs. Moreover, by considering measurement processes violating these conditions, we construct explicit GPT systems realizing isothermal SPM cycles from which positive work can be extracted. These results demonstrate that violations of the second law can arise from the lack of fundamental entropy properties or discrepancies between entropy definitions, and provide a unified and model-independent foundation for understanding the relationship between thermodynamics and measurement in GPTs.
Generalized probabilistic theories (GPTs) provide a framework in which one can formulate physical theories that includes classical and quantum theories, but also many other alternative theories. In order to compare different GPTs, we advocate an approach in which one views a state in a GPT as a resource and quantifies the cost of interconverting between different such resources. We illustrate this approach on polygon theories [New J. Phys. 13, 063024 (2011).] that interpolate (as the number nnn of edges of the polygon increases) between a classical trit (when n=3n=3n=3) and a real quantum bit (when $n=\ensuremath{\infty}$). Our main results are that simulating the transmission of a single nnn-gon state requires more than one qubit, or more than log(log(n))log(log(n))log(log(n)) bits, and that nnn-gon states with nnn odd cannot be simulated by ${n}^{\ensuremath{'}}$-gon states with ${n}^{\ensuremath{'}}$ even (for all $n,{n}^{\ensuremath{'}}$). These results are obtained by showing that the classical capacity of a single nnn-gon state with nnn even is 1 bit, whereas it is larger than 1 bit when nnn is odd; by showing that transmitting a single nnn-gon state with nnn even violates information causality; and by studying the communication complexity cost of the nondeterministic not-equal function using nnn-gon states.
We investigate antidistinguishability of states within the framework of general probabilistic theories (GPTs). We formulate antidistinguishability, strong and equal antidistinguishability as refined notions that imposed additional constraint on the measurement effects. We establish general results relating these notions of antidistinguishability and derive an upper bound on the cardinality of equally antidistinguishable sets in terms of the affine dimension of the state space. We then study antidistinguishability in polygonal theories, obtaining conditions for antidistinguishability of a set of states. In consequence, we show that the set of all pure states in a polygon model is antidistinguishable. Additionally, we identify broad families of strongly and equally antidistinguishable states. Finally, using Random Exclusion Codes, whose success probability is governed by the antidistinguishability of different sets of encoding states, we probe the nonclassicality of polygon theories. We find that certain polygon models can outperform the optimal quantum value, while their optimal performance converges to the quantum limit in the large-polygon limit.
Abstract The thermodynamical entropy of a system which consists of different kinds of ideal gases is known to be defined successfully in the case when the differences are described by classical or quantum theory. Since these theories are special examples in the framework of generalized probabilistic theories (GPTs), it is natural to generalize the notion of thermodynamical entropy to systems where the internal degrees of particles are described by other possible theories. In this paper, we consider thermodynamical entropy of mixing in a specific series of theories of GPTs called the regular polygon theories, which can be regarded from a geometrical perspective as intermediate theories between a classical trit and a quantum bit with real coefficients. We prove that the operationally natural thermodynamical entropy of mixing does not exist in those inbetween theories, that is, the existence of the natural entropy results in classical and quantum-like theories among the regular polygon theories.
Resource theories provide a framework for thermodynamics beyond the thermodynamic limit. For systems with definite energy,the key resource is purity. In this paper we formulate three alternative resource theories of purity in the framework of general probabilistic theories (GPTs). Each resource theory corresponds to a different choice of free operations, including i)random reversible operations, ii)noisy operations, generated by reversible interactions with ancillas in the microcanonical state, and iii)unital operations, which preserve the microcanonical state.We determine the requirements the underlying GPT must satisfy in order to support well-behaved resource theories with the above sets as free operations. Then, we focus on a special class of physical theories, called sharp theories with purification, which are appealing for an information-theoretic foundation of thermodynamics. For every sharp theory with purification we show that the convertibility of states implies the validity of a majorisation condition. Moreover, we characterise exactly when majorisation is sufficient for convertibility via random reversible operations. Under this condition, we prove that i) random reversible, noisy, and unital operations obey inclusion relations like in quantum theory, ii) despite being different, the three sets of operations are equivalent in terms of convertibility, iii) there exists a one-to-one correspondence between measures of purity and Schur-convex functions, and iv) purity resources are dual to entanglement resources.