pith. sign in

arxiv: 2605.19453 · v1 · pith:CFAETEHInew · submitted 2026-05-19 · 🪐 quant-ph · math-ph· math.MP· math.PR

The Marginal Problem for Density Operators

Steffen Lauritzen , Piotr Zwiernik This is my paper

Pith reviewed 2026-05-20 05:58 UTC · model grok-4.3

classification 🪐 quant-ph math-phmath.MPmath.PR
keywords quantum marginal problemdensity operatorsMarkov structurechordal graphsquantum conditional independencemaximum entropytrace condition
5
0 comments X

The pith

A trace condition on the noncommutative junction-tree formula determines whether quantum marginals can be completed to a global Markov state.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Quantum marginals are the local reduced density operators obtained by tracing out parts of a larger system. The paper examines when these can be glued back into a global density operator that satisfies a given Markov property on a graph. It begins with a canonical logarithmic construction T(R) that mirrors the classical junction-tree formula but must be adjusted for noncommutativity. The key finding is that this construction produces a valid normalized global state with the correct marginals if and only if its trace equals one. This condition is also equivalent to the existence of a quantum Markov completion, which is then unique and given by the maximum-entropy principle.

Core claim

The obstruction to the existence of a quantum Markov completion for given marginal density operators is exactly whether the trace of the canonical logarithmic construction T(R) equals one. When Tr(T(R))=1, the completion exists, is unique, equals T(R), and is the maximum-entropy state consistent with the marginals and the Markov structure. This equivalence holds for two overlapping marginals and for clique marginals on a chordal graph. In the two-clique case it is also equivalent to the agreement of the two one-sided sandwich reconstructions.

What carries the argument

The canonical logarithmic construction T(R), the noncommutative analogue of the classical junction-tree formula for building a joint distribution from marginals on a decomposable graph.

If this is right

  • The condition Tr(T(R))=1 is equivalent to the existence of a quantum Markov completion for two overlapping marginals and for chordal graphs.
  • When the condition holds, the completion is unique, equals T(R), and maximizes entropy among states with those marginals.
  • In the two-clique case, the two natural one-sided sandwich reconstructions agree if and only if the trace condition holds.
  • The global quantum information associated with a chordal graph is the relative-entropy discrepancy to the logarithmic candidate, corrected for trace.
  • An intersection property holds for strictly positive quantum conditional independence.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This provides a simple scalar test for compatibility in quantum Markov networks, potentially more efficient than general optimization methods.
  • The framework might be used to quantify how close a set of marginals is to admitting a completion when the trace is near but not equal to one.
  • The examples with three-qubit Pauli states illustrate that quantum versions have additional obstructions beyond classical consistency.

Load-bearing premise

That the particular logarithmic construction T(R) is the right noncommutative stand-in for the classical combination rule, so that its trace deviation is the only possible barrier to a valid global state.

What would settle it

A specific collection of overlapping marginal density operators on a chordal graph where Tr(T(R)) equals 1 but no global quantum state with the prescribed Markov structure exists, or where the trace is not 1 yet such a state does exist.

read the original abstract

We study when local reduced density operators, viewed as quantum marginals, can be assembled into a global quantum state with a prescribed Markov structure. The starting point is a canonical logarithmic construction $T(\mathcal R)$, the noncommutative analogue of the junction-tree formula for decomposable graphical models. Unlike in the classical case, this formal construction may fail: noncommutativity can prevent it from being a normalized state with the prescribed marginals. We prove that this obstruction is captured exactly by a trace condition. For two overlapping marginals, and for clique marginals on a chordal graph, the condition $Tr(T(\mathcal R))=1$ is equivalent to the existence of a quantum Markov completion. When it exists, the completion is unique, equal to $T(\mathcal R)$, and selected by the maximum-entropy principle. In the two-clique case, we also give an equivalent conditional-reconstruction characterization: the two natural one-sided sandwich reconstructions agree if and only if the trace condition holds. We introduce the global quantum information $gI(\mathcal{G})_\rho$ associated with a chordal graph $\mathcal G$ and show that it is a relative-entropy discrepancy from $\rho$ to the logarithmic candidate, with a trace correction when the candidate is not normalized. We also prove an intersection property for strictly positive quantum conditional independence. Three-qubit Pauli examples show that the quantum obstructions are real: local consistency, feasibility, Markov feasibility, and maximum entropy can all separate.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript studies the quantum marginal problem for density operators with a prescribed Markov structure. It introduces a canonical logarithmic construction T(R) as the noncommutative analogue of the classical junction-tree formula. The central result establishes that Tr(T(R))=1 if and only if a quantum Markov completion exists, for the cases of two overlapping marginals and for clique marginals on a chordal graph. When the condition holds, the completion is unique, equals T(R), and is the maximum-entropy state. Additional contributions include an equivalent conditional-reconstruction characterization in the two-clique case, the definition of global quantum information gI(G)_ρ as a relative-entropy discrepancy with trace correction, a proof of an intersection property for strictly positive quantum conditional independence, and three-qubit Pauli examples separating local consistency, feasibility, Markov feasibility, and maximum entropy.

