Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0806.2962

Entropic bounds for the quantum marginal problem

Tobias J. Osborne

Published Jun 18, 2008• 8 citations
arXivHTMLPDF

Abstract

The quantum marginal problem asks, given a set of reduced quantum states of a multipartite system, whether there exists a joint quantum state consistent with these reduced states. The quantum marginal problem is known to be hard to solve in general as it is a variant of the N-representability problem. We provide entropic bounds on the number of orthogonal solutions to the quantum marginal problem.

DOI
10.48550/arxiv.0806.2962

Related papers

The quantum marginal problem

Christian Schilling

The question of whether given density operators for subsystems of a multipartite quantum system are compatible to one common total density operator is known as the quantum marginal problem. We briefly review the solution of a subclass of such problems found just recently. In particular, this provides the solution of the $1$-body $N$-representability problem. Its solution, the so-called generalized Pauli constraints, restrict the set of mathematically possible fermionic occupation numbers significantly, and strengthens Pauli's exclusion principle. Moreover, we review the study of a concrete physical model of interacting fermions confined to a harmonic trap. There, we found occupation numbers close, but not exactly on the boundary of the allowed region. This new effect of quasipinning is physically relevant since it corresponds to a simplified structure of the corresponding $N$-fermion quantum state.

arXiv:1404.1085•Mathematical Results in Quantum Mechanics (QMath)•Nov 5, 2014•56 citations

Reconstructing the whole from its parts

Daniel Uzcátegui Contreras, Dardo Goyeneche

The quantum marginal problem consists in deciding whether a given set of marginal reductions is compatible with the existence of a global quantum state or not. In this work, we formulate the problem from the perspective of dynamical systems theory and study its advantages with respect to the standard approach. The introduced formalism allows us to analytically determine global quantum states from a wide class of self-consistent marginal reductions in any multipartite scenario. In particular, 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. This result reveals that the complexity associated to the marginal problem can be drastically reduced when restricting the attention to sufficiently mixed marginals. We also formulate the marginal problem in a compressed way, in the sense that the total number of scalar constraints is smaller than the one required by the standard approach. This fact suggests an exponential speedup in runtime when considering semi-definite programming techniques to solve it, in both classical and quantum algorithms. Finally, we reconstruct $n$-qubit quantum states from all the $\binom{n}{k}$ marginal reductions to $k$ parties, generated from randomly chosen mixed states. Numerical simulations reveal that the fraction of cases where we can find a global state equals 1 when $5\leq n\leq12$ and $\lfloor(n-1)/\sqrt{2}\rfloor\leq k\leq n-1$, where $\lfloor\cdot\rfloor$ denotes the floor function.

arXiv:2209.14154•Sep 28, 2022•3 citations

Entropic Inequalities and Marginal Problems

Tobias Fritz, Rafael Chaves

A marginal problem asks whether a given family of marginal distributions for some set of random variables arises from some joint distribution of these variables. Here, we point out that the existence of such a joint distribution imposes nontrivial conditions already on the level of Shannon entropies of the given marginals. These entropic inequalities are necessary (but not sufficient) criteria for the existence of a joint distribution. For every marginal problem, a list of such Shannon-type entropic inequalities can be calculated by Fourier-Motzkin elimination, and we offer a software interface to a Fourier-Motzkin solver for doing so. For the case that the hypergraph of given marginals is a cycle graph, we provide a complete analytic solution to the problem of classifying all relevant entropic inequalities, and use this result to bound the decay of correlations in stochastic processes. Furthermore, we show that Shannon-type inequalities for differential entropies are not relevant for continuous-variable marginal problems; non-Shannon-type inequalities are both in the discrete and in the continuous case. In contrast to other approaches, our general framework easily adapts to situations where one has additional (conditional) independence requirements on the joint distribution, as in the case of graphical models. We end with a list of open problems. A complementary article discusses applications to quantum nonlocality and contextuality.

arXiv:1112.4788•IEEE Transactions on Information Theory•Oct 22, 2012•97 citations

Renyi-entropic bounds on quantum communication

Wim van Dam, Patrick M. Hayden

