Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Bit Threads and Holographic Monogamy

Shawn X. Cui, Patrick Hayden, Temple He, Matthew Headrick, Bogdan Stoica, Michael Walter

TL;DR

The paper develops a continuum multicommodity flow formalism (bit threads) to prove monogamy of mutual information in holography via convex duality, providing a unified continuum proof that complements known minimal-surface proofs. It shows that a max multiflow exists, saturating region-entropies simultaneously, and translates this into a thread-based picture that yields MMI and nested-flow results, with a robust discrete-network analog. Building on this, the authors propose a state-decomposition conjecture for four-region holography, combining bipartite entanglement and a four-party perfect tensor to account for $-I_3>0$, consistent with the holographic entropy cone. They also discuss extensions to networks, giving additional proofs and suggesting bulk-decomposition interpretations, while outlining future directions for higher-party inequalities and covariant generalizations. Overall, the work provides a mathematically rigorous, convex-optimization–based framework for understanding holographic entanglement structure through bit threads and multiflows, linking geometry, entanglement, and tensor-network ideas.

Abstract

Bit threads provide an alternative description of holographic entanglement, replacing the Ryu-Takayanagi minimal surface with bulk curves connecting pairs of boundary points. We use bit threads to prove the monogamy of mutual information (MMI) property of holographic entanglement entropies. This is accomplished using the concept of a so-called multicommodity flow, adapted from the network setting, and tools from the theory of convex optimization. Based on the bit thread picture, we conjecture a general ansatz for a holographic state, involving only bipartite and perfect-tensor type entanglement, for any decomposition of the boundary into four regions. We also give new proofs of analogous theorems on networks.

Bit Threads and Holographic Monogamy

TL;DR

The paper develops a continuum multicommodity flow formalism (bit threads) to prove monogamy of mutual information in holography via convex duality, providing a unified continuum proof that complements known minimal-surface proofs. It shows that a max multiflow exists, saturating region-entropies simultaneously, and translates this into a thread-based picture that yields MMI and nested-flow results, with a robust discrete-network analog. Building on this, the authors propose a state-decomposition conjecture for four-region holography, combining bipartite entanglement and a four-party perfect tensor to account for , consistent with the holographic entropy cone. They also discuss extensions to networks, giving additional proofs and suggesting bulk-decomposition interpretations, while outlining future directions for higher-party inequalities and covariant generalizations. Overall, the work provides a mathematically rigorous, convex-optimization–based framework for understanding holographic entanglement structure through bit threads and multiflows, linking geometry, entanglement, and tensor-network ideas.

Abstract

Bit threads provide an alternative description of holographic entanglement, replacing the Ryu-Takayanagi minimal surface with bulk curves connecting pairs of boundary points. We use bit threads to prove the monogamy of mutual information (MMI) property of holographic entanglement entropies. This is accomplished using the concept of a so-called multicommodity flow, adapted from the network setting, and tools from the theory of convex optimization. Based on the bit thread picture, we conjecture a general ansatz for a holographic state, involving only bipartite and perfect-tensor type entanglement, for any decomposition of the boundary into four regions. We also give new proofs of analogous theorems on networks.

Paper Structure

This paper contains 27 sections, 9 theorems, 137 equations, 5 figures.

Table of Contents

  1. Introduction
  2. Background
  3. Ryu-Takayanagi formula and bit threads
  4. Flows
  5. Bit threads
  6. Properties and derived quantities
  7. MMI, perfect tensors, and entropy cones
  8. MMI
  9. Entropy cones
  10. Multiflows and MMI
  11. Multiflows
  12. Threads
  13. Theorem \ref{['thm17']}
  14. Three boundary regions
  15. Four boundary regions
  16. ...and 12 more sections

Key Result

Theorem 1

There exists a multiflow $\{v_{ij}\}$ such that for each $i$, the sum is a max flow for $A_i$, that is,

Figures (5)

  • Figure 1: Left: Skeleton graph (with two connected components) representing an arbitrary entropy vector in the four-party holographic entropy cone. Right: Skeleton graph for a three-party entropy vector.
  • Figure 2: Left: Star graph with capacity 1 on each edge. The entropies derived from this graph are those of a perfect tensor, \ref{['PT_cond']}, with $S_0=1$. In particular, all the pairwise mutual informations vanish and $-I_3=2$. Right: The three max thread configurations on this graph.
  • Figure 3: (Left) A flow configuration of $\tilde{v}$ in Lemma \ref{['lem:trick']}; (Middle) A configuration near $s(e)$ when $e$ is a type $(1,1)$ edge; (Right) A local picture at $t(e')$ when there are no outgoing edges with type $(0,0)$.
  • Figure 4: A flow configuration resulting from the application of Lemma \ref{['lem:trick']}. Here $\tilde{v} = v + v_1 + v_2$, $\tilde{v}_B = v_1$, $\tilde{v}_A = v + v_2$.
  • Figure 5: A network with $-I_3 < 0$. $S(A) = S(B) = S(AB) = 1$ and all other maximal fluxes are zero.

Theorems & Definitions (28)

  • Definition 1: Multiflow
  • Theorem 1: Max multiflow
  • Definition 1: Multiflow
  • Theorem 1: Max multiflow
  • proof : Proof of Theorem \ref{['thm172']}
  • Theorem 2: Nested max multiflow
  • proof : Proof of Theorem \ref{['nmmf']}
  • Definition 2: Discrete flows
  • Definition 3
  • Definition 4: Multiflow, discrete version
  • ...and 18 more