paper-with-me

Papers

Cyclic quantum causal modelling with a graph separation theorem

2025-02-06 · Carla Ferradini, Victor Gitton, V. Vilasini

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.

📄 PDF Abstract BibTeX arXiv:2502.04168

Code (0)

등록된 구현이 없습니다.

Tasks

Causal Discovery

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

Cyclic functional causal models beyond unique solvability with a graph separation theorem

2025-02-06 · Carla Ferradini, Victor Gitton, V. Vilasini

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 distributi…

A super-polynomial quantum-classical separation for density modelling

2022-10-26 · Niklas Pirnay, Ryan Sweke, Jens Eisert, Jean-Pierre Seifert

Density modelling is the task of learning an unknown probability density function from samples, and is one of the central problems of unsupervised machine learning. In this work, we show that there exists a density model…

p-d-Separation -- A Concept for Expressing Dependence/Independence Relations in Causal Networks

2020-06-15 · Mieczysław A. Kłopotek

Spirtes, Glymour and Scheines formulated a Conjecture that a direct dependence test and a head-to-head meeting test would suffice to construe directed acyclic graph decompositions of a joint probability distribution (Bay…

Calculation of Entailed Rank Constraints in Partially Non-Linear and Cyclic Models

2013-09-17 · Peter L. Spirtes

The Trek Separation Theorem (Sullivant et al. 2010) states necessary and sufficient conditions for a linear directed acyclic graphical model to entail for all possible values of its linear coefficients that the rank of v…

Separation-based distance measures for causal graphs

2024-02-07 · jonas Wahl, Jakob Runge

Assessing the accuracy of the output of causal discovery algorithms is crucial in developing and comparing novel methods. Common evaluation metrics such as the structural Hamming distance are useful for assessing individ…

Causal Discovery