Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1602.06987 · Tutorials, schools, and workshops in the mathematical sciences

Causality–Complexity–Consistency: Can Space-Time Be Based on Logic and Computation?

Ämin Baumeler, Stefan Wolf

Published Jan 1, 2017• 13 citations
arXivHTMLPDF
DOI
10.1007/978-3-319-68655-4_6

Related papers

Time, determinism and the spacetime framework

Guido Bacciagaluppi, Antony Valentini

Cambridge University Press eBooks•Oct 22, 2009•0 citations

Computational Consequences of Thermodynamic Causal Stability: A Universal Limit on Retrocausal Quantum Information Processing

Najera Olivas, Sebastian

Recent proposals regarding Closed Timelike Curves (CTCs) suggest they could efficiently solve NP-complete problems. However, we have previously demonstrated that physical CTCs must be dissipative to satisfy the Novikov Self-Consistency Principle. In this work, we derive the computational consequences of this thermodynamic stability. We introduce Geometric Causal Complexity (GCC), a measure based on the accessible volume of the Hilbert space under the Fubini-Study metric. We prove a Universal Causal Complexity Bound: the computational advantage ΔC of a retrocausal channel is strictly limited by the ratio of non-linearity to dissipation, ΔC ≤ (K/γ) C_max. This implies that the "Arrow of Time" acts as a computational resource constraint: the same mechanism that prevents logical paradoxes also prevents the violation of the Church-Turing thesis. We analyze the implications for Rydberg atoms, superconducting circuits, and photonic networks, classifying them by their potential for non-Markovian quantum advantage.

•Nov 21, 2025•0 citations

Non-Causal Computation

Ämin Baumeler, Stefan Wolf

Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a novel computing paradigm beyond quantum computing, replacing this assumption by mere logical consistency: We study non-causal circuits, where a fixed time structure within a gate is locally assumed whilst the global causal structure between the gates is dropped. We present examples of logically consistent non-causal circuits outperforming all causal ones; they imply that suppressing loops entirely is more restrictive than just avoiding the contradictions they can give rise to. That fact is already known for correlations as well as for communication, and we here extend it to computation.

arXiv:1601.06522•Entropy•Jul 2, 2017•19 citations

Modern Space-Time and Undecidability

Rodolfo Gambini, Jorge A. Pullin

Springer eBooks•Nov 21, 2009•24 citations

Probabilistic Causality in Space and Time

Patrick Suppes

Springer eBooks•Jan 1, 1988•4 citations

Unlimited non-causal correlations and their relation to non-locality

Ämin Baumeler, Amin Shiraz Gilani, Jibran Rashid

Non-causal correlations certify the lack of a definite causal order among localized space-time regions. In stark contrast to scenarios where a single region influences its own causal past, some processes that distribute non-causal correlations satisfy a series of natural desiderata: logical consistency, linear and reversible dynamics, and computational tameness. Here, we present such processes among arbitrary many regions where each region influences every other but itself, and show that the above desiderata are altogether insufficient to limit the amount of "acausality" of non-causal correlations. This leaves open the identification of a principle that forbids non-causal correlations. Our results exhibit qualitative and quantitative parallels with the non-local correlations due to Ardehali and Svetlichny.

arXiv:2104.06234•Quantum•Mar 29, 2022•19 citations
Recent proposals regarding Closed Timelike Curves (CTCs) suggest they could efficiently solve NP-complete problems. However, we have previously demonstrated that physical CTCs must be dissipative to satisfy the Novikov Self-Consistency Principle. In this work, we derive the computational consequences of this thermodynamic stability. We introduce Geometric Causal Complexity (GCC), a measure based on the accessible volume of the Hilbert space under the Fubini-Study metric. We prove a Universal Causal Complexity Bound: the computational advantage ΔC of a retrocausal channel is strictly limited by the ratio of non-linearity to dissipation, ΔC ≤ (K/γ) C_max. This implies that the "Arrow of Time" acts as a computational resource constraint: the same mechanism that prevents logical paradoxes also prevents the violation of the Church-Turing thesis. We analyze the implications for Rydberg atoms, superconducting circuits, and photonic networks, classifying them by their potential for non-Markovian quantum advantage.
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a novel computing paradigm beyond quantum computing, replacing this assumption by mere logical consistency: We study non-causal circuits, where a fixed time structure within a gate is locally assumed whilst the global causal structure between the gates is dropped. We present examples of logically consistent non-causal circuits outperforming all causal ones; they imply that suppressing loops entirely is more restrictive than just avoiding the contradictions they can give rise to. That fact is already known for correlations as well as for communication, and we here extend it to computation.
Non-causal correlations certify the lack of a definite causal order among localized space-time regions. In stark contrast to scenarios where a single region influences its own causal past, some processes that distribute non-causal correlations satisfy a series of natural desiderata: logical consistency, linear and reversible dynamics, and computational tameness. Here, we present such processes among arbitrary many regions where each region influences every other but itself, and show that the above desiderata are altogether insufficient to limit the amount of "acausality" of non-causal correlations. This leaves open the identification of a principle that forbids non-causal correlations. Our results exhibit qualitative and quantitative parallels with the non-local correlations due to Ardehali and Svetlichny.