In this article we establish new bounds on the quantum communication complexity of distributed problems. Specifically, we consider the amount of communication that is required to transform a bipartite state into another, typically more entangled, state. We obtain lower bounds in this setting by studying the Renyi entropy of the marginal density matrices of the distributed system. The communication bounds on quantum state transformations also imply lower bounds for the model of communication complexity where the task consists of the the distributed evaluation of a function f(x,y). Our approach encapsulates several known lower bound methods that use the log-rank or the von Neumann entropy of the density matrices involved. The technique is also effective for proving lower bounds on problems involving a promise or for which the "hard" distributions of inputs are correlated. As examples, we show how to prove a nearly tight bound on the bounded-error quantum communication complexity of the inner product function in the presence of unlimited amounts of EPR-type entanglement and a similarly strong bound on the complexity of the shifted quadratic character problem.

arXiv:quant-ph/0204093•Apr 17, 2002•57 citations

Compatible quantum correlations: Extension problems for Werner and isotropic states

Peter D. Johnson, Lorenza Viola

We investigate some basic scenarios in which a given set of bipartite quantum states may consistently arise as the set of reduced states of a global $N$-partite quantum state. Intuitively, we say that the multipartite state ``joins'' the underlying correlations. Determining whether, for a given set of states and a given joining structure, a compatible $N$-partite quantum state exists is known as the quantum marginal problem. We restrict to bipartite reduced states that belong to the paradigmatic classes of Werner and isotropic states in $d$ dimensions and focus on two specific versions of the quantum marginal problem which we find to be tractable. The first is Alice-Bob, Alice-Charlie joining, with both pairs being in a Werner or isotropic state. The second is $m$-$n$ sharability of a Werner state across $N$ subsystems, which may be seen as a variant of the $N$-representability problem to the case where subsystems are partitioned into two groupings of $m$ and $n$ parties, respectively. By exploiting the symmetry properties that each class of states enjoys, we determine necessary and sufficient conditions for three-party joinability and 1-$n$ sharability for arbitrary $d$. Our results explicitly show that although entanglement is required for sharing limitations to emerge, correlations beyond entanglement generally suffice to restrict joinability, and not all unentangled states necessarily obey the same limitations. The relationship between joinability and quantum cloning as well as implications for the joinability of arbitrary bipartite states are discussed.

arXiv:1305.1342•Physical Review A•Sep 27, 2013•33 citations

Detecting consistency of overlapping quantum marginals by separability

Jianxin Chen, Zhengfeng Ji, Nengkun Yu +1 more

The quantum marginal problem asks whether a set of given density matrices are consistent, i.e., whether they can be the reduced density matrices of a global quantum state. Not many nontrivial analytic necessary (or sufficient) conditions are known for the problem in general. We propose a method to detect consistency of overlapping quantum marginals by considering the separability of some derived states. Our method works well for the $k$-symmetric extension problem in general and for the general overlapping marginal problems in some cases. Our work is, in some sense, the converse to the well-known $k$-symmetric extension criterion for separability.

