Bit threads on hypergraphs

Abstract

Recent work has characterized the various inequalities that entanglement entropies represented by min-cuts on hypergraphs will satisfy. This collection, the hypergraph entropy cone, can be seen as a generalization of the holographic entropy cone which describes the entropies given by both min-cuts on 2-graphs and those of holographic states in AdS/CFT. In this article we describe a generalization of bit threads which allows us to describe max multiflows on hypergraphs. We further comment on its properties and interpretation in holography.

22 pages, 11 figures

References in corpus (12)

• Holographic Entanglement of Purification
• Holographic Mutual Information is Monogamous
• A holographic proof of the strong subadditivity of entanglement entropy
• The Holographic Entropy Cone
• Conditional and Multipartite Entanglements of Purification and Holography
• Riemannian and Lorentzian flow-cut theorems
• The Holographic Entropy Cone for Five Regions
• Holographic entropy relations
• Crossing versus locking: Bit threads and continuum multiflows
• The Quantum Entropy Cone of Stabiliser States
• A Gap Between the Hypergraph and Stabilizer Entropy Cones
• A brief introduction to multipartite entanglement

Cited by in corpus (5)

• The PEE aspects of entanglement islands from bit threads
• Bit thread, entanglement distillation, and entanglement of purification
• Quantum bit threads and holographic entanglement
• Hypergraph States in SU(N)1, N odd prime, Chern-Simons Theory
• Hyperthreads in holographic spacetimes