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:2501.12320 · PRX Quantum

Fully Quantum Inflation: Quantum Marginal Problem Constraints in the Service of Causal Inference

Isaac D. Smith, Elie Wolfe, Robert W. Spekkens

Published Nov 26, 2025• 5 citations
arXivHTMLPDF

Abstract

Consider the problem of deciding, for a particular multipartite quantum state, whether or not it is realizable in a quantum network with a particular causal structure. This is a fully quantum version of what causal inference researchers refer to as the problem of causal discovery. In this work, we introduce a fully quantum version of the inflation technique for causal inference, which leverages the quantum marginal problem. The primary example by which we illustrate the utility of this method is testing compatibility of tripartite quantum states with the quantum network known as the triangle scenario. We show, in particular, how the method yields a complete classification of pure three-qubit states into those that are and those that are not compatible with the triangle scenario. We also provide some illustrative examples involving mixed-states and some where one or more of the systems is higher dimensional. Furthermore, we examine the question of when the incompatibility of a multipartite quantum state with a causal structure can be inferred from the incompatibility of a joint probability distribution induced by implementing measurements on each subsystem. Finally, we present a family of networks, which includes the triangle scenario as a special case, for which causal compatibility constraints can be derived.

DOI
10.1103/244y-nh5n

Related papers

The Inflation Technique for Causal Inference with Latent Variables

Elie Wolfe, Robert W. Spekkens, Tobias Fritz

Abstract The problem of causal inference is to determine if a given probability distribution on observed variables is compatible with some causal structure. The difficult case is when the causal structure includes latent variables. We here introduce the inflation technique for tackling this problem. An inflation of a causal structure is a new causal structure that can contain multiple copies of each of the original variables, but where the ancestry of each copy mirrors that of the original. To every distribution of the observed variables that is compatible with the original causal structure, we assign a family of marginal distributions on certain subsets of the copies that are compatible with the inflated causal structure. It follows that compatibility constraints for the inflation can be translated into compatibility constraints for the original causal structure. Even if the constraints at the level of inflation are weak, such as observable statistical independences implied by disjoint causal ancestry, the translated constraints can be strong. We apply this method to derive new inequalities whose violation by a distribution witnesses that distribution’s incompatibility with the causal structure (of which Bell inequalities and Pearl’s instrumental inequality are prominent examples). We describe an algorithm for deriving all such inequalities for the original causal structure that follow from ancestral independences in the inflation. For three observed binary variables with pairwise common causes, it yields inequalities that are stronger in at least some aspects than those obtainable by existing methods. We also describe an algorithm that derives a weaker set of inequalities but is more efficient. Finally, we discuss which inflations are such that the inequalities one obtains from them remain valid even for quantum (and post-quantum) generalizations of the notion of a causal model.

arXiv:1609.00672•Journal of Causal Inference•Jul 16, 2019•178 citations

Quantum Temporal Marginal Problem

Dingqian Wang, Jiayi Zhao, Ge Bai

Experiments on a multi-time quantum process may reveal its responses only on selected, possibly overlapping, sets of times. We ask whether these partial descriptions admit a common underlying process, and formulate this process tensor marginal problem as a semidefinite feasibility test. Agreement on overlaps is necessary but insufficient: three locally consistent qubit marginals can have no common extension. Another family is incompatible as a time-ordered process even though a single quantum channel satisfies both its channel and temporal marginal constraints. This isolates temporal causality as the obstruction. We quantify incompatibility by the mixing needed to restore compatibility and derive finite tests using separate interventions at each time and final measurements. We further show that incompatibility is equivalent to an advantage over every compatible family in a multi-time process-discrimination task. Together, these results test whether process descriptions obtained in different experiments can arise from one causally ordered quantum process.

quant-pharXiv:2611.02227•Nov 3, 2026•0 citations

A Convergent Inflation Hierarchy for Quantum Causal Structures

Laurens T. Ligthart, Mariami Gachechiladze, David Gross

