Graphical Tests of Causality
By: Ämin Baumeler, Eleftherios-Ermis Tselentis, Stefan Wolf
Potential Business Impact:
Finds new rules for how information can be shared.
Bell inequalities limit the possible observations of non-communicating parties. Here, we present analogous inequalities for any number of communicating parties under the causal constraints of static causal order, definite causal order, and bi-causal order. All derived inequalities are remarkably simple. They correspond to upper bounds on the winning chance in graphical games: Given a specific directed graph over the parties, the parties are challenged to communicate along a randomly chosen arc. In the case of definite causal order, every game that we find is specified by a kefalopoda digraph. Based on this we define weakly causal correlations as those that satisfy all kefalopoda inequalities. We show that the problem of deciding whether some correlations are weakly causal is solvable in polynomial time in the number of parties.
Similar Papers
Closing the problem of which causal structures of up to six total nodes have a classical-quantum gap
Quantum Physics
Shows how quantum connections are stranger than normal.
The Causal Uncertainty Principle
Applications
Order of study steps limits what findings can apply.
Inequalities Revisited
Information Theory
Finds new math rules by looking at old ones.