Functional causal models (fCMs) specify functional dependencies between random variables associated to the vertices of a graph. In directed acyclic graphs (DAGs), fCMs are well-understood: a unique probability distribution on the random variables can be easily specified, and a crucial graph-separation result called the d-separation theorem allows one to characterize conditional independences between the variables. However, fCMs on cyclic graphs pose challenges due to the absence of a systematic way to assign a unique probability distribution to the fCM's variables, the failure of the d-separation theorem, and lack of a generalization of this theorem that is applicable to all consistent cyclic fCMs. In this work, we develop a causal modeling framework applicable to all cyclic fCMs involving finite-cardinality variables, except inconsistent ones admitting no solutions. Our probability rule assigns a unique distribution even to non-uniquely solvable cyclic fCMs and reduces to the known rule for uniquely solvable fCMs. We identify a class of fCMs, called averagely uniquely solvable, that we show to be the largest class where the probabilities admit a Markov factorization. Furthermore, we introduce a new graph-separation property, p-separation, and prove this to be sound and complete for all consistent finite-cardinality cyclic fCMs while recovering the d-separation theorem for DAGs. These results are obtained by considering classical post-selected teleportation protocols inspired by analogous protocols in quantum information theory. We discuss further avenues for exploration, linking in particular problems in cyclic fCMs and in quantum causality.
Functional causal models (fCMs) specify functional dependencies between random variables associated to the vertices of a graph. In directed acyclic graphs (DAGs), fCMs are well-understood: a unique probability distribution on the random variables can be easily specified, and a crucial graph-separation result called the d-separation theorem allows one to characterize conditional independences between the variables. However, fCMs on cyclic graphs pose challenges due to the absence of a systematic way to assign a unique probability distribution to the fCM's variables, the failure of the d-separation theorem, and lack of a generalization of this theorem that is applicable to all consistent cyclic fCMs. In this work, we develop a causal modeling framework applicable to all cyclic fCMs involving finite-cardinality variables, except inconsistent ones admitting no solutions. Our probability rule assigns a unique distribution even to non-uniquely solvable cyclic fCMs and reduces to the known rule for uniquely solvable fCMs. We identify a class of fCMs, called averagely uniquely solvable, that we show to be the largest class where the probabilities admit a Markov factorization. Furthermore, we introduce a new graph-separation property, p-separation, and prove this to be sound and complete for all consistent finite-cardinality cyclic fCMs while recovering the d-separation theorem for DAGs. These results are obtained by considering classical post-selected teleportation protocols inspired by analogous protocols in quantum information theory. We discuss further avenues for exploration, linking in particular problems in cyclic fCMs and in quantum causality.
Causal modelling frameworks link observable correlations to causal explanations, which is a crucial aspect of science. These models represent causal relationships through directed graphs, with vertices and edges denoting systems and transformations within a theory. Most studies focus on acyclic causal graphs, where well-defined probability rules and powerful graph-theoretic properties like the d-separation theorem apply. However, understanding complex feedback processes and exotic fundamental scenarios with causal loops requires cyclic causal models, where such results do not generally hold. While progress has been made in classical cyclic causal models, challenges remain in uniquely fixing probability distributions and identifying graph-separation properties applicable in general cyclic models. In cyclic quantum scenarios, existing frameworks have focussed on a subset of possible cyclic causal scenarios, with graph-separation properties yet unexplored. This work proposes a framework applicable to all consistent quantum and classical cyclic causal models on finite-dimensional systems. We address these challenges by introducing a robust probability rule and a novel graph-separation property, p-separation, which we prove to be sound and complete for all such models. Our approach maps cyclic causal models to acyclic ones with post-selection, leveraging the post-selected quantum teleportation protocol. We characterize these protocols and their success probabilities along the way. We also establish connections between this formalism and other classical and quantum frameworks to inform a more unified perspective on causality. This provides a foundation for more general cyclic causal discovery algorithms and to systematically extend open problems and techniques from acyclic informational networks (e.g., certification of non-classicality) to cyclic causal structures and networks.
A causal model is an abstract representation of a physical system as a directed acyclic graph (DAG), where the statistical dependencies are encoded using a graphical criterion called ' d -separation'. Recent work by Wood and Spekkens shows that causal models cannot, in general, provide a faithful representation of quantum systems. Since d -separation encodes a form of Reichenbach's common cause principle (RCCP), whose validity is questionable in quantum mechanics, we propose a generalized graph separation rule that does not assume the RCCP. We prove that the new rule faithfully captures the statistical dependencies between observables in a quantum network, encoded as a DAG, and reduces to d -separation in a classical limit.
It is known that the classical framework of causal models is not general enough to allow for causal reasoning about quantum systems. While the framework has been generalized in a variety of different ways to the quantum case, much of this work leaves open whether causal concepts are fundamental to quantum theory, or only find application at an emergent level of classical devices and measurement outcomes. Here, we present a framework of quantum causal models, with causal relations defined in terms intrinsic to quantum theory, and the central object of study being the quantum process itself. Following Allen et al., Phys. Rev. X 7, 031021 (2017), the approach defines quantum causal relations in terms of unitary evolution, in a way analogous to an approach to classical causal models that assumes underlying determinism and situates causal relations in functional dependences between variables. We show that any unitary quantum circuit has a causal structure corresponding to a directed acyclic graph, and that when marginalising over local noise sources, the resulting quantum process satisfies a Markov condition with respect to the graph. We also prove a converse to this statement. We introduce an intrinsically quantum notion that plays a role analogous to the conditional independence of classical variables, and (generalizing a central theorem of the classical framework) show that d-separation is sound and complete for it in the quantum case. We present generalizations of the three rules of the classical do-calculus, in each case relating a property of the causal structure to a formal property of the quantum process, and to an operational statement concerning the outcomes of interventions. In addition, we introduce and derive similar results for classical split-node causal models, which are more closely analogous to quantum causal models than the classical causal models that are usually studied.
Causal modeling is a tool for generating causal explanations of observed correlations and has led to a deeper understanding of correlations in quantum networks. Existing frameworks for quantum causality tend to focus on acyclic causal structures that are not fine-tuned i.e., where causal connections between variables necessarily create correlations between them. However, fine-tuned causal models (which permit causation without correlation) play a crucial role in cryptography, and cyclic causal models can be used to model physical processes involving feedback and may also be relevant in exotic solutions of general relativity. Here we develop a causal modeling framework capable of dealing with these general scenarios. The key feature of our framework is that it allows operational and relativistic notions of causality to be independently defined and for connections between them to be established in a theory-independent manner. The framework first gives an operational way to study causation that allows for cyclic, fine-tuned, and nonclassical causal influences. We then consider how a causal model can be embedded in a space-time structure (modeled as a partial order) and propose a compatibility condition for ensuring that the embedded causal model does not allow signaling outside the space-time future. We identify several distinct classes of causal loops that can arise in our framework, showing that compatibility with a space-time can rule out only some of them. We discuss conditions for preventing superluminal signaling within arbitrary (and possibly cyclic) causal structures and consider models of causation in postquantum theories admitting so-called jamming correlations. Finally, this work introduces the concept of a higher-order affects relation, which is useful for causal discovery in fined-tuned causal models.
Determining potential probability distributions with a given causal graph is vital for causality studies. To bypass the difficulty in characterizing latent variables in a Bayesian network, the nested Markov model provides an elegant algebraic approach by listing exactly all the equality constraints on the observed variables. However, this algebraically motivated causal model comprises distributions outside Bayesian networks, and its physical interpretation remains vague. In this work, we inspect the nested Markov model through the lens of generalized probabilistic theory, an axiomatic framework to describe general physical theories. We prove that all the equality constraints defining the nested Markov model are valid theory-independently. At the same time, not every distribution within the nested Markov model is implementable, not even via exotic physical theories associated with generalized probability theories (GPTs). To interpret the origin of such a gap, we study three causal models standing between the nested Markov model and the set of all distributions admitting some GPT realization. Each of the successive three models gives a strictly tighter characterization of the physically implementable distribution set; that is, each successive model manifests new types of GPT-inviolable constraints. We further demonstrate each gap through a specially chosen illustrative causal structure. We anticipate our results will enlighten further explorations on the unification of algebraic and physical perspectives of causality.
Bell's theorem reveals that quantum theory is in tension with classical causal reasoning and, in particular, the notion of local causality. This is now understood as a particular example of non-classicality in the study of correlations in (Bayesian) networks with both unobserved and observed nodes: the correlations are probability distributions over the observed nodes. There is a great deal of work aiming to understand the bounds on quantum and classical correlations in such networks and one approach is to consider outer approximations to the former. Along these lines, we consider quasiprobabilistic models for Bayesian networks, which can be seen as classical models but the probability distributions involving unobserved nodes are "replaced" with quasiprobabilities that respect normalisation but not positivity. We denote the set of correlations resulting from these models as the quasi set. Such models have a history in the study of Bell-type non-classicality where it has been shown that they can produce all non-signalling correlations. We show a generalisation of this result for a broad class of networks, which motivates a conjecture that the quasi set recovers the so called nested Markov model. Our work utilises a connection to tensor network decompositions, which may be of independent interest.