Abstract A causal structure is a description of the functional dependencies between random variables. A distribution is compatible with a given causal structure if it can be realized by a process respecting these dependencies. Deciding whether a distribution is compatible with a structure is a practically and fundamentally relevant, yet very difficult problem. Only recently has a general class of algorithms been proposed: These so-called inflation techniques associate to any causal structure a hierarchy of increasingly strict compatibility tests, where each test can be formulated as a computationally efficient convex optimization problem. Remarkably, it has been shown that in the classical case, this hierarchy is complete in the sense that each non-compatible distribution will be detected at some level of the hierarchy. An inflation hierarchy has also been formulated for causal structures that allow for the observed classical random variables to arise from measurements on quantum states—however, no proof of completeness of this quantum inflation hierarchy has been supplied. In this paper, we construct a first version of the quantum inflation hierarchy that is provably convergent. It takes an additional parameter, r , which can be interpreted as an upper bound on the Schmidt rank of the observables involved. For each r , it provides a family of increasingly strict and ultimately complete compatibility tests for correlations that are compatible with a given causal structure under this Schmidt rank constraint. From a technical point of view, convergence proofs are built on de Finetti theorems , which show that certain symmetries (which can be imposed in convex optimization problems) imply independence of random variables (which is not directly a convex constraint). A main technical ingredient to our proof is a Quantum de Finetti Theorem that holds for general tensor products of $$C^*$$ C ∗ -algebras, generalizing previous work that was restricted to minimal tensor products.

arXiv:2110.14659•Communications in Mathematical Physics•Jun 9, 2023•27 citations

Quantum Inflation: A General Approach to Quantum Causal Compatibility

Elie Wolfe, Alejandro Pozas-Kerstjens, Matan Grinberg +3 more

Causality is a seminal concept in science: Any research discipline, from sociology and medicine to physics and chemistry, aims at understanding the causes that could explain the correlations observed among some measured variables.While several methods exist to characterize classical causal models, no general construction is known for the quantum case.In this work, we present quantum inflation, a systematic technique to falsify if a given quantum causal model is compatible with some observed correlations.We demonstrate the power of the technique by reproducing known results and solving open problems for some paradigmatic examples of causal networks.Our results may find applications in many fields: from the characterization of correlations in quantum networks to the study of quantum effects in thermodynamic and biological processes.

arXiv:1909.10519•Physical Review X•May 26, 2021•99 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

The Elegant Joint Measurement is Non-Classical in the Triangle Network

Victor Gitton, Renato Renner

When quantum systems are shared by multiple parties in a network, the measurement outcomes of the parties can exhibit non-classical correlations, i.e., correlations that cannot be obtained if the parties shared classical systems instead. This phenomenon is known as quantum nonlocality and is typically demonstrated in the Bell scenario. However, the Bell scenario is fundamentally simpler to investigate than general networks, since the latter come with non-convex optimization problems that are often intractable. The triangle network is one of the simplest networks exhibiting this non-convexity due to the presence of three independent sources. Although some special cases of quantum nonlocality are known in the triangle network, general methods to certify classical incompatibility are still lacking, which suggests that our understanding of networks is still rather limited. For instance, the Elegant Joint Measurement (EJM) distribution is a simple and highly-symmetric outcome distribution that can be obtained with quantum systems and measurements in the triangle network. This distribution was conjectured to be non-classical eight years ago. In this article, we provide the first proof of non-classicality of the EJM distribution. To do so, we show how to combine inflation, a causal inference technique, with powerful symmetry reductions and Frank-Wolfe algorithms for large-scale optimization. We then use these methods to obtain computer-assisted proofs of non-classicality in exact arithmetic.

