Graphical Tests of Causality
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908679510425600 |
|---|---|
| author | Baumeler, Ämin Tselentis, Eleftherios-Ermis Wolf, Stefan |
| author_facet | Baumeler, Ämin Tselentis, Eleftherios-Ermis Wolf, Stefan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_22552 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Graphical Tests of Causality Baumeler, Ämin Tselentis, Eleftherios-Ermis Wolf, Stefan Quantum Physics Computational Complexity 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. |
| title | Graphical Tests of Causality |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2511.22552 |