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:2406.14153 · Journal of Physics A Mathematical and Theoretical

On random classical marginal problems with applications to quantum information theory

Ankit Kumar Jha, Ion Nechita

Published Feb 12, 2025• 1 citation
arXivHTMLPDF

Abstract

Abstract In this paper, we study random instances of the classical marginal problem. We encode the problem in a graph, where the vertices have assigned fixed binary probability distributions, and edges have assigned random bivariate distributions having the incident vertex distributions as marginals. We provide estimates on the probability that a joint distribution on the graph exists, having the bivariate edge distributions as marginals. Our study is motivated by Fine’s theorem in quantum mechanics. We study in great detail the graphs corresponding to CHSH and Bell–Wigner scenarios providing rations of volumes between the local and non-signaling polytopes.

DOI
10.1088/1751-8121/adb547

Related papers

Marginal distributions in (2N)-dimensional phase space and the quantum (N+1) marginal theorem

Guy Auberson, Gilbert Mahoux, Shasanka Mohan Roy +1 more

We study the problem of constructing a probability density in 2N-dimensional phase space which reproduces a given collection of n joint probability distributions as marginals. Only distributions authorized by quantum mechanics, i.e., depending on a (complete) commuting set of N variables, are considered. A diagrammatic or graph theoretic formulation of the problem is developed. We then exactly determine the set of “admissible” data, i.e., those types of data for which the problem always admits solutions. This is done in the case where the joint distributions originate from quantum mechanics as well as in the case where this constraint is not imposed. In particular, it is shown that a necessary (but not sufficient) condition for the existence of solutions is n⩽N+1. When the data are admissible and the quantum constraint is not imposed, the general solution for the phase space density is determined explicitly. For admissible data of a quantum origin, the general solution is given in certain (but not all) cases. In the remaining cases, only a subset of solutions is obtained.

arXiv:quant-ph/0402113•Journal of Mathematical Physics•Nov 29, 2004•4 citations

Sets of Marginals and Pearson-Correlation-based CHSH Inequalities for a Two-Qubit System

Yuwen Huang, Pascal O. Vontobel

Quantum mass functions (QMFs), which are tightly related to decoherence functionals, were introduced by Loeliger and Vontobel [IEEE Trans. Inf. Theory, 2017, 2020] as a generalization of probability mass functions toward modeling quantum information processing setups in terms of factor graphs. Simple quantum mass functions (SQMFs) are a special class of QMFs that do not explicitly model classical random variables. Nevertheless, classical random variables appear implicitly in an SQMF if some marginals of the SQMF satisfy some conditions; variables of the SQMF corresponding to these “emerging” random variables are called classicable variables. Of particular interest are jointly classicable variables. In this paper we initiate the characterization of the set of marginals given by the collection of jointly classicable variables of a graphical model and compare them with other concepts associated with graphical models like the sets of realizable marginals and the local marginal polytope. In order to further characterize this set of marginals given by the collection of jointly classicable variables, we generalize the CHSH inequality based on the Pearson correlation coefficients, and thereby prove a conjecture proposed by Pozsgay et al. A crucial feature of this inequality is its nonlinearity, which poses difficulties in the proof.

arXiv:2107.01816•IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•3 citations

Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling

Thomas Gläßle, D Gross, R Chaves

Abstract Marginal problems naturally arise in a variety of different fields: basically, the question is whether some marginal/partial information is compatible with a joint probability distribution. To this aim, the characterization of marginal sets via quantifier elimination and polyhedral projection algorithms is of primal importance. In this work, before considering specific problems, we review polyhedral projection algorithms with focus on applications in information theory, and, alongside known algorithms, we also present a newly developed geometric algorithm which walks along the face lattice of the polyhedron in the projection space. One important application of this is in the field of quantum non-locality, where marginal problems arise in the computation of Bell inequalities. We apply the discussed algorithms to discover many tight entropic Bell inequalities of the tripartite Bell scenario as well as more complex networks arising in the field of causal inference. Finally, we analyze the usefulness of these inequalities as nonlocality witnesses by searching for violating quantum states.

arXiv:1805.03313•Journal of Physics A Mathematical and Theoretical•Oct 10, 2018•9 citations

Bell inequalities in four dimensional phase space and the three marginal theorem

Guy Auberson, Gilbert Mahoux, S. M. Roy +1 more

We address the classical and quantum marginal problems, namely the question of simultaneous realizability through a common probability density in phase space of a given set of compatible probability distributions. We consider only distributions authorized by quantum mechanics, i.e., those corresponding to complete commuting sets of observables. For four-dimensional phase space with position variables q⃗ and momentum variables p⃗, we establish the two following points: (i) given four compatible probabilities for (q1,q2), (q1,p2), (p1,q2), and (p1,p2), there does not always exist a positive phase space density ρ(q⃗,p⃗) reproducing them as marginals; this settles a long standing conjecture; it is achieved by first deriving Bell-type inequalities in phase space which have their own theoretical and experimental interest. (ii) Given instead at most three compatible probabilities, there always exist an associated phase space density ρ(q⃗,p⃗); the solution is not unique and its general form is worked out. These two points constitute our “three marginal theorem.”

