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

A Gap Between the Hypergraph and Stabilizer Entropy Cones

Ning Bao, Newton Cheng, Sergio Hernández-Cuenca, Vincent Paul Su

Published Jun 29, 2020• 32 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2006.16292

Related papers

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•42 citations

Hypergraph min-cuts from quantum entropies

Michael Walter, Freek Witteveen

The von Neumann entropy of pure quantum states and the min-cut function of weighted hypergraphs are both symmetric submodular functions. In this article, we explain this coincidence by proving that the min-cut function of any weighted hypergraph can be approximated (up to an overall rescaling) by the entropies of quantum states known as stabilizer states. We do so by constructing a novel ensemble of random quantum states, built from tensor networks, whose entanglement structure is determined by a given hypergraph. This implies that the min-cuts of hypergraphs are constrained by quantum entropy inequalities, and it follows that the recently defined hypergraph cones are contained in the quantum stabilizer entropy cones, which confirms a conjecture made in the recent literature.

arXiv:2002.12397•Journal of Mathematical Physics•Sep 1, 2021•28 citations

Bit threads on hypergraphs

Ning Bao, Jonathan Harper

Recent work has characterized the various inequalities that entanglement entropies represented by min-cuts on hypergraphs will satisfy. This collection, the hypergraph entropy cone, can be seen as a generalization of the holographic entropy cone which describes the entropies given by both min-cuts on 2-graphs and those of holographic states in AdS/CFT. In this article we describe a generalization of bit threads which allows us to describe max multiflows on hypergraphs. We further comment on its properties and interpretation in holography.

arXiv:2012.07872•Dec 14, 2020•11 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

Entanglement and nonclassical properties of hypergraph states

Otfried Gühne, Martí Cuquet, Frank E. S. Steinhoff +5 more

Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a hypergraph that indicates a possible generation procedure of these states; alternatively, they can also be phrased in terms of a non-local stabilizer formalism. In this paper, we explore the entanglement properties and nonclassical features of hypergraph states. First, we identify the equivalence classes under local unitary transformations for up to four qubits, as well as important classes of five- and six-qubit states, and determine various entanglement properties of these classes. Second, we present general conditions under which the local unitary equivalence of hypergraph states can simply be decided by considering a finite set of transformations with a clear graph-theoretical interpretation. Finally, we consider the question whether hypergraph states and their correlations can be used to reveal contradictions with classical hidden variable theories. We demonstrate that various noncontextuality inequalities and Bell inequalities can be derived for hypergraph states.

arXiv:1404.6492•Journal of Physics A Mathematical and Theoretical•Aug 5, 2014•71 citations

Two infinite families of facets of the holographic entropy cone

Bartłomiej Czech, Yu Liu, Bo Yu

We verify that the recently proven infinite families of holographic entropy inequalities are maximally tight, i.e. they are facets of the holographic entropy cone. The proof is technical but it offers some heuristic insight. On star graphs, both families of inequalities quantify how concentrated/spread information is with respect to a dihedral symmetry acting on subsystems. In addition, toric inequalities viewed in the K-basis show an interesting interplay between four-party and six-party perfect tensors.

arXiv:2401.13029•SciPost Physics•Sep 19, 2024•22 citations
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.
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.
The von Neumann entropy of pure quantum states and the min-cut function of weighted hypergraphs are both symmetric submodular functions. In this article, we explain this coincidence by proving that the min-cut function of any weighted hypergraph can be approximated (up to an overall rescaling) by the entropies of quantum states known as stabilizer states. We do so by constructing a novel ensemble of random quantum states, built from tensor networks, whose entanglement structure is determined by a given hypergraph. This implies that the min-cuts of hypergraphs are constrained by quantum entropy inequalities, and it follows that the recently defined hypergraph cones are contained in the quantum stabilizer entropy cones, which confirms a conjecture made in the recent literature.
Recent work has characterized the various inequalities that entanglement entropies represented by min-cuts on hypergraphs will satisfy. This collection, the hypergraph entropy cone, can be seen as a generalization of the holographic entropy cone which describes the entropies given by both min-cuts on 2-graphs and those of holographic states in AdS/CFT. In this article we describe a generalization of bit threads which allows us to describe max multiflows on hypergraphs. We further comment on its properties and interpretation in holography.
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.
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a hypergraph that indicates a possible generation procedure of these states; alternatively, they can also be phrased in terms of a non-local stabilizer formalism. In this paper, we explore the entanglement properties and nonclassical features of hypergraph states. First, we identify the equivalence classes under local unitary transformations for up to four qubits, as well as important classes of five- and six-qubit states, and determine various entanglement properties of these classes. Second, we present general conditions under which the local unitary equivalence of hypergraph states can simply be decided by considering a finite set of transformations with a clear graph-theoretical interpretation. Finally, we consider the question whether hypergraph states and their correlations can be used to reveal contradictions with classical hidden variable theories. We demonstrate that various noncontextuality inequalities and Bell inequalities can be derived for hypergraph states.
We verify that the recently proven infinite families of holographic entropy inequalities are maximally tight, i.e. they are facets of the holographic entropy cone. The proof is technical but it offers some heuristic insight. On star graphs, both families of inequalities quantify how concentrated/spread information is with respect to a dihedral symmetry acting on subsystems. In addition, toric inequalities viewed in the K-basis show an interesting interplay between four-party and six-party perfect tensors.