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:2401.13029 · SciPost Physics

Two infinite families of facets of the holographic entropy cone

Bartłomiej Czech, Yu Liu, Bo Yu

Published Sep 19, 2024• 22 citations
arXivHTMLPDF

Abstract

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.

DOI
10.21468/scipostphys.17.3.084

Related papers

Superbalance of holographic entropy inequalities

Temple He, Veronika E. Hubeny, Rangamani, M

The domain of allowed von Neumann entropies of a holographic field theory carves out a polyhedral cone — the holographic entropy cone — in entropy space. Such polyhedral cones are characterized by their extreme rays. For an arbitrary number of parties, it is known that the so-called perfect tensors are extreme rays. In this work, we constrain the form of the remaining extreme rays by showing that they correspond to geometries with vanishing mutual information between any two parties, ensuring the absence of Bell pair type entanglement between them. This is tantamount to proving that besides subadditivity, all non-redundant holographic entropy inequalities are superbalanced, i.e. not only do UV divergences cancel in the inequality itself (assuming smooth entangling surfaces), but also in the purification thereof.

•Jul 1, 2020•23 citations

Holographic entropy relations repackaged

Temple He

We explore the structure of holographic entropy relations (associated with ‘information quantities’ given by a linear combination of entanglement entropies of spatial sub-partitions of a CFT state with geometric bulk dual). Such entropy relations can be recast in multiple ways, some of which have significant advantages. Motivated by the already-noted simplification of entropy relations when recast in terms of multipartite information, we explore additional simplifications when recast in a new basis, which we dub the K-basis, constructed from perfect tensor structures. For the fundamental information quantities such a recasting is surprisingly compact, in part due to the interesting fact that entropy vectors associated to perfect tensors are in fact extreme rays in the holographic entropy cone (as well as the full quantum entropy cone). More importantly, we prove that all holographic entropy inequalities have positive coefficients when expressed in the K-basis, underlying the key advantage over the entropy basis or the multipartite information basis.

•May 27, 2022•33 citations

Superbalance of holographic entropy inequalities

Temple He, Veronika E. Hubeny, Mukund Rangamani

Abstract The domain of allowed von Neumann entropies of a holographic field theory carves out a polyhedral cone — the holographic entropy cone — in entropy space. Such polyhedral cones are characterized by their extreme rays. For an arbitrary number of parties, it is known that the so-called perfect tensors are extreme rays. In this work, we constrain the form of the remaining extreme rays by showing that they correspond to geometries with vanishing mutual information between any two parties, ensuring the absence of Bell pair type entanglement between them. This is tantamount to proving that besides subadditivity, all non-redundant holographic entropy inequalities are superbalanced, i.e. not only do UV divergences cancel in the inequality itself (assuming smooth entangling surfaces), but also in the purification thereof.

arXiv:2002.04558•Journal of High Energy Physics•Jul 1, 2020•40 citations

Holographic entropy relations repackaged

Temple He, Matthew Headrick, Veronika E. Hubeny

Abstract We explore the structure of holographic entropy relations (associated with ‘information quantities’ given by a linear combination of entanglement entropies of spatial sub-partitions of a CFT state with geometric bulk dual). Such entropy relations can be recast in multiple ways, some of which have significant advantages. Motivated by the already-noted simplification of entropy relations when recast in terms of multipartite information, we explore additional simplifications when recast in a new basis, which we dub the K-basis, constructed from perfect tensor structures. For the fundamental information quantities such a recasting is surprisingly compact, in part due to the interesting fact that entropy vectors associated to perfect tensors are in fact extreme rays in the holographic entropy cone (as well as the full quantum entropy cone). More importantly, we prove that all holographic entropy inequalities have positive coefficients when expressed in the K-basis, underlying the key advantage over the entropy basis or the multipartite information basis.

arXiv:1905.06985•Journal of High Energy Physics•Oct 1, 2019•44 citations

The Holographic Entropy Arrangement

Veronika E. Hubeny, Mukund Rangamani, Massimiliano Rota

Abstract 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.

arXiv:1812.08133•Fortschritte der Physik•Feb 27, 2019•72 citations

Exploring the holographic entropy cone via reinforcement learning

Temple He, Jaeha Lee, Hirosi Ooguri