arXiv:2510.15143•Oct 16, 2025•7 citations
Consider the problem of deciding, for a particular multipartite quantum state, whether or not it is realizable in a quantum network with a particular causal structure. This is a fully quantum version of what causal inference researchers refer to as the problem of causal discovery. In this work, we introduce a fully quantum version of the inflation technique for causal inference, which leverages the quantum marginal problem. The primary example by which we illustrate the utility of this method is testing compatibility of tripartite quantum states with the quantum network known as the triangle scenario. We show, in particular, how the method yields a complete classification of pure three-qubit states into those that are and those that are not compatible with the triangle scenario. We also provide some illustrative examples involving mixed-states and some where one or more of the systems is higher dimensional. Furthermore, we examine the question of when the incompatibility of a multipartite quantum state with a causal structure can be inferred from the incompatibility of a joint probability distribution induced by implementing measurements on each subsystem. Finally, we present a family of networks, which includes the triangle scenario as a special case, for which causal compatibility constraints can be derived.
Abstract The problem of causal inference is to determine if a given probability distribution on observed variables is compatible with some causal structure. The difficult case is when the causal structure includes latent variables. We here introduce the inflation technique for tackling this problem. An inflation of a causal structure is a new causal structure that can contain multiple copies of each of the original variables, but where the ancestry of each copy mirrors that of the original. To every distribution of the observed variables that is compatible with the original causal structure, we assign a family of marginal distributions on certain subsets of the copies that are compatible with the inflated causal structure. It follows that compatibility constraints for the inflation can be translated into compatibility constraints for the original causal structure. Even if the constraints at the level of inflation are weak, such as observable statistical independences implied by disjoint causal ancestry, the translated constraints can be strong. We apply this method to derive new inequalities whose violation by a distribution witnesses that distribution’s incompatibility with the causal structure (of which Bell inequalities and Pearl’s instrumental inequality are prominent examples). We describe an algorithm for deriving all such inequalities for the original causal structure that follow from ancestral independences in the inflation. For three observed binary variables with pairwise common causes, it yields inequalities that are stronger in at least some aspects than those obtainable by existing methods. We also describe an algorithm that derives a weaker set of inequalities but is more efficient. Finally, we discuss which inflations are such that the inequalities one obtains from them remain valid even for quantum (and post-quantum) generalizations of the notion of a causal model.
Experiments on a multi-time quantum process may reveal its responses only on selected, possibly overlapping, sets of times. We ask whether these partial descriptions admit a common underlying process, and formulate this process tensor marginal problem as a semidefinite feasibility test. Agreement on overlaps is necessary but insufficient: three locally consistent qubit marginals can have no common extension. Another family is incompatible as a time-ordered process even though a single quantum channel satisfies both its channel and temporal marginal constraints. This isolates temporal causality as the obstruction. We quantify incompatibility by the mixing needed to restore compatibility and derive finite tests using separate interventions at each time and final measurements. We further show that incompatibility is equivalent to an advantage over every compatible family in a multi-time process-discrimination task. Together, these results test whether process descriptions obtained in different experiments can arise from one causally ordered quantum process.
Abstract A causal structure is a description of the functional dependencies between random variables. A distribution is compatible with a given causal structure if it can be realized by a process respecting these dependencies. Deciding whether a distribution is compatible with a structure is a practically and fundamentally relevant, yet very difficult problem. Only recently has a general class of algorithms been proposed: These so-called inflation techniques associate to any causal structure a hierarchy of increasingly strict compatibility tests, where each test can be formulated as a computationally efficient convex optimization problem. Remarkably, it has been shown that in the classical case, this hierarchy is complete in the sense that each non-compatible distribution will be detected at some level of the hierarchy. An inflation hierarchy has also been formulated for causal structures that allow for the observed classical random variables to arise from measurements on quantum states—however, no proof of completeness of this quantum inflation hierarchy has been supplied. In this paper, we construct a first version of the quantum inflation hierarchy that is provably convergent. It takes an additional parameter, r , which can be interpreted as an upper bound on the Schmidt rank of the observables involved. For each r , it provides a family of increasingly strict and ultimately complete compatibility tests for correlations that are compatible with a given causal structure under this Schmidt rank constraint. From a technical point of view, convergence proofs are built on de Finetti theorems , which show that certain symmetries (which can be imposed in convex optimization problems) imply independence of random variables (which is not directly a convex constraint). A main technical ingredient to our proof is a Quantum de Finetti Theorem that holds for general tensor products of C∗C^*C∗ C ∗ -algebras, generalizing previous work that was restricted to minimal tensor products.
Causality is a seminal concept in science: Any research discipline, from sociology and medicine to physics and chemistry, aims at understanding the causes that could explain the correlations observed among some measured variables.While several methods exist to characterize classical causal models, no general construction is known for the quantum case.In this work, we present quantum inflation, a systematic technique to falsify if a given quantum causal model is compatible with some observed correlations.We demonstrate the power of the technique by reproducing known results and solving open problems for some paradigmatic examples of causal networks.Our results may find applications in many fields: from the characterization of correlations in quantum networks to the study of quantum effects in thermodynamic and biological processes.
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.
When quantum systems are shared by multiple parties in a network, the measurement outcomes of the parties can exhibit non-classical correlations, i.e., correlations that cannot be obtained if the parties shared classical systems instead. This phenomenon is known as quantum nonlocality and is typically demonstrated in the Bell scenario. However, the Bell scenario is fundamentally simpler to investigate than general networks, since the latter come with non-convex optimization problems that are often intractable. The triangle network is one of the simplest networks exhibiting this non-convexity due to the presence of three independent sources. Although some special cases of quantum nonlocality are known in the triangle network, general methods to certify classical incompatibility are still lacking, which suggests that our understanding of networks is still rather limited. For instance, the Elegant Joint Measurement (EJM) distribution is a simple and highly-symmetric outcome distribution that can be obtained with quantum systems and measurements in the triangle network. This distribution was conjectured to be non-classical eight years ago. In this article, we provide the first proof of non-classicality of the EJM distribution. To do so, we show how to combine inflation, a causal inference technique, with powerful symmetry reductions and Frank-Wolfe algorithms for large-scale optimization. We then use these methods to obtain computer-assisted proofs of non-classicality in exact arithmetic.