skip to main content


Title: Quantum Extremal Surfaces and the Holographic Entropy Cone
A bstract Quantum states with geometric duals are known to satisfy a stricter set of entropy inequalities than those obeyed by general quantum systems. The set of allowed entropies derived using the Ryu-Takayanagi (RT) formula defines the Holographic Entropy Cone (HEC). These inequalities are no longer satisfied once general quantum corrections are included by employing the Quantum Extremal Surface (QES) prescription. Nevertheless, the structure of the QES formula allows for a controlled study of how quantum contributions from bulk entropies interplay with HEC inequalities. In this paper, we initiate an exploration of this problem by relating bulk entropy constraints to boundary entropy inequalities. In particular, we show that requiring the bulk entropies to satisfy the HEC implies that the boundary entropies also satisfy the HEC. Further, we also show that requiring the bulk entropies to obey monogamy of mutual information (MMI) implies the boundary entropies also obey MMI.  more » « less
Award ID(s):
2107939
NSF-PAR ID:
10322677
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Journal of High Energy Physics
Volume:
2021
Issue:
11
ISSN:
1029-8479
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. A<sc>bstract</sc>

    We construct a Type IIvon Neumann algebra that describes the largeNphysics of single-trace operators in AdS/CFT in the microcanonical ensemble, where there is no need to include perturbative 1/Ncorrections. Using only the extrapolate dictionary, we show that the entropy of semiclassical states on this algebra is holographically dual to the generalized entropy of the black hole bifurcation surface. From a boundary perspective, this constitutes a derivation of a special case of the QES prescription without any use of Euclidean gravity or replicas; from a purely bulk perspective, it is a derivation of the quantum-corrected Bekenstein-Hawking formula as the entropy of an explicit algebra in theG →0 limit of Lorentzian effective field theory quantum gravity. In a limit where a black hole is first allowed to equilibrate and then is later potentially re-excited, we show that the generalized second law is a direct consequence of the monotonicity of the entropy of algebras under trace-preserving inclusions. Finally, by considering excitations that are separated by more than a scrambling time we construct a “free product” von Neumann algebra that describes the semiclassical physics of long wormholes supported by shocks. We compute Rényi entropies for this algebra and show that they are equal to a sum over saddles associated to quantum extremal surfaces in the wormhole. Surprisingly, however, the saddles associated to “bulge” quantum extremal surfaces contribute with a negative sign.

     
    more » « less
  2. A bstract We introduce a unifying framework for the construction of holographic tensor networks, based on the theory of hyperbolic buildings. The underlying dualities relate a bulk space to a boundary which can be homeomorphic to a sphere, but also to more general spaces like a Menger sponge type fractal. In this general setting, we give a precise construction of a large family of bulk regions that satisfy complementary recovery. For these regions, our networks obey a Ryu-Takayanagi formula. The areas of Ryu-Takayanagi surfaces are controlled by the Hausdorff dimension of the boundary, and consistently generalize the behavior of holographic entanglement entropy in integer dimensions to the non-integer case. Our construction recovers HaPPY-like codes in all dimensions, and generalizes the geometry of Bruhat-Tits trees. It also provides examples of infinite-dimensional nets of holographic conditional expectations, and opens a path towards the study of conformal field theory and holography on fractal spaces. 
    more » « less
  3. null (Ed.)
    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. 
    more » « less
  4. A bstract According to the AdS/CFT correspondence , the geometries of certain spacetimes are fully determined by quantum states that live on their boundaries — indeed, by the von Neumann entropies of portions of those boundary states. This work investigates to what extent the geometries can be reconstructed from the entropies in polynomial time . Bouland, Fefferman, and Vazirani (2019) argued that the AdS/CFT map can be exponentially complex if one wants to reconstruct regions such as the interiors of black holes. Our main result provides a sort of converse: we show that, in the special case of a single 1D boundary divided into N “atomic regions”, if the input data consists of a list of entropies of contiguous boundary regions, and if the entropies satisfy a single inequality called Strong Subadditivity, then we can construct a graph model for the bulk in linear time. Moreover, the bulk graph is planar, it has O ( N 2 ) vertices (the information-theoretic minimum), and it’s “universal”, with only the edge weights depending on the specific entropies in question. From a combinatorial perspective, our problem boils down to an “inverse” of the famous min-cut problem: rather than being given a graph and asked to find a min-cut, here we’re given the values of min-cuts separating various sets of vertices, and need to find a weighted undirected graph consistent with those values. Our solution to this problem relies on the notion of a “bulkless” graph, which might be of independent interest for AdS/CFT. We also make initial progress on the case of multiple 1D boundaries — where the boundaries could be connected via wormholes — including an upper bound of O ( N 4 ) vertices whenever an embeddable bulk graph exists (thus putting the problem into the complexity class NP). 
    more » « less
  5. We address in this work the problem of minimizing quantum entropies under local constraints. We suppose that macroscopic quantities, such as the particle density, current, and kinetic energy, are fixed at each point of Rd and look for a density operator over L2(Rd), minimizing an entropy functional. Such minimizers are referred to as local Gibbs states. This setting is in contrast with the classical problem of prescribing global constraints, where the total number of particles, total current, and total energy in the system are fixed. The question arises, for instance, in the derivation of fluid models from quantum dynamics. We prove, under fairly general conditions, that the entropy admits a unique constrained minimizer. Due to a lack of compactness, the main difficulty in the proof is to show that limits of minimizing sequences satisfy the local energy constraint. We tackle this issue by introducing a simpler auxiliary minimization problem and by using a monotonicity argument involving the entropy.

     
    more » « less