The paper introduces p-separation, a graph-separation property that is sound and complete for all finite-dimensional cyclic quantum and classical causal models, with probabilities defined via post-selected teleportation.
Note that the original papers [BLO20, BLO21] useρAi|Pa(Ai) rather thanσAi|Pa(Ai) for the channels mentioned in the above definition
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Cyclic quantum causal modelling with a graph separation theorem
The paper introduces p-separation, a graph-separation property that is sound and complete for all finite-dimensional cyclic quantum and classical causal models, with probabilities defined via post-selected teleportation.