Monogamy of Mutual Information in Graph States
Understand this faster with AI
Quantum Physics arXiv:2511.19585 (quant-ph) [Submitted on 24 Nov 2025] Title:Monogamy of Mutual Information in Graph States Authors:Jesus Fuentes, Cynthia Keeler, William Munizzi, Jason Pollack View a PDF of the paper titled Monogamy of Mutual Information in Graph States, by Jesus Fuentes and 3 other authors View PDF Abstract:The monogamy of mutual information (MMI) is a quantum entropy inequality that enforces the non-positivity of tripartite information. We investigate the failure of MMI in graph states as a forbidden-subgraph phenomenon, conjecturing that every MMI-violating graph state is local-Clifford equivalent to one whose graph contains a four-star subgraph. We construct a family of star-like graphs whose states fail a specific class of MMI instances, and extend this analysis to general star topologies. Deriving adjacency matrix constraints that fix the MMI evaluation for these instances and interpreting them physically, we prove the forbidden-subgraph conjecture for this family of graphs. Finally, through an exhaustive search over graph representatives for all $8$-qubit stabilizer entropy vectors, we establish that MMI failure is not reducible to the cases within our scope. Comments: Subjects: Quantum Physics (quant-ph); High Energy Physics - Theory (hep-th) Cite as: arXiv:2511.19585 [quant-ph] (or arXiv:2511.19585v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2511.19585 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: William Munizzi [view email] [v1] Mon, 24 Nov 2025 19:00:00 UTC (149 KB) Full-text links: Access Paper: View a PDF of the paper titled Monogamy of Mutual Information in Graph States, by Jesus Fuentes and 3 other authorsView PDFTeX Source view license Current browse context: quant-ph new | recent | 2025-11 Change to browse by: hep-th References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