Significance. If the equivalences hold, the work provides a precise, checkable criterion for the existence of quantum Markov completions from local marginals, extending classical decomposable graphical models to the quantum setting. The exact trace-condition equivalence, uniqueness result, and maximum-entropy selection are strong and useful. The paper supplies machine-checkable-style proofs for the two-clique and chordal cases together with explicit three-qubit examples that separate the relevant notions; these are genuine strengths. The introduction of gI(G)_ρ and the intersection property for quantum CI add foundational value to the study of quantum conditional independence.

minor comments (3)
  1. The definition of the canonical construction T(R) and the precise meaning of the 'logarithmic' operation should be stated explicitly in the first section rather than deferred to the abstract's outline.
  2. In the three-qubit Pauli examples, include the explicit 8x8 or 2x2 matrix representations of the marginals and the computed T(R) so that the separation between the four notions can be verified by direct calculation.
  3. A brief comparison paragraph relating the new global quantum information gI(G)_ρ to existing quantum mutual information or conditional mutual information measures would improve context.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our manuscript, for highlighting its significance, and for recommending minor revision. We are pleased that the trace-condition equivalence, uniqueness, and maximum-entropy results are viewed as strong contributions, along with the examples and the definitions of gI(G)_ρ and the intersection property.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper establishes mathematical equivalences and existence theorems: Tr(T(R))=1 is shown equivalent to existence of a quantum Markov completion for two overlapping marginals and chordal clique marginals, with uniqueness and max-entropy selection when the condition holds. T(R) is explicitly introduced as a defined canonical logarithmic construction (the noncommutative lift of the classical junction-tree formula), and the trace condition is derived as the normalization obstruction rather than presupposed. No steps reduce a claimed prediction or result to a fitted parameter from the same data, no load-bearing self-citations appear, and the three-qubit Pauli examples only separate distinct notions without circular reduction. The derivation is self-contained as a sequence of equivalences and proofs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The work rests on standard properties of density operators and trace, plus the modeling choice that the logarithmic construction is the appropriate quantum analogue; no free parameters are fitted and one new measure is introduced without independent falsifiable prediction.

axioms (2)
  • domain assumption Density operators are Hermitian, positive semidefinite, and trace-one.
    Invoked implicitly throughout as the definition of quantum states.
  • domain assumption The graph under consideration is chordal when claiming equivalence for clique marginals.
    Explicitly stated as the setting for the main equivalence result.
invented entities (1)
  • global quantum information gI(G)_ρ no independent evidence
    purpose: Quantifies relative-entropy discrepancy from a state ρ to the logarithmic candidate with trace correction.
    Newly defined in the paper; no external falsifiable prediction supplied in the abstract.

pith-pipeline@v0.9.0 · 5798 in / 1433 out tokens · 33043 ms · 2026-05-20T05:58:23.202273+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

