Quantum
Entanglement Geometry Beyond Polygons: Graph-Theoretic Entanglement Inequalities
Publication: quant-ph updates on arXiv.org
Author: Masoud Gharahi
Source published: 20/11/2026, 05:00:00 UTC
Briefing created: 20/11/2026, 05:31:39 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 20/11/2026, 05:13:24 UTC.
Briefings
A 2026 arXiv preprint establishes that entanglement entropy constraints for multipartite states can be modeled as graph-theoretic inequalities using hyperedges. The study derives optimal coefficients for polygon inequalities on bipartite cuts and determines the exact minimum of weighted sums at fixed entropies, showing uniform incidence parity is sufficient but not necessary for hypergraph inequalities. It also characterizes pure chain equality states and bounds trace distance to cycle equality states independently of system size.
Key points
- The study derives optimal coefficients for polygon inequalities on bipartite cuts, determining the smallest total weight of cuts separating a distinguished pair from a remaining party.
- A refinement involving three mutual information terms gives the exact minimum of the weighted sum at fixed entropies, attained by at most three independent bipartite pure states.
Context
This research extends the one-party entanglement polygon inequality to multipartite systems by organizing subsystem cuts as hyperedges of graphs. The findings clarify the conditions under which entanglement constraints hold and provide exact criteria for equality states.
Limitations
The evidence is an arXiv preprint (arXiv:2611.25019v1) from November 2026, meaning the results are preliminary and subject to peer review. The study focuses on pure states and specific graph-theoretic models, and the characterization of equality states is limited to specific cases like pure chain states and cycle states.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 20/11/2026, 05:31:39 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeigm4vefwl3w3y24mljxf5vbmf4wxqvduxgjqw3edhq4i5ejv6yori