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

Stabilizer entropy cones as self-dual slices of linear rank cones: a five-party gap and dependence on the local dimension

Xidan Song, Ruifeng Cao

cs.ITmath.COquant-phSubmitted Oct 11, 2026• Announced Oct 13, 2026• 0 citations
arXivHTMLPDF

Abstract

Entanglement entropies of multipartite pure states satisfy linear inequalities; for stabilizer states, the backbone of quantum error correction, the achievable entropy vectors generate a convex cone. We show that, after a linear lift, the closure of this cone is exactly the self-dual slice of a classical object on one more element than there are parties: the closed cone generated by the rank functions of arrangements of subspaces over $\mathrm{GF}(d)$ for a prime local dimension $d$, and of subgroups of abelian groups of exponent dividing $d$ in general. This correspondence brings two features of rank inequalities into play. First, the purifier acts as an extra variable: already for five parties the stabilizer cone is strictly smaller than the quantum linear rank cone, with which earlier evidence suggested it might coincide; an explicit six-variable inequality witnesses the gap. Second, the characteristic of the field enters, so the cone depends on the local dimension. It does not for up to four parties. With enough parties, the cone of $\mathbb{Z}_d$ qudits is contained in that of $\mathbb{Z}_{d'}$ qudits if and only if $d$ divides $d'$, and already for six parties the logical zero state of Steane's code lies outside the stabilizer cone of every odd local dimension. For this last result we show that the seven-variable characteristic-dependent inequalities we checked all follow from Shannon inequalities on the self-dual slice, and instead transfer one of them through a family of subgroups derived from the Fano plane.

Comments
29 pages, 4 figures, 6 tables. Data, certificates and code: doi:10.5281/zenodo.23303466. Submitted to PRX Quantum

Related papers

A Gap Between the Hypergraph and Stabilizer Entropy Cones

Ning Bao, Newton Cheng, Sergio Hernández-Cuenca +1 more

It was recently found that the stabilizer and hypergraph entropy cones coincide for four parties, leading to a conjecture of their equivalence at higher party numbers. In this note, we show this conjecture to be false by proving new inequalities obeyed by all hypergraph entropy vectors that exclude particular stabilizer states on six qubits. By further leveraging this connection, we improve the characterization of stabilizer entropies and show that all linear rank inequalities at five parties, except for classical monotonicity, form facets of the stabilizer cone. Additionally, by studying minimum cuts on hypergraphs, we prove some structural properties of hypergraph representations of entanglement and generalize the notion of entanglement wedge nesting in holography.

arXiv:2006.16292•Jun 29, 2020•11 citations

Constraints on Multipartite Quantum Entropies

Christian Majenz

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.

arXiv:1810.12845•Oct 30, 2018•2 citations

The quantum entropy cone of hypergraphs

Ning Bao, Newton Cheng, Sergio Hernández-Cuenca +1 more

In this work, we generalize the graph-theoretic techniques used for the holographic entropy cone to study hypergraphs and their analogously-defined entropy cone. This allows us to develop a framework to efficiently compute entropies and prove inequalities satisfied by hypergraphs. In doing so, we discover a class of quantum entropy vectors which reach beyond those of holographic states and obey constraints intimately related to the ones obeyed by stabilizer states and linear ranks. We show that, at least up to 4 parties, the hypergraph cone is identical to the stabilizer entropy cone, thus demonstrating that the hypergraph framework is broadly applicable to the study of entanglement entropy. We conjecture that this equality continues to hold for higher party numbers and report on partial progress on this direction. To physically motivate this conjectured equivalence, we also propose a plausible method inspired by tensor networks to construct a quantum state from a given hypergraph such that their entropy vectors match.

arXiv:2002.05317•SciPost Physics•Nov 10, 2020•35 citations

The Holographic Entropy Arrangement

Veronika E. Hubeny, Rangamani, M, Rota, M

We develop a convenient framework for characterizing multipartite entanglement in composite systems, based on relations between entropies of various subsystems. This continues the program initiated in [1], of using holography to effectively recast the geometric problem into an algebraic one. We prove that, for an arbitrary number of parties, our procedure identifies a finite set of entropic information quantities that we conveniently represent geometrically in the form of an arrangement of hyperplanes. This leads us to define the holographic entropy arrangement, whose algebraic and combinatorial aspects we explore in detail. Using the framework, we derive three new information quantities for four parties, as well as a new infinite family for any number of parties. A natural construct from the arrangement is the holographic entropy polyhedron which captures holographic entropy inequalities describing the physically allowed region of entropy space. We illustrate how to obtain the polyhedron by winnowing down the arrangement through a sieve to pick out candidate sign-definite information quantities. Comparing the polyhedron with the holographic entropy cone, we find perfect agreement for 4 parties and corroborating evidence for the conjectured 5-party entropy cone. We work with explicit configurations in arbitrary (time-dependent) states leading to both simple derivations and an intuitive picture of the entanglement pattern.

•Apr 1, 2019•52 citations

Optimal entanglement criteria from trace invariants

Bivas Mallick, Aabhas Gulati, Ion Nechita

Randomized measurement protocols give experimental access to low-degree polynomial invariants of a quantum state rather than to the state itself, which raises the question of what the best entanglement criterion is that can be built from finitely many such invariants. In this work we answer this question through convex duality. For each degree we introduce the cone of local unitary trace inequalities that are valid for separable bipartite states in all local dimensions, together with its one-matrix counterparts for Hermitian and positive semidefinite matrices. Each cone is the polar dual of a moment cone; we also determine the minimal combinatorial parametrization of the separable cone. The framework organizes the known moment criteria: the PPT criterion using the first three moments of the partial transposition is the image under an embedding of a Hankel determinant from the positive semidefinite cone to the bipartite cone, which we show to be an extremal ray, and we determine the first nontrivial separable cone completely, finding exactly four extremal rays. The framework allows us to analyze the realignment criterion and its centered (or enhanced) variant. We prove that the even singular value moments of the (centered) realignment matrix are trace invariants, associated with explicit fixed-point-free involutions. Extracting the optimal trace-norm bound from $m$ such moments thus becomes a dimension-free truncated moment problem, which we solve in closed form for $m = 2$ and relax to a semidefinite program of size $O(m)$ for arbitrary $m$. The dual solutions are polynomial minorants of $\sqrt{x}$ on $[0,1]$, and two explicit families, binomial and $L^1$-weighted, yield hierarchies of separability inequalities. Finally, we compare the criteria against one another and on PPT entangled states.

quant-pharXiv:2609.29471•Sep 25, 2026•0 citations

Inner bounding the quantum entropy cone with subadditivity and subsystem coarse grainings

Temple He, Veronika E. Hubeny, Massimiliano Rota

We show via explicit construction that all the extreme rays of both the three-party quantum entropy cone and the four-party stabilizer entropy cone can be obtained from subsystem coarse grainings of specific higher-party quantum states, namely, extreme states characterized by saturating a (nontrivial) maximal set of instances of subadditivity. This suggests that the study of the ``subadditivity cone,'' and the set of its extreme rays realizable in quantum mechanics, provides a powerful tool for deriving inner bounds for the quantum and stabilizer entropy cones, as well as constraints on new inequalities for the von Neumann entropy.

arXiv:2312.04074•Physical Review A•May 6, 2024•7 citations
Entanglement entropies of multipartite pure states satisfy linear inequalities; for stabilizer states, the backbone of quantum error correction, the achievable entropy vectors generate a convex cone. We show that, after a linear lift, the closure of this cone is exactly the self-dual slice of a classical object on one more element than there are parties: the closed cone generated by the rank functions of arrangements of subspaces over GF(d)\mathrm{GF}(d)GF(d) for a prime local dimension ddd, and of subgroups of abelian groups of exponent dividing ddd in general. This correspondence brings two features of rank inequalities into play. First, the purifier acts as an extra variable: already for five parties the stabilizer cone is strictly smaller than the quantum linear rank cone, with which earlier evidence suggested it might coincide; an explicit six-variable inequality witnesses the gap. Second, the characteristic of the field enters, so the cone depends on the local dimension. It does not for up to four parties. With enough parties, the cone of Zd\mathbb{Z}_dZd​ qudits is contained in that of Zd′\mathbb{Z}_{d'}Zd′​ qudits if and only if ddd divides d′d'd′, and already for six parties the logical zero state of Steane's code lies outside the stabilizer cone of every odd local dimension. For this last result we show that the seven-variable characteristic-dependent inequalities we checked all follow from Shannon inequalities on the self-dual slice, and instead transfer one of them through a family of subgroups derived from the Fano plane.
It was recently found that the stabilizer and hypergraph entropy cones coincide for four parties, leading to a conjecture of their equivalence at higher party numbers. In this note, we show this conjecture to be false by proving new inequalities obeyed by all hypergraph entropy vectors that exclude particular stabilizer states on six qubits. By further leveraging this connection, we improve the characterization of stabilizer entropies and show that all linear rank inequalities at five parties, except for classical monotonicity, form facets of the stabilizer cone. Additionally, by studying minimum cuts on hypergraphs, we prove some structural properties of hypergraph representations of entanglement and generalize the notion of entanglement wedge nesting in holography.
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.
In this work, we generalize the graph-theoretic techniques used for the holographic entropy cone to study hypergraphs and their analogously-defined entropy cone. This allows us to develop a framework to efficiently compute entropies and prove inequalities satisfied by hypergraphs. In doing so, we discover a class of quantum entropy vectors which reach beyond those of holographic states and obey constraints intimately related to the ones obeyed by stabilizer states and linear ranks. We show that, at least up to 4 parties, the hypergraph cone is identical to the stabilizer entropy cone, thus demonstrating that the hypergraph framework is broadly applicable to the study of entanglement entropy. We conjecture that this equality continues to hold for higher party numbers and report on partial progress on this direction. To physically motivate this conjectured equivalence, we also propose a plausible method inspired by tensor networks to construct a quantum state from a given hypergraph such that their entropy vectors match.
We develop a convenient framework for characterizing multipartite entanglement in composite systems, based on relations between entropies of various subsystems. This continues the program initiated in [1], of using holography to effectively recast the geometric problem into an algebraic one. We prove that, for an arbitrary number of parties, our procedure identifies a finite set of entropic information quantities that we conveniently represent geometrically in the form of an arrangement of hyperplanes. This leads us to define the holographic entropy arrangement, whose algebraic and combinatorial aspects we explore in detail. Using the framework, we derive three new information quantities for four parties, as well as a new infinite family for any number of parties. A natural construct from the arrangement is the holographic entropy polyhedron which captures holographic entropy inequalities describing the physically allowed region of entropy space. We illustrate how to obtain the polyhedron by winnowing down the arrangement through a sieve to pick out candidate sign-definite information quantities. Comparing the polyhedron with the holographic entropy cone, we find perfect agreement for 4 parties and corroborating evidence for the conjectured 5-party entropy cone. We work with explicit configurations in arbitrary (time-dependent) states leading to both simple derivations and an intuitive picture of the entanglement pattern.
Randomized measurement protocols give experimental access to low-degree polynomial invariants of a quantum state rather than to the state itself, which raises the question of what the best entanglement criterion is that can be built from finitely many such invariants. In this work we answer this question through convex duality. For each degree we introduce the cone of local unitary trace inequalities that are valid for separable bipartite states in all local dimensions, together with its one-matrix counterparts for Hermitian and positive semidefinite matrices. Each cone is the polar dual of a moment cone; we also determine the minimal combinatorial parametrization of the separable cone. The framework organizes the known moment criteria: the PPT criterion using the first three moments of the partial transposition is the image under an embedding of a Hankel determinant from the positive semidefinite cone to the bipartite cone, which we show to be an extremal ray, and we determine the first nontrivial separable cone completely, finding exactly four extremal rays. The framework allows us to analyze the realignment criterion and its centered (or enhanced) variant. We prove that the even singular value moments of the (centered) realignment matrix are trace invariants, associated with explicit fixed-point-free involutions. Extracting the optimal trace-norm bound from mmm such moments thus becomes a dimension-free truncated moment problem, which we solve in closed form for m=2m = 2m=2 and relax to a semidefinite program of size O(m)O(m)O(m) for arbitrary mmm. The dual solutions are polynomial minorants of x\sqrt{x}x​ on [0,1][0,1][0,1], and two explicit families, binomial and L1L^1L1-weighted, yield hierarchies of separability inequalities. Finally, we compare the criteria against one another and on PPT entangled states.
We show via explicit construction that all the extreme rays of both the three-party quantum entropy cone and the four-party stabilizer entropy cone can be obtained from subsystem coarse grainings of specific higher-party quantum states, namely, extreme states characterized by saturating a (nontrivial) maximal set of instances of subadditivity. This suggests that the study of the ``subadditivity cone,'' and the set of its extreme rays realizable in quantum mechanics, provides a powerful tool for deriving inner bounds for the quantum and stabilizer entropy cones, as well as constraints on new inequalities for the von Neumann entropy.