22 extracted references · 22 canonical work pages

  1. [1]

    Chentsov, N. N. (1968). Nonsymmetrical distance between probability distributions, entropy and the theorem of P ythagoras. Mathematical Notes of the Academy of Sciences of the USSR\/ 4 , 686--691. Translated from Matematicheskie Zametki , Vol 4, pp. 323–332, 1968

    work page 1968

  2. [2]

    Chentsov, N. N. (1972). Statisticheskie Reshayushchie Pravila i Optimal nye Vyvody ( S tatistical Decision Rules and Optimal Conclusions) . Moscow: Nauka. In Russian

    work page 1972

  3. [3]

    Csisz\'ar, I. (1975). I -divergence geometry of probability distributions and minimization problems. Annals of Probability\/ 3 , 146--158

    work page 1975

  4. [4]

    Grone, R., C. R. Johnson, E. M. Sá, and H. Wolkowicz (1984). Positive definite completions of partial H ermitian matrices. Linear Algebra and its Applications\/ 58 , 109--124

    work page 1984

  5. [5]

    Jozsa, D

    Hayden, P., R. Jozsa, D. Petz, and A. Winter (2004). Structure of states which satisfy strong subadditivity of quantum entropy with equality. Communications in Mathematical Physics\/ 246\/ (2), 359--374

    work page 2004

  6. [6]

    Kellerer, H. G. (1964a). M a theoretische M arginalprobleme. Mathematische Annalen\/ 153 , 168--198

    work page

  7. [7]

    Kellerer, H. G. (1964b). Verteilungsfunktionen mit gegebenen M ar\-gi\-nal\-ver\-tei\-lung\-en. Zeitschrift f \"u r Wahrscheinlichkeitstheorie und verwandte Gebiete\/ 3 , 247--270

    work page

  8. [8]

    Kellerer, H. G. (1984). Duality theorems for marginal problems. Zeitschrift f \"u r Wahrscheinlichkeitstheorie und Verwandte Gebiete\/ 67\/ (4), 399--432

    work page 1984

  9. [9]

    Lauritzen, S. L. (2026). Graphical Models\/ (2nd ed.). Oxford, UK: Oxford University Press

    work page 2026

  10. [10]

    Leifer, M. and D. Poulin (2008). Quantum graphical models and belief propagation. Annals of Physics\/ 323\/ (8), 1899--1946

    work page 2008

  11. [11]

    Lieb, E. and M. B. Ruskai (1973). A fundamental property of quantum mechanical entropy. Physical Review Letters\/ 30 , 434--436

    work page 1973

  12. [12]

    Lindblad, G. (1975). Completely positive maps and entropy inequalities. Communications in Mathematical Physics\/ 40\/ (2), 147--151

    work page 1975

  13. [13]

    Nielsen, M. A. and I. L. Chuang (2000). Quantum Computation and Quantum Information . Cambridge, UK: Cambridge University Press

    work page 2000

  14. [14]

    Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems . San Mateo: Morgan Kaufmann Publishers

    work page 1988

  15. [15]

    Petz, D. (1986). Sufficient subalgebras and the relative entropy of states of a von N eumann algebra. Communications in Mathematical Physics\/ 105\/ (1), 123--131

    work page 1986

  16. [16]

    Petz, D. (2003). Monotonicity of quantum relative entropy revisited. Reviews in Mathematical Physics\/ 15\/ (01), 79--91

    work page 2003

  17. [17]

    Ruskai, M. B. (2002). Inequalities for quantum entropy: A review with conditions for equality. Journal of Mathematical Physics\/ 43 , 4358--4375

    work page 2002

  18. [18]

    Still, M

    Schneidman, E., S. Still, M. J. Berry, and W. Bialek (2003). Network information and connected correlations. Physical Review Letters\/ 91\/ (23), 238701

    work page 2003

  19. [19]

    Studen \'y , M. (2005). Probabilistic Conditional Independence Structures . Information Science and Statistics. London: Springer Verlag

    work page 2005

  20. [20]

    Watanabe, S. (1960). Information theoretical analysis of multivariate correlation. IBM Journal of Research and Development\/ 4\/ (1), 66--82

    work page 1960

  21. [21]

    Zhang, L. (2013). Conditional mutual information and commutator. International Journal of Theoretical Physics\/ 52 , 2112--2117

    work page 2013

  22. [22]

    Zhou, D. L. (2008). Irreducible multiparty correlations in quantum states without maximal rank. Physical Review Letters\/ 101\/ (18), 180505

    work page 2008