We develop a reinforcement learning algorithm to study the holographic entropy cone. Given a target entropy vector, our algorithm searches for a graph realization whose min-cut entropies match the target vector. If the target vector does not admit such a graph realization, it must lie outside the cone, in which case the algorithm finds a graph whose corresponding entropy vector most nearly approximates the target and allows us to probe the location of the facets. For the $\sf N=3$ cone, we confirm that our algorithm successfully rediscovers monogamy of mutual information beginning with a target vector outside the holographic entropy cone. We then apply the algorithm to the $\sf N=6$ cone, analyzing the 6 "mystery" extreme rays of the subadditivity cone from arXiv:2412.15364 that satisfy all known holographic entropy inequalities yet lacked graph realizations. We found realizations for 3 of them, proving they are genuine extreme rays of the holographic entropy cone, while providing evidence that the remaining 3 are not realizable, implying unknown holographic inequalities exist for $\sf N=6$.

hep-thCross-listedarXiv:2601.19979•Journal of High Energy Physics•Jan 29, 2026•1 citation
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.
The domain of allowed von Neumann entropies of a holographic field theory carves out a polyhedral cone — the holographic entropy cone — in entropy space. Such polyhedral cones are characterized by their extreme rays. For an arbitrary number of parties, it is known that the so-called perfect tensors are extreme rays. In this work, we constrain the form of the remaining extreme rays by showing that they correspond to geometries with vanishing mutual information between any two parties, ensuring the absence of Bell pair type entanglement between them. This is tantamount to proving that besides subadditivity, all non-redundant holographic entropy inequalities are superbalanced, i.e. not only do UV divergences cancel in the inequality itself (assuming smooth entangling surfaces), but also in the purification thereof.
We explore the structure of holographic entropy relations (associated with ‘information quantities’ given by a linear combination of entanglement entropies of spatial sub-partitions of a CFT state with geometric bulk dual). Such entropy relations can be recast in multiple ways, some of which have significant advantages. Motivated by the already-noted simplification of entropy relations when recast in terms of multipartite information, we explore additional simplifications when recast in a new basis, which we dub the K-basis, constructed from perfect tensor structures. For the fundamental information quantities such a recasting is surprisingly compact, in part due to the interesting fact that entropy vectors associated to perfect tensors are in fact extreme rays in the holographic entropy cone (as well as the full quantum entropy cone). More importantly, we prove that all holographic entropy inequalities have positive coefficients when expressed in the K-basis, underlying the key advantage over the entropy basis or the multipartite information basis.
Abstract The domain of allowed von Neumann entropies of a holographic field theory carves out a polyhedral cone — the holographic entropy cone — in entropy space. Such polyhedral cones are characterized by their extreme rays. For an arbitrary number of parties, it is known that the so-called perfect tensors are extreme rays. In this work, we constrain the form of the remaining extreme rays by showing that they correspond to geometries with vanishing mutual information between any two parties, ensuring the absence of Bell pair type entanglement between them. This is tantamount to proving that besides subadditivity, all non-redundant holographic entropy inequalities are superbalanced, i.e. not only do UV divergences cancel in the inequality itself (assuming smooth entangling surfaces), but also in the purification thereof.
Abstract We explore the structure of holographic entropy relations (associated with ‘information quantities’ given by a linear combination of entanglement entropies of spatial sub-partitions of a CFT state with geometric bulk dual). Such entropy relations can be recast in multiple ways, some of which have significant advantages. Motivated by the already-noted simplification of entropy relations when recast in terms of multipartite information, we explore additional simplifications when recast in a new basis, which we dub the K-basis, constructed from perfect tensor structures. For the fundamental information quantities such a recasting is surprisingly compact, in part due to the interesting fact that entropy vectors associated to perfect tensors are in fact extreme rays in the holographic entropy cone (as well as the full quantum entropy cone). More importantly, we prove that all holographic entropy inequalities have positive coefficients when expressed in the K-basis, underlying the key advantage over the entropy basis or the multipartite information basis.
Abstract 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.
We develop a reinforcement learning algorithm to study the holographic entropy cone. Given a target entropy vector, our algorithm searches for a graph realization whose min-cut entropies match the target vector. If the target vector does not admit such a graph realization, it must lie outside the cone, in which case the algorithm finds a graph whose corresponding entropy vector most nearly approximates the target and allows us to probe the location of the facets. For the N=3\sf N=3N=3 cone, we confirm that our algorithm successfully rediscovers monogamy of mutual information beginning with a target vector outside the holographic entropy cone. We then apply the algorithm to the N=6\sf N=6N=6 cone, analyzing the 6 "mystery" extreme rays of the subadditivity cone from arXiv:2412.15364 that satisfy all known holographic entropy inequalities yet lacked graph realizations. We found realizations for 3 of them, proving they are genuine extreme rays of the holographic entropy cone, while providing evidence that the remaining 3 are not realizable, implying unknown holographic inequalities exist for N=6\sf N=6N=6.