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

A graphical framework for proving holographic entanglement entropy inequalities in multipartite systems

Chia-Jui Chou, Hans B. Lao, Yi Yang

quant-phhep-thSubmitted Dec 21, 2025• Announced Dec 23, 2025• 0 citations
arXivHTMLPDF

Abstract

We present a graphical method for proving holographic entanglement entropy inequalities (HEIs) in general multipartite systems. By introducing a geometric representation of the entanglement structure, we develop a systematic approach that enables one to visualize and verify the validity of HEIs for any number of subsystems $n$. Several theorems are established to formalize this method, and explicit examples are provided for systems with $n = 4$ to $7$ entangled regions.

Comments
30 pages, 11 figures

Related papers

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

Combinatorial properties of holographic entropy inequalities

Guglielmo Grimaldi, Matthew Headrick, Veronika E. Hubeny +1 more

A holographic entropy inequality (HEI) is a linear inequality obeyed by Ryu-Takayanagi holographic entanglement entropies, or equivalently by the minimum cut function on weighted graphs. We establish a new combinatorial framework for studying HEIs, and use it to prove several properties they share, including two majorization-related properties as well as a necessary and sufficient condition for an inequality to be an HEI. We thereby resolve all the conjectures presented in [arXiv:2508.21823], proving two of them and disproving the other two. In particular, we show that the null reduction of any superbalanced HEI passes the majorization test defined in [arXiv:2508.21823], thereby providing strong new evidence that all HEIs are obeyed in time-dependent holographic states.

hep-thCross-listedarXiv:2601.09987•Jan 16, 2026

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

Holographic entropy inequalities and gapped phases of matter

Ning Bao, ChunJun Cao, Michael Walter +1 more

We extend our studies of holographic entropy inequalities to gapped phases of matter. For any number of regions, we determine the linear entropy inequalities satisfied by systems in which the entanglement entropy satisfies an exact area law. In particular, we find that all holographic entropy inequalities are valid in such systems. In gapped systems with topological order, the “cyclic inequalities” derived recently for the holo-graphic entanglement entropy generalize the Kitaev-Preskill formula for the topological entanglement entropy. Finally, we propose a candidate linear inequality for general 4-party quantum states.

arXiv:1507.05650•Journal of High Energy Physics•Sep 1, 2015•15 citations

Holographic entropy inequalities and gapped phases of matter

Ning Bao

Here, we extend our studies of holographic entropy inequalities to gapped phases of matter. For any number of regions, we determine the linear entropy inequalities satisfied by systems in which the entanglement entropy satisfies an exact area law. In particular, we find that all holographic entropy inequalities are valid in such systems. In gapped systems with topological order, the “cyclic inequalities” derived recently for the holo-graphic entanglement entropy generalize the Kitaev-Preskill formula for the topological entanglement entropy. Finally, we propose a candidate linear inequality for general 4-party quantum states.

•May 24, 2022•12 citations

Holographic proof of the strong subadditivity of entanglement entropy

Matthew Headrick, Tadashi Takayanagi

When a quantum system is divided into subsystems, their entanglement entropies are subject to an inequality known as strong subadditivity. For a field theory this inequality can be stated as follows: given any two regions of space $A$ and $B$, $S(A)+S(B)\ensuremath{\ge}S(A\ensuremath{\cup}B)+S(A\ensuremath{\cap}B)$. Recently, a method has been found for computing entanglement entropies in any field theory for which there is a holographically dual gravity theory. We give a simple geometrical proof of strong subadditivity employing this holographic prescription.

arXiv:0704.3719•Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields•Nov 21, 2007•298 citations
We present a graphical method for proving holographic entanglement entropy inequalities (HEIs) in general multipartite systems. By introducing a geometric representation of the entanglement structure, we develop a systematic approach that enables one to visualize and verify the validity of HEIs for any number of subsystems nnn. Several theorems are established to formalize this method, and explicit examples are provided for systems with n=4n = 4n=4 to 777 entangled regions.
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.
A holographic entropy inequality (HEI) is a linear inequality obeyed by Ryu-Takayanagi holographic entanglement entropies, or equivalently by the minimum cut function on weighted graphs. We establish a new combinatorial framework for studying HEIs, and use it to prove several properties they share, including two majorization-related properties as well as a necessary and sufficient condition for an inequality to be an HEI. We thereby resolve all the conjectures presented in [arXiv:2508.21823], proving two of them and disproving the other two. In particular, we show that the null reduction of any superbalanced HEI passes the majorization test defined in [arXiv:2508.21823], thereby providing strong new evidence that all HEIs are obeyed in time-dependent holographic states.
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 extend our studies of holographic entropy inequalities to gapped phases of matter. For any number of regions, we determine the linear entropy inequalities satisfied by systems in which the entanglement entropy satisfies an exact area law. In particular, we find that all holographic entropy inequalities are valid in such systems. In gapped systems with topological order, the “cyclic inequalities” derived recently for the holo-graphic entanglement entropy generalize the Kitaev-Preskill formula for the topological entanglement entropy. Finally, we propose a candidate linear inequality for general 4-party quantum states.
Here, we extend our studies of holographic entropy inequalities to gapped phases of matter. For any number of regions, we determine the linear entropy inequalities satisfied by systems in which the entanglement entropy satisfies an exact area law. In particular, we find that all holographic entropy inequalities are valid in such systems. In gapped systems with topological order, the “cyclic inequalities” derived recently for the holo-graphic entanglement entropy generalize the Kitaev-Preskill formula for the topological entanglement entropy. Finally, we propose a candidate linear inequality for general 4-party quantum states.
When a quantum system is divided into subsystems, their entanglement entropies are subject to an inequality known as strong subadditivity. For a field theory this inequality can be stated as follows: given any two regions of space AAA and BBB, $S(A)+S(B)\ensuremath{\ge}S(A\ensuremath{\cup}B)+S(A\ensuremath{\cap}B)$. Recently, a method has been found for computing entanglement entropies in any field theory for which there is a holographically dual gravity theory. We give a simple geometrical proof of strong subadditivity employing this holographic prescription.