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:1812.08133 · Fortschritte der Physik

The Holographic Entropy Arrangement

Veronika E. Hubeny, Mukund Rangamani, Massimiliano Rota

Published Feb 27, 2019• 51 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1002/prop.201900011

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

Holographic Entropy Relations

Veronika E. Hubeny, Mukund Rangamani, Massimiliano Rota

Abstract We develop a framework for the derivation of new information theoretic quantities which are natural from a holographic perspective. We demonstrate the utility of our techniques by deriving the tripartite information (the quantity associated to monogamy of mutual information) using a set of abstract arguments involving bulk extremal surfaces. Our arguments rely on formal manipulations of surfaces and not on local surgery or explicit computation of entropies through the holographic entanglement entropy prescriptions. As an application, we show how to derive a family of similar information quantities for an arbitrary number of parties. The present work establishes the foundation of a broader program that aims at the understanding of the entanglement structures of geometric states for an arbitrary number of parties. We stress that our method is completely democratic with respect to bulk geometries and is equally valid in static and dynamical situations. While rooted in holography, we expect that our construction will provide a useful characterization of multipartite correlations in quantum field theories.

arXiv:1808.07871•Fortschritte der Physik•Sep 25, 2018•63 citations

The holographic entropy cone from marginal independence

Sergio Hernández-Cuenca, Veronika E. Hubeny, Massimiliano Rota

Abstract The holographic entropy cone characterizes the relations between entanglement entropies for a spatial partitioning of the boundary spacetime of a holographic CFT in any state describing a classical bulk geometry. We argue that the holographic entropy cone, for an arbitrary number of parties, can be reconstructed from more fundamental data determined solely by subadditivity of quantum entropy. We formulate certain conjectures about graph models of holographic entanglement, for which we provide strong evidence, and rigorously prove that they all imply that such a reconstruction is possible. Our conjectures (except only for the weakest) further imply that the necessary data is remarkably simple. In essence, all one needs to know to reconstruct the holographic entropy cone, is a certain subset of the extreme rays of this simpler “subadditivity cone”, namely those which can be realized in holography. This recasting of the bewildering entanglement structure of geometric states into primal building blocks paves the way to distilling the essence of holography for the emergence of a classical bulk spacetime.

arXiv:2204.00075•Journal of High Energy Physics•Sep 22, 2022•20 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•34 citations

Tripartite Form Universality in Holographic Entropy Inequalities

Veronika E. Hubeny, Yu Liu

To elucidate the meaning of holographic entropy inequalities (beyond subadditivity) which characterize the entanglement structure of geometric states in holography, arXiv:2309.06296 proposed the "tripartite form" for these inequalities, consisting of tripartite information and conditional tripartite information terms with unit coefficients. While this provides a compact and useful packaging of the inequalities, it is not a priori guaranteed that all inequalities can be recast in this form. Here we conjecture that they can, and present substantial evidence, by proving that the two known infinite families of holographic entropy inequalities found in arXiv:2309.15145 can indeed be written in the tripartite form. This is significant because such recasting is particularly nontrivial for these families. Apart from providing the explicit tripartite form expressions for every member of these two infinite families, we detail how we arrived at them, in the process deriving several useful identities which may serve as stepping stones to formulate further repackaging of the corresponding information quantities. We also illustrate the power of the tripartite form by proving a number of structural properties satisfied by any holographic entropy inequality.

hep-thCross-listedarXiv:2609.22504•Sep 22, 2026

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•31 citations
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 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.
Abstract We develop a framework for the derivation of new information theoretic quantities which are natural from a holographic perspective. We demonstrate the utility of our techniques by deriving the tripartite information (the quantity associated to monogamy of mutual information) using a set of abstract arguments involving bulk extremal surfaces. Our arguments rely on formal manipulations of surfaces and not on local surgery or explicit computation of entropies through the holographic entanglement entropy prescriptions. As an application, we show how to derive a family of similar information quantities for an arbitrary number of parties. The present work establishes the foundation of a broader program that aims at the understanding of the entanglement structures of geometric states for an arbitrary number of parties. We stress that our method is completely democratic with respect to bulk geometries and is equally valid in static and dynamical situations. While rooted in holography, we expect that our construction will provide a useful characterization of multipartite correlations in quantum field theories.
Abstract The holographic entropy cone characterizes the relations between entanglement entropies for a spatial partitioning of the boundary spacetime of a holographic CFT in any state describing a classical bulk geometry. We argue that the holographic entropy cone, for an arbitrary number of parties, can be reconstructed from more fundamental data determined solely by subadditivity of quantum entropy. We formulate certain conjectures about graph models of holographic entanglement, for which we provide strong evidence, and rigorously prove that they all imply that such a reconstruction is possible. Our conjectures (except only for the weakest) further imply that the necessary data is remarkably simple. In essence, all one needs to know to reconstruct the holographic entropy cone, is a certain subset of the extreme rays of this simpler “subadditivity cone”, namely those which can be realized in holography. This recasting of the bewildering entanglement structure of geometric states into primal building blocks paves the way to distilling the essence of holography for the emergence of a classical bulk spacetime.
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.
To elucidate the meaning of holographic entropy inequalities (beyond subadditivity) which characterize the entanglement structure of geometric states in holography, arXiv:2309.06296 proposed the "tripartite form" for these inequalities, consisting of tripartite information and conditional tripartite information terms with unit coefficients. While this provides a compact and useful packaging of the inequalities, it is not a priori guaranteed that all inequalities can be recast in this form. Here we conjecture that they can, and present substantial evidence, by proving that the two known infinite families of holographic entropy inequalities found in arXiv:2309.15145 can indeed be written in the tripartite form. This is significant because such recasting is particularly nontrivial for these families. Apart from providing the explicit tripartite form expressions for every member of these two infinite families, we detail how we arrived at them, in the process deriving several useful identities which may serve as stepping stones to formulate further repackaging of the corresponding information quantities. We also illustrate the power of the tripartite form by proving a number of structural properties satisfied by any holographic entropy inequality.
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.