Pith. sign in

REVIEW 1 cited by

Hypergraph min-cuts from quantum entropies

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.12397 v2 pith:ONFIQJSO submitted 2020-02-27 quant-ph hep-thmath-phmath.COmath.MP

classification quant-phhep-thmath-phmath.COmath.MP
keywords quantumentropyhypergraphstatesconesentropiesfunctionhypergraphs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the ${\sf N}=6$ solution

    quant-ph 2024-12 conditional novelty 8.0 of 10

    Complete classification of SSA-compatible extreme rays of the six-party subadditivity cone, with 150 holographic graph realizations and 52 confirmed non-holographic orbits.

Pith tools