Abstract: The min-cut function of weighted hypergraphs and the von Neumann entropy of pure quantum states are both symmetric submodular functions. In this note, we explain this coincidence by proving that the min-cut function of any weighted hypergraph can be approximated (up to an overall rescaling) by the entropies of quantum states known as stabilizer states. This implies that the min-cuts of hypergraphs are constrained by quantum entropy inequalities, and it shows that the recently defined hypergraph cones are contained in the quantum stabilizer entropy cones, as has been conjectured in the recent literature.
Recommendations
Cites work
- A new inequality for the von Neumann entropy
- Evenly distributed unitaries: On the structure of unitary designs
- Handlebody phases and the polyhedrality of the holographic entropy cone
- Holographic derivation of entanglement entropy from the anti-de Sitter space/conformal field theory correspondence
- Holographic duality from random tensor networks
- Holographic entropy cone with time dependence in two dimensions
- Holographic entropy inequalities and gapped phases of matter
- Quantum state merging and negative information
- Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations
- Stabilizer information inequalities from phase space distributions
- The Holographic Entropy Arrangement
- The holographic entropy cone
- The inequalities of quantum information theory
- The large-\(N\) limit of superconformal field theories and supergravity
- The Quantum Entropy Cone of Stabiliser States
Cited in
(17)- Quantum extremal surfaces and the holographic entropy cone
- Improved proof-by-contraction method and relative homologous entropy inequalities
- The holographic entropy cone from marginal independence
- On the foundations and extremal structure of the holographic entropy cone
- Quantum max-flow/min-cut
- Matrix product states and the quantum max-flow/min-cut conjectures
- The asymptotics of quantum max-flow min-cut
- On the relation between the subadditivity cone and the quantum entropy cone
- Discrete bulk reconstruction
- Random tensor networks with non-trivial links
- Properties of the contraction map for holographic entanglement entropy inequalities
- Correlation hypergraph: a new representation of a quantum marginal independence pattern
- Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the N = 6 solution
- Testing holographic entropy inequalities in 2 + 1 dimensions
- Reflected entropy in random tensor networks. III: Triway cuts
- A new characterization of the holographic entropy cone
- Beyond the holographic entropy cone via cycle flows
This page was built for publication: Hypergraph min-cuts from quantum entropies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154266)