arXiv:quant-ph/0205185•Journal of Mathematical Physics•Jun 19, 2003•10 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

Factor Graphs for Quantum Probabilities

Hans‐Andrea Loeliger, Pascal O. Vontobel

A factor-graph representation of quantum-mechanical probabilities (involving any number of measurements) is proposed. Unlike standard statistical models, the proposed representation uses auxiliary variables (state variables) that are not random variables. All joint probability distributions are marginals of some complex-valued function q, and it is demonstrated how the basic concepts of quantum mechanics relate to factorizations and marginals of q.

arXiv:1508.00689•IEEE Transactions on Information Theory•Jan 1, 2017•23 citations
Abstract In this paper, we study random instances of the classical marginal problem. We encode the problem in a graph, where the vertices have assigned fixed binary probability distributions, and edges have assigned random bivariate distributions having the incident vertex distributions as marginals. We provide estimates on the probability that a joint distribution on the graph exists, having the bivariate edge distributions as marginals. Our study is motivated by Fine’s theorem in quantum mechanics. We study in great detail the graphs corresponding to CHSH and Bell–Wigner scenarios providing rations of volumes between the local and non-signaling polytopes.
We study the problem of constructing a probability density in 2N-dimensional phase space which reproduces a given collection of n joint probability distributions as marginals. Only distributions authorized by quantum mechanics, i.e., depending on a (complete) commuting set of N variables, are considered. A diagrammatic or graph theoretic formulation of the problem is developed. We then exactly determine the set of “admissible” data, i.e., those types of data for which the problem always admits solutions. This is done in the case where the joint distributions originate from quantum mechanics as well as in the case where this constraint is not imposed. In particular, it is shown that a necessary (but not sufficient) condition for the existence of solutions is n⩽N+1. When the data are admissible and the quantum constraint is not imposed, the general solution for the phase space density is determined explicitly. For admissible data of a quantum origin, the general solution is given in certain (but not all) cases. In the remaining cases, only a subset of solutions is obtained.
Quantum mass functions (QMFs), which are tightly related to decoherence functionals, were introduced by Loeliger and Vontobel [IEEE Trans. Inf. Theory, 2017, 2020] as a generalization of probability mass functions toward modeling quantum information processing setups in terms of factor graphs. Simple quantum mass functions (SQMFs) are a special class of QMFs that do not explicitly model classical random variables. Nevertheless, classical random variables appear implicitly in an SQMF if some marginals of the SQMF satisfy some conditions; variables of the SQMF corresponding to these “emerging” random variables are called classicable variables. Of particular interest are jointly classicable variables. In this paper we initiate the characterization of the set of marginals given by the collection of jointly classicable variables of a graphical model and compare them with other concepts associated with graphical models like the sets of realizable marginals and the local marginal polytope. In order to further characterize this set of marginals given by the collection of jointly classicable variables, we generalize the CHSH inequality based on the Pearson correlation coefficients, and thereby prove a conjecture proposed by Pozsgay et al. A crucial feature of this inequality is its nonlinearity, which poses difficulties in the proof.
Abstract Marginal problems naturally arise in a variety of different fields: basically, the question is whether some marginal/partial information is compatible with a joint probability distribution. To this aim, the characterization of marginal sets via quantifier elimination and polyhedral projection algorithms is of primal importance. In this work, before considering specific problems, we review polyhedral projection algorithms with focus on applications in information theory, and, alongside known algorithms, we also present a newly developed geometric algorithm which walks along the face lattice of the polyhedron in the projection space. One important application of this is in the field of quantum non-locality, where marginal problems arise in the computation of Bell inequalities. We apply the discussed algorithms to discover many tight entropic Bell inequalities of the tripartite Bell scenario as well as more complex networks arising in the field of causal inference. Finally, we analyze the usefulness of these inequalities as nonlocality witnesses by searching for violating quantum states.
We address the classical and quantum marginal problems, namely the question of simultaneous realizability through a common probability density in phase space of a given set of compatible probability distributions. We consider only distributions authorized by quantum mechanics, i.e., those corresponding to complete commuting sets of observables. For four-dimensional phase space with position variables q⃗ and momentum variables p⃗, we establish the two following points: (i) given four compatible probabilities for (q1,q2), (q1,p2), (p1,q2), and (p1,p2), there does not always exist a positive phase space density ρ(q⃗,p⃗) reproducing them as marginals; this settles a long standing conjecture; it is achieved by first deriving Bell-type inequalities in phase space which have their own theoretical and experimental interest. (ii) Given instead at most three compatible probabilities, there always exist an associated phase space density ρ(q⃗,p⃗); the solution is not unique and its general form is worked out. These two points constitute our “three marginal theorem.”
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.