Bit threads and holographic entanglement

DOI10.1007/S00220-016-2796-3zbMATH Open1425.81014arXiv1604.00354OpenAlexW3103815360WikidataQ124934932 ScholiaQ124934932MaRDI QIDQ522010

Author name not available (Why is that?)

Publication date: 12 April 2017

Published in: (Search for Journal in Brave)

Abstract: The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, we invoke the notion of a "flow", defined as a divergenceless norm-bounded vector field, or equivalently a set of Planck-thickness "bit threads". The entanglement entropy of a boundary region is given by the maximum flux out of it of any flow, or equivalently the maximum number of bit threads that can emanate from it. The threads thus represent entanglement between points on the boundary, and naturally implement the holographic principle. As we explain, this new picture clarifies several conceptual puzzles surrounding the RT formula. We give flow-based proofs of strong subadditivity and related properties; unlike the ones based on minimal surfaces, these proofs correspond in a transparent manner to the properties' information-theoretic meanings. We also briefly discuss certain technical advantages that the flows offer over minimal surfaces. In a mathematical appendix, we review the max flow-min cut theorem on networks and on Riemannian manifolds, and prove in the network case that the set of max flows varies Lipshitz continuously in the network parameters.

Full work available at URL: https://arxiv.org/abs/1604.00354

Mathematics Subject Classification ID

No records found.

This page was built for publication: Bit threads and holographic entanglement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522010)