Hypergraph min-cuts from quantum entropies


Abstract in English

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.

Download