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
61 pages, 13 figures, 18 tables, 1 computational package, 1 data set
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.
Public mathematical preprint by Yongxian Zhang. We prove Fuentes–Keeler–Munizzi–Pollack, arXiv:2511.19585v1, Conjecture 1: for every finite qubit graph state, positive tripartite information implies that a locally equivalent graph contains an induced four-vertex claw. The proof gives the complete claw-vertex-minor-free component classification by K1, K2, P3, P4, C5 and the six-vertex W5, and the sharp connected threshold seven. The unbounded step is a connected-graph induction; the finite step checks all 120 nonempty one-vertex extensions with independent exact checkers. The certificate package verifies all 120 extensions, 1,511 orbit transitions and 5,460 labeled four-block assignments. These finite checks supplement the written entropy and induction proof; the theorem is not claimed as a complete Lean formalization. No external human peer review or historical-priority claim is made. Research and manuscript preparation used AI assistance; no external funding. Original material is reserved unless a file states another license. DOI registration does not certify correctness, novelty, or priority.
The conditional quantum mutual information I(A; B|C) of a tripartite state ρABC is an information quantity which lies at the center of many problems in quantum information theory. Three of its main properties are that it is non-negative for any tripartite state, that it decreases under local operations applied to systems A and B, and that it obeys the duality relation I(A; B|C) = I(A; B|D) for a four-party pure state on systems ABCD. The conditional mutual information also underlies the squashed entanglement, an entanglement measure that satisfies all of the axioms desired for an entanglement measure. As such, it has been an open question to find Rényi generalizations of the conditional mutual information, that would allow for a deeper understanding of the original quantity and find applications beyond the traditional memoryless setting of quantum information theory. The present paper addresses this question, by defining different α-Rényi generalizations Iα(A; B|C) of the conditional mutual information, some of which we can prove converge to the conditional mutual information in the limit α → 1. Furthermore, we prove that many of these generalizations satisfy non-negativity, duality, and monotonicity with respect to local operations on one of the systems A or B (with it being left as an open question to prove that monotonicity holds with respect to local operations on both systems). The quantities defined here should find applications in quantum information theory and perhaps even in other areas of physics, but we leave this for future work. We also state a conjecture regarding the monotonicity of the Rényi conditional mutual informations defined here with respect to the Rényi parameter α. We prove that this conjecture is true in some special cases and when α is in a neighborhood of one.
We investigate multipartite information and entanglement measures in the ground state of a free-fermion model defined on a Hamming graph. Using the known diagonalization of the adjacency matrix, we solve the model and construct the ground-state correlation matrix. Moreover, we find all the eigenvalues of the chopped correlation matrix when the subsystem consists of n disjoint Hamming subgraphs embedded in a larger one. These results allow us to find an exact formula for the entanglement entropy of disjoint graphs, as well as for the mutual and tripartite information. We use the exact formulas for these measures to extract their asymptotic behavior in two distinct thermodynamic limits, and find excellent match with the numerical calculations. In particular, we find that the entanglement entropy admits a logarithmic violation of the area law which decreases the amount of entanglement compared to the area law scaling.
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled resources. It is thus crucial to understand when two such states have the same entanglement, i.e. when they can be transformed into each other using only local operations. In this case, we say that the graph states are LU-equivalent (local unitary). If the local operations are restricted to the so-called Clifford group, we say that the graph states are LC-equivalent (local Clifford). Interestingly, a simple graph rule called local complementation fully captures LC-equivalence, in the sense that two graph states are LC-equivalent if and only if the underlying graphs are related by a sequence of local complementations. While it was once conjectured that two LU-equivalent graph states are always LC-equivalent, counterexamples do exist and local complementation fails to fully capture the entanglement of graph states. We introduce in this thesis a generalization of local complementation that does fully capture LU-equivalence. Using this characterization, we prove the existence of an infinite strict hierarchy of local equivalences between LC- and LU-equivalence. This also leads to the design of a quasi-polynomial algorithm for deciding whether two graph states are LU-equivalent, and to a proof that two LU-equivalent graph states are LC-equivalent if they are defined on at most 19 qubits. Furthermore, we study graph states that are universal in the sense that any smaller graph state, defined on any small enough set of qubits, can be induced using only local operations. We provide bounds and an optimal, probabilistic construction.
Abstract Entropy is a fundamental concept in quantum information theory that allows to quantify entanglement and investigate its properties, for example its monogamy over multipartite systems. Here, we derive variational formulas for relative entropies based on restricted measurements of multipartite quantum systems. By combining these with multivariate matrix trace inequalities, we recover and sometimes strengthen various existing entanglement monogamy inequalities. In particular, we give direct, matrix-analysis-based proofs for the faithfulness of squashed entanglement by relating it to the relative entropy of entanglement measured with one-way local operations and classical communication, as well as for the faithfulness of conditional entanglement of mutual information by relating it to the separably measured relative entropy of entanglement. We discuss variations of these results using the relative entropy to states with positive partial transpose, and multipartite setups. Our results simplify and generalize previous derivations in the literature that employed operational arguments about the asymptotic achievability of information-theoretic tasks.
We investigate the dynamics of information among the parties of tripartite systems. We start by proving two results concerning the monogamy of mutual information. The first one states that mutual information is monogamous for generic tripartite pure states. The second shows that, in general, mutual information is monogamous only if the amount of genuine tripartite correlations is large enough. Then, we analyze the internal dynamics of tripartite systems whose parties do not exchange energy. In particular, we allow for one of the subsystems to play the role of a finite thermal bath. As a result, we find a typical scenario in which local information tends to be converted into delocalized information. Moreover, we show that (i) the information flow is reversible for finite thermal baths at low temperatures, (ii) monogamy of mutual information is respected throughout the dynamics, and (iii) genuine tripartite correlations are typically present. Finally, we analytically calculate a quantity capable of revealing favorable regimes for non-Markovianity in our model.