Related papers: Towards a complete classification of holographic e…
The contraction map proof method is the commonly used method to prove holographic entropy inequalities. Existence of a contraction map corresponding to a holographic entropy inequality is a sufficient condition for its validity. But is it…
We present a deterministic way of finding contraction maps for candidate holographic entanglement entropy inequalities modulo choices due to actual degeneracy. We characterize its complexity and give an argument for the completeness of the…
The celebrated holographic entanglement entropy triggered investigations on the connections between quantum information theory and quantum gravity. An important achievement is that we have gained more insights into the quantum states. It…
We study holographic entropy inequalities and their structural properties by making use of a judicious grouping of terms into certain multipartite information quantities. This allows us to recast cumbersome entropic expressions into much…
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…
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…
We initiate a systematic enumeration and classification of entropy inequalities satisfied by the Ryu-Takayanagi formula for conformal field theory states with smooth holographic dual geometries. For 2, 3, and 4 regions, we prove that the…
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…
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…
We interpret holographic entropy inequalities in terms of erasure correction. The non-saturation of an inequality is a necessary condition for certain schemes of holographic erasure correction, manifested in the bulk as non-empty overlaps…
In holographic duality, if a boundary state has a geometric description that realizes the Ryu-Takayanagi proposal then its entanglement entropies must obey certain inequalities that together define the so-called holographic entropy cone. A…
Quantities computed by minimal cuts, such as entanglement entropies achievable by the Ryu-Takayanagi proposal in the AdS/CFT correspondence, are constrained by linear inequalities. We prove a previously conjectured property of all such…
We calculated the entropy of a class of inhomogeneous dust universes. Allowing spherical symmetry, we proposed a holographic principle by reflecting all physical freedoms on the surface of the apparent horizon. In contrast to flat…
The holographic representation of the entanglement entropy of four dimensional conformal field theories is studied. By generalizing the replica trick the anomalous terms in the entanglement entropy are evaluated. The same terms in the…
Significant work has gone into determining the minimal set of entropy inequalities that determine the holographic entropy cone. Holographic systems with three or more parties have been shown to obey additional inequalities that generic…
We present an efficient algorithm for the construction of a holographic simple tree graph model that realizes a given entropy vector, subject to a specific ``chordality'' condition first introduced in arXiv:2412.18018. We further develop…
In this paper we show that in addition to the known minimal surfaces which appear in the literature for computing the entanglement entropy there are other minimal surfaces with non-zero extrinsic curvature. We use the approach of…
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques…
We study the possibility that black hole entropy be identified as entropy of entanglement across the horizon of the vacuum of a quantum field in the presence of the black hole. We argue that a recent proposal for computing entanglement…
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 arXiv:1808.07871, of using holography…