arXiv:1509.06591•Physical Review A•Mar 3, 2016•9 citations
The quantum marginal problem asks, given a set of reduced quantum states of a multipartite system, whether there exists a joint quantum state consistent with these reduced states. The quantum marginal problem is known to be hard to solve in general as it is a variant of the N-representability problem. We provide entropic bounds on the number of orthogonal solutions to the quantum marginal problem.
The question of whether given density operators for subsystems of a multipartite quantum system are compatible to one common total density operator is known as the quantum marginal problem. We briefly review the solution of a subclass of such problems found just recently. In particular, this provides the solution of the 111-body NNN-representability problem. Its solution, the so-called generalized Pauli constraints, restrict the set of mathematically possible fermionic occupation numbers significantly, and strengthens Pauli's exclusion principle. Moreover, we review the study of a concrete physical model of interacting fermions confined to a harmonic trap. There, we found occupation numbers close, but not exactly on the boundary of the allowed region. This new effect of quasipinning is physically relevant since it corresponds to a simplified structure of the corresponding NNN-fermion quantum state.
The quantum marginal problem consists in deciding whether a given set of marginal reductions is compatible with the existence of a global quantum state or not. In this work, we formulate the problem from the perspective of dynamical systems theory and study its advantages with respect to the standard approach. The introduced formalism allows us to analytically determine global quantum states from a wide class of self-consistent marginal reductions in any multipartite scenario. In particular, 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. This result reveals that the complexity associated to the marginal problem can be drastically reduced when restricting the attention to sufficiently mixed marginals. We also formulate the marginal problem in a compressed way, in the sense that the total number of scalar constraints is smaller than the one required by the standard approach. This fact suggests an exponential speedup in runtime when considering semi-definite programming techniques to solve it, in both classical and quantum algorithms. Finally, we reconstruct nnn-qubit quantum states from all the (nk)\binom{n}{k}(kn​) marginal reductions to kkk parties, generated from randomly chosen mixed states. Numerical simulations reveal that the fraction of cases where we can find a global state equals 1 when 5≤n≤125\leq n\leq125≤n≤12 and ⌊(n−1)/2⌋≤k≤n−1\lfloor(n-1)/\sqrt{2}\rfloor\leq k\leq n-1⌊(n−1)/2​⌋≤k≤n−1, where ⌊⋅⌋\lfloor\cdot\rfloor⌊⋅⌋ denotes the floor function.
A marginal problem asks whether a given family of marginal distributions for some set of random variables arises from some joint distribution of these variables. Here, we point out that the existence of such a joint distribution imposes nontrivial conditions already on the level of Shannon entropies of the given marginals. These entropic inequalities are necessary (but not sufficient) criteria for the existence of a joint distribution. For every marginal problem, a list of such Shannon-type entropic inequalities can be calculated by Fourier-Motzkin elimination, and we offer a software interface to a Fourier-Motzkin solver for doing so. For the case that the hypergraph of given marginals is a cycle graph, we provide a complete analytic solution to the problem of classifying all relevant entropic inequalities, and use this result to bound the decay of correlations in stochastic processes. Furthermore, we show that Shannon-type inequalities for differential entropies are not relevant for continuous-variable marginal problems; non-Shannon-type inequalities are both in the discrete and in the continuous case. In contrast to other approaches, our general framework easily adapts to situations where one has additional (conditional) independence requirements on the joint distribution, as in the case of graphical models. We end with a list of open problems. A complementary article discusses applications to quantum nonlocality and contextuality.
In this article we establish new bounds on the quantum communication complexity of distributed problems. Specifically, we consider the amount of communication that is required to transform a bipartite state into another, typically more entangled, state. We obtain lower bounds in this setting by studying the Renyi entropy of the marginal density matrices of the distributed system. The communication bounds on quantum state transformations also imply lower bounds for the model of communication complexity where the task consists of the the distributed evaluation of a function f(x,y). Our approach encapsulates several known lower bound methods that use the log-rank or the von Neumann entropy of the density matrices involved. The technique is also effective for proving lower bounds on problems involving a promise or for which the "hard" distributions of inputs are correlated. As examples, we show how to prove a nearly tight bound on the bounded-error quantum communication complexity of the inner product function in the presence of unlimited amounts of EPR-type entanglement and a similarly strong bound on the complexity of the shifted quadratic character problem.
We investigate some basic scenarios in which a given set of bipartite quantum states may consistently arise as the set of reduced states of a global NNN-partite quantum state. Intuitively, we say that the multipartite state ``joins'' the underlying correlations. Determining whether, for a given set of states and a given joining structure, a compatible NNN-partite quantum state exists is known as the quantum marginal problem. We restrict to bipartite reduced states that belong to the paradigmatic classes of Werner and isotropic states in ddd dimensions and focus on two specific versions of the quantum marginal problem which we find to be tractable. The first is Alice-Bob, Alice-Charlie joining, with both pairs being in a Werner or isotropic state. The second is mmm-nnn sharability of a Werner state across NNN subsystems, which may be seen as a variant of the NNN-representability problem to the case where subsystems are partitioned into two groupings of mmm and nnn parties, respectively. By exploiting the symmetry properties that each class of states enjoys, we determine necessary and sufficient conditions for three-party joinability and 1-nnn sharability for arbitrary ddd. Our results explicitly show that although entanglement is required for sharing limitations to emerge, correlations beyond entanglement generally suffice to restrict joinability, and not all unentangled states necessarily obey the same limitations. The relationship between joinability and quantum cloning as well as implications for the joinability of arbitrary bipartite states are discussed.
The quantum marginal problem asks whether a set of given density matrices are consistent, i.e., whether they can be the reduced density matrices of a global quantum state. Not many nontrivial analytic necessary (or sufficient) conditions are known for the problem in general. We propose a method to detect consistency of overlapping quantum marginals by considering the separability of some derived states. Our method works well for the kkk-symmetric extension problem in general and for the general overlapping marginal problems in some cases. Our work is, in some sense, the converse to the well-known kkk-symmetric extension criterion for separability.