The Marginal Problem for Density Operators

• URL: http://arxiv.org/abs/2605.19453v1
• Date: Tue, 19 May 2026 07:06:54 GMT
• Title: The Marginal Problem for Density Operators
• Abstract summary: We study when local reduced density operators can be assembled into a global quantum state with a prescribed Markov structure.<n>We prove that this obstruction is captured exactly by a trace condition.<n>Three-qubit Pauli examples show that the quantum obstructions are real.
• Score: 0.30079490585515334
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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})_ρ$ associated with a chordal graph $\mathcal G$ and show that it is a relative-entropy discrepancy from $ρ$ 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.

Related papers

• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• Universal Scaling of the Minimum Error Probability in Qualification of Quantum States [2.8195287696258196]
  Qualification of quantum states judges which of two sets of quantum states an unknown state lies in, where the two sets are labeled by two distinct parameter regions.<n>We show that the $N$-copy permutation symmetry and the geometric symmetries of the parameter regions identify the optimal measurements and the "worst pairwise states"<n>Our approach determines whether a quantum state belongs to a given set without full state tomography, thereby enabling qualification of large ensembles using finite samples.
  arXiv  Detail & Related papers  (2026-08-05T14:00:45Z)
• A Direct Route to Markov Chain Convergence via Asymptotic Equivalence with the Target [16.08983109077834]
  We give a self-contained proof of the Markov chain convergence theorem via a criterion called equivalence with the target.<n>A density version of this criterion is verified on general measurable spaces in three cases.<n>In all mentioned settings Birkhoff's ergodic theorem applies, so as to obtain the strong law of large numbers.
  arXiv  Detail & Related papers  (2026-08-04T09:03:20Z)
• The Kikuchi Hierarchy is Sharp for $k$XOR [46.26532142699448]
  We show that a normalized variant of the Kikuchi hierarchy achieves the sharp conjectured trade-off, with no logarithmic loss, at every arity $kge3$.<n>We also prove matching lower bounds in the same model. The inference and refutation upper bounds transfer to more general planting laws and predicates.
  arXiv  Detail & Related papers  (2026-07-31T17:54:11Z)
• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• Practical Criteria for Entanglement and Nonlocality in Systems with Additive Observables [44.99833362998488]
  For general bipartite mixed states, a sufficient and necessary mathematical condition for certifying entanglement and/or (Bell) non-locality remains unknown.<n>We derive very simple, handy criteria for detecting entanglement or non-locality in many cases.<n>We illustrate these results by analyzing the potential detection of entanglement and nonlocality in Higgs to ZZ decays at the LHC.
  arXiv  Detail & Related papers  (2025-03-21T16:48:04Z)
• Enforced Gaplessness from States with Exponentially Decaying Correlations [0.0]
  We show that even certain exponentially decaying correlations can imply gaplessness.<n>Our findings have implications for identifying the subset of Hilbert space to which gapped ground states belong.
  arXiv  Detail & Related papers  (2025-03-03T19:00:37Z)
• A hybrid quantum algorithm to detect conical intersections [39.58317527488534]
  We show that for real molecular Hamiltonians, the Berry phase can be obtained by tracing a local optimum of a variational ansatz along the chosen path. We demonstrate numerically the application of our algorithm on small toy models of the formaldimine molecule.
  arXiv  Detail & Related papers  (2023-04-12T18:00:01Z)
• Reconstructing the whole from its parts [0.0]
  We analytically determine global quantum states from a wide class of self-consistent marginal reductions in any multipartite scenario. We show that any self-consistent set of multipartite marginal reductions is compatible with the existence of a global quantum state, after passing through a depolarizing channel.
  arXiv  Detail & Related papers  (2022-09-28T15:04:22Z)
• Quantum stochastic phase-space theorems lead to hidden causal loops in a model for measurement consistent with macroscopic realism, Bell nonlocality and no-signaling [0.0]
  We show how quantum measurement and nonlocality can be explained consistently with macroscopic realism and no-signaling.<n>We analyze a measurement of $hatx$ on a system prepared in a superposition of eigenstates.
  arXiv  Detail & Related papers  (2022-05-12T13:10:20Z)
• Super-exponential distinguishability of correlated quantum states [0.0]
  A super-exponential decrease for both types of error probabilities is only possible in the trivial case. We show that a qualitatively different behaviour can occur when there is correlation between the samples.
  arXiv  Detail & Related papers  (2022-03-30T17:49:19Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.