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:1810.12845

Constraints on Multipartite Quantum Entropies

Christian Majenz

Published Oct 30, 2018• 6 citations
arXivHTMLPDF

Abstract

The von Neumann entropy plays a vital role in quantum information theory. The von Neumann entropy determines, e.g., the capacities of quantum channels. Also, entropies of composite quantum systems are important for future quantum networks, and their characterization is related to the quantum marginal problem. Furthermore, they play a role in quantum thermodynamics. In this thesis the set of quantum entropies of multipartite quantum systems is studied. The problem of its characterization is not new -- however, progress has been sparse, indicating that the problem might be hard and that new methods might be needed. Here, a variety of different and complementary approaches are taken. First, I look at global properties. It is known that the von Neumann entropy region -- just like its classical counterpart -- forms a convex cone. I describe the symmetries of this cone and highlight geometric similarities and differences to the classical entropy cone. In a different approach, I utilize the local geometric properties of extremal rays of a cone. I show that quantum states whose entropy lies on such an extremal ray of the quantum entropy cone have a very simple structure. As the set of all quantum states is very complicated, I look at a simple subset called stabilizer states. I improve on previously known results by showing that under a technical condition on the local dimension, entropies of stabilizer states respect an additional class of information inequalities that is valid for random variables from linear codes. In a last approach I find a representation-theoretic formulation of the classical marginal problem simplifying the comparison with its quantum mechanical counterpart. This novel correspondence yields a simplified formulation of the group characterization of classical entropies (IEEE Trans. Inf. Theory, 48(7):1992-1995, 2002) in purely combinatorial terms.

DOI
10.48550/arxiv.1810.12845

Related papers

Stabilizer information inequalities from phase space distributions

David Gross, Michael Walter

The Shannon entropy of a collection of random variables is subject to a number of constraints, the best-known examples being monotonicity and strong subadditivity. It remains an open question to decide which of these “laws of information theory” are also respected by the von Neumann entropy of many-body quantum states. In this article, we consider a toy version of this difficult problem by analyzing the von Neumann entropy of stabilizer states. We find that the von Neumann entropy of stabilizer states satisfies all balanced information inequalities that hold in the classical case. Our argument is built on the fact that stabilizer states have a classical model, provided by the discrete Wigner function: The phase-space entropy of the Wigner function corresponds directly to the von Neumann entropy of the state, which allows us to reduce to the classical case. Our result has a natural counterpart for multi-mode Gaussian states, which sheds some light on the general properties of the construction. We also discuss the relation of our results to recent work by Linden, Ruskai, and Winter [“The quantum entropy cone of stabiliser states,” e-print arXiv:1302.5453].

arXiv:1302.6990•Journal of Mathematical Physics•Aug 1, 2013•48 citations

Tip of the Quantum Entropy Cone

Matthias Christandl, Bergfinnur Durhuus, Lasse Harboe Wolff

Relations among von Neumann entropies of different parts of an N-partite quantum system have direct impact on our understanding of diverse situations ranging from spin systems to quantum coding theory and black holes. Best formulated in terms of the set Σ_{N}^{*} of possible vectors comprising the entropies of the whole and its parts, the famous strong subaddivity inequality constrains its closure Σ[over ¯]_{N}^{*}, which is a convex cone. Further homogeneous constrained inequalities are also known. In this Letter we provide (nonhomogeneous) inequalities that constrain Σ_{N}^{*} near the apex (the vector of zero entropies) of Σ[over ¯]_{N}^{*}, in particular showing that Σ_{N}^{*} is not a cone for N≥3. Our inequalities apply to vectors with certain entropy constraints saturated and, in particular, they show that while it is always possible to upscale an entropy vector to arbitrary integer multiples it is not always possible to downscale it to arbitrarily small size, thus answering a question posed by Winter.

arXiv:2306.00199•Physical Review Letters•Dec 13, 2023•5 citations

The Quantum Entropy Cone of Stabiliser States

Noah Linden, František Matúš, Mary Beth Ruskai +1 more

We investigate the universal linear inequalities that hold for the von Neumann entropies in a multi-party system, prepared in a stabiliser state. We demonstrate here that entropy vectors for stabiliser states satisfy, in addition to the classic inequalities, a type of linear rank inequalities associated with the combinatorial structure of normal subgroups of certain matrix groups. In the 4-party case, there is only one such inequality, the so-called Ingleton inequality. For these systems we show that strong subadditivity, weak monotonicity and Ingleton inequality exactly characterize the entropy cone for stabiliser states.

arXiv:1302.5453•Leibniz international proceedings in informatics•Jan 1, 2013•46 citations

Localizing quantum information

Fahimeh Bayeh, Andre Kornell

The idea that information can be localized is pervasive in physics. In thermodynamics, entropy flows from one reservoir to another, and in quantum gravity, the entropy content of some spatial regions is bounded. In quantum information theory, information is transmitted from one place to another, and entanglement can provide an advantage when there are constraints on such transmission. Shannon entropy quantifies localizable information in the sense that marginalization defines an outer measure on the set of parts of a classical multipartite system. In contrast, von Neumann entropy does not quantify localizable information in this sense. However, a variant of von Neumann entropy, which originates in noncommutative geometry, does. We prove that this adjusted von Neumann entropy is the minimum quantum entropy that quantifies localizable information. We also prove that this is the unique quantum entropy that characterizes Bell states in terms of redundant information, directly generalizing the classical case. We work with finite-dimensional $C^*$-algebras throughout, modeling finite quantum systems that may have superselection sectors.

quant-pharXiv:2609.01966•Sep 3, 2026•0 citations

The quantum marginal independence problem

Sergio Hernández-Cuenca, Veronika E. Hubeny, Mukund Rangamani +1 more

We investigate whether the presence or absence of correlations between subsystems of an N-partite quantum system is solely constrained by the non-negativity and monotonicity of mutual information. We argue that this relatively simple question is in fact very deep because it is sensitive to the structure of the set of N-partite states. It can be informed by inequalities satisfied by the von Neumann entropy, but has the advantage of being more tractable. We exemplify this by deriving the explicit solution for N=4, despite having limited knowledge of the entropic inequalities. Furthermore, we describe how this question can be tailored to the analysis of more specialized classes of states such as classical probability distributions, stabilizer states, and geometric states in the holographic gauge/gravity duality.

arXiv:1912.01041•Dec 2, 2019•23 citations

Quantum Entropy Prover

Shao‐Lun Huang, Tobias Rippchen, Mario Berta

Information inequalities govern the ultimate limitations in information theory and as such play a pivotal role in characterizing what values the entropy of multipartite states can take. Proving an information inequality, however, quickly becomes arduous when the number of involved parties increases. For classical systems, [Yeung, IEEE Trans. Inf. Theory (1997)] proposed a framework to prove Shannon-type inequalities via linear programming. Here, we derive an analogous framework for quantum systems, based on the strong sub-additivity and weak monotonicity inequalities for the von-Neumann entropy. Importantly, this also allows us to handle constrained inequalities, which - in the classical case - served as a crucial tool in proving the existence of non-standard, so-called non-Shannon-type inequalities [Zhang & Yeung, IEEE Trans. Inf. Theory (1998)]. Our main contribution is the Python package qITIP, for which we present the theory and demonstrate its capabilities with several illustrative examples.

arXiv:2501.16025•IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•0 citations
The von Neumann entropy plays a vital role in quantum information theory. The von Neumann entropy determines, e.g., the capacities of quantum channels. Also, entropies of composite quantum systems are important for future quantum networks, and their characterization is related to the quantum marginal problem. Furthermore, they play a role in quantum thermodynamics. In this thesis the set of quantum entropies of multipartite quantum systems is studied. The problem of its characterization is not new -- however, progress has been sparse, indicating that the problem might be hard and that new methods might be needed. Here, a variety of different and complementary approaches are taken. First, I look at global properties. It is known that the von Neumann entropy region -- just like its classical counterpart -- forms a convex cone. I describe the symmetries of this cone and highlight geometric similarities and differences to the classical entropy cone. In a different approach, I utilize the local geometric properties of extremal rays of a cone. I show that quantum states whose entropy lies on such an extremal ray of the quantum entropy cone have a very simple structure. As the set of all quantum states is very complicated, I look at a simple subset called stabilizer states. I improve on previously known results by showing that under a technical condition on the local dimension, entropies of stabilizer states respect an additional class of information inequalities that is valid for random variables from linear codes. In a last approach I find a representation-theoretic formulation of the classical marginal problem simplifying the comparison with its quantum mechanical counterpart. This novel correspondence yields a simplified formulation of the group characterization of classical entropies (IEEE Trans. Inf. Theory, 48(7):1992-1995, 2002) in purely combinatorial terms.
The Shannon entropy of a collection of random variables is subject to a number of constraints, the best-known examples being monotonicity and strong subadditivity. It remains an open question to decide which of these “laws of information theory” are also respected by the von Neumann entropy of many-body quantum states. In this article, we consider a toy version of this difficult problem by analyzing the von Neumann entropy of stabilizer states. We find that the von Neumann entropy of stabilizer states satisfies all balanced information inequalities that hold in the classical case. Our argument is built on the fact that stabilizer states have a classical model, provided by the discrete Wigner function: The phase-space entropy of the Wigner function corresponds directly to the von Neumann entropy of the state, which allows us to reduce to the classical case. Our result has a natural counterpart for multi-mode Gaussian states, which sheds some light on the general properties of the construction. We also discuss the relation of our results to recent work by Linden, Ruskai, and Winter [“The quantum entropy cone of stabiliser states,” e-print arXiv:1302.5453].
Relations among von Neumann entropies of different parts of an N-partite quantum system have direct impact on our understanding of diverse situations ranging from spin systems to quantum coding theory and black holes. Best formulated in terms of the set Σ_{N}^{*} of possible vectors comprising the entropies of the whole and its parts, the famous strong subaddivity inequality constrains its closure Σ[over ¯]_{N}^{*}, which is a convex cone. Further homogeneous constrained inequalities are also known. In this Letter we provide (nonhomogeneous) inequalities that constrain Σ_{N}^{*} near the apex (the vector of zero entropies) of Σ[over ¯]_{N}^{*}, in particular showing that Σ_{N}^{*} is not a cone for N≥3. Our inequalities apply to vectors with certain entropy constraints saturated and, in particular, they show that while it is always possible to upscale an entropy vector to arbitrary integer multiples it is not always possible to downscale it to arbitrarily small size, thus answering a question posed by Winter.
We investigate the universal linear inequalities that hold for the von Neumann entropies in a multi-party system, prepared in a stabiliser state. We demonstrate here that entropy vectors for stabiliser states satisfy, in addition to the classic inequalities, a type of linear rank inequalities associated with the combinatorial structure of normal subgroups of certain matrix groups. In the 4-party case, there is only one such inequality, the so-called Ingleton inequality. For these systems we show that strong subadditivity, weak monotonicity and Ingleton inequality exactly characterize the entropy cone for stabiliser states.
The idea that information can be localized is pervasive in physics. In thermodynamics, entropy flows from one reservoir to another, and in quantum gravity, the entropy content of some spatial regions is bounded. In quantum information theory, information is transmitted from one place to another, and entanglement can provide an advantage when there are constraints on such transmission. Shannon entropy quantifies localizable information in the sense that marginalization defines an outer measure on the set of parts of a classical multipartite system. In contrast, von Neumann entropy does not quantify localizable information in this sense. However, a variant of von Neumann entropy, which originates in noncommutative geometry, does. We prove that this adjusted von Neumann entropy is the minimum quantum entropy that quantifies localizable information. We also prove that this is the unique quantum entropy that characterizes Bell states in terms of redundant information, directly generalizing the classical case. We work with finite-dimensional C∗C^*C∗-algebras throughout, modeling finite quantum systems that may have superselection sectors.
We investigate whether the presence or absence of correlations between subsystems of an N-partite quantum system is solely constrained by the non-negativity and monotonicity of mutual information. We argue that this relatively simple question is in fact very deep because it is sensitive to the structure of the set of N-partite states. It can be informed by inequalities satisfied by the von Neumann entropy, but has the advantage of being more tractable. We exemplify this by deriving the explicit solution for N=4, despite having limited knowledge of the entropic inequalities. Furthermore, we describe how this question can be tailored to the analysis of more specialized classes of states such as classical probability distributions, stabilizer states, and geometric states in the holographic gauge/gravity duality.
Information inequalities govern the ultimate limitations in information theory and as such play a pivotal role in characterizing what values the entropy of multipartite states can take. Proving an information inequality, however, quickly becomes arduous when the number of involved parties increases. For classical systems, [Yeung, IEEE Trans. Inf. Theory (1997)] proposed a framework to prove Shannon-type inequalities via linear programming. Here, we derive an analogous framework for quantum systems, based on the strong sub-additivity and weak monotonicity inequalities for the von-Neumann entropy. Importantly, this also allows us to handle constrained inequalities, which - in the classical case - served as a crucial tool in proving the existence of non-standard, so-called non-Shannon-type inequalities [Zhang & Yeung, IEEE Trans. Inf. Theory (1998)]. Our main contribution is the Python package qITIP, for which we present the theory and demonstrate its capabilities with several illustrative examples.