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

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

Najera Olivas, Sebastian

Published Nov 21, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.17666558

Related papers

Thermodynamic Constraints and Computational Complexity in Non-Linear Quantum Feedback Dynamics

Najera Olivas, Sebastian

The intersection of General Relativity and Quantum Mechanics suggests the possibility of nonlinearcausal structures, typically formalized as Closed Timelike Curves (CTCs). However, existingkinematic models suffer from logical ambiguities or exponential thermodynamic costs. In this work,we present a unified dynamic framework that resolves these pathologies through **DissipativeFeedback Control**. (I) We derive a Universal Contraction Theorem, proving that any non-linearquantum loop relaxes to a unique fixed point if the dissipation rate γ exceeds the feedback Lipschitzconstant K. We identify a thermodynamic phase transition between a stable ”Novikov phase”and a chaotic phase. (II) We analyze the computational complexity of this physically realizableregime, demonstrating that thermodynamic stability collapses the complexity class from PSPACEto BQP, thereby preserving the extended Church-Turing thesis. (III) We propose a concreteexperimental verification using interacting Rydberg polaritons in an EIT configuration, where thestable fixed point appears as a temporal soliton. This comprehensive study establishes non-linearquantum feedback not as a metaphysical anomaly, but as a testable branch of non-equilibriumthermodynamics.

•Dec 11, 2025•0 citations

Thermodynamic Unification of Causal Structures: Universal Fixed Points, Criticality, and Fluctuation Theorems in Nonlinear Quantum Feedback

Najera Olivas, Sebastian

The consistency of quantum mechanics in the presence of Closed Timelike Curves (CTCs) has traditionally been framed as a kinematic constraint. We propose a general dynamic framework where causal consistency emerges as a thermodynamic fixed point of open quantum systems. By modeling retrocausal loops as non-linear quantum channels with dissipation, we prove a Universal Contraction Theorem using the logarithmic norm of the Liouvillian superoperator. We demonstrate that any feedback system where the dissipation rate γ exceeds the non-linear Lipschitz constant K must relax to a unique, paradox-free state. We apply this framework to superconducting transmon qubits, deriving quantitative stability bounds (K < 10⁴ s⁻¹) testable with current FPGA technology. This work unifies the arrow of time with the Second Law of Thermodynamics, suggesting that causality is an emergent phase of non-equilibrium matter.

•Nov 21, 2025•0 citations

Closed timelike curves and the second law of thermodynamics

Małgorzata Bartkiewicz, Andrzej Grudka, Ryszard Horodecki +2 more

One out of many emerging implications from solutions of Einstein's general relativity equations are closed timelike curves (CTCs), which are trajectories through space-time that allow for time travel to the past without exceeding the speed of light. Two main quantum models of computation with the use of CTCs were introduced by Deutsch (D-CTC) and by Bennett and Schumacher (P-CTC). Unlike the classical theory in which CTCs lead to logical paradoxes, the quantum D-CTC model provides a solution that is logically consistent due to the self-consistency condition imposed on the evolving system, whereas the quantum P-CTC model chooses such a solution through postselection. Both models are nonequivalent and imply nonstandard phenomena in the field of quantum computation and quantum mechanics. In this paper, we study the implications of these two models on the second law of thermodynamics---the fundamental principle which states that in an isolated system the entropy never decreases. In particular, we construct CTC-based quantum circuits which lead to a decrease in entropy.

arXiv:1711.08334•Physical Review A•Feb 5, 2019•6 citations

Unitary Closed Timelike Curves can Solve all of NP

Omri Shmueli

Born in the intersection between quantum mechanics and general relativity, indefinite causal structure is the idea that in the continuum of time, some sets of events do not have an inherent causal order between them. Process matrices, introduced by Oreshkov, Costa and Brukner (Nature Communications, 2012), define quantum information processing with indefinite causal structure -- a generalization of the operations allowed in standard quantum information processing, and to date, are the most studied such generalization. Araujo et al. (Physical Review A, 2017) defined the computational complexity of process matrices, and showed that polynomial-time process matrix computation is equivalent to standard polynomial-time quantum computation with access to a weakening of post-selection Closed Timelike Curves (CTCs), that are restricted to be $\textit{linear}$. Araujo et al. accordingly defined the complexity class for efficient process matrix computation as $\mathbf{BQP}_{\ell CTC}$ (which trivially contains $\mathbf{BQP}$), and posed the open question of whether $\mathbf{BQP}_{\ell CTC}$ contains computational tasks that are outside $\mathbf{BQP}$. In this work we solve this open question under a widely believed hardness assumption, by showing that $\mathbf{NP} \subseteq \mathbf{BQP}_{\ell CTC}$. Our solution is captured by an even more restricted subset of process matrices that are purifiable (Araujo et al., Quantum, 2017), which (1) is conjectured more likely to be physical than arbitrary process matrices, and (2) is equivalent to polynomial-time quantum computation with access to $\textit{unitary}$ (which are in particular linear) post-selection CTCs. Conceptually, our work shows that the previously held belief, that non-linearity is what enables CTCs to solve $\mathbf{NP}$, is false, and raises the importance of understanding whether purifiable process matrices are physical or not.

quant-pharXiv:2410.04630•Oct 8, 2024•0 citations

Closed timelike curves make quantum and classical computing equivalent

Scott Aaronson, John Watrous

While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to non-trivial insights into general relativity, quantum information and other areas. In this paper, we show that, if CTCs existed, quantum computers would be no more powerful than classical computers: both would have the (extremely large) power of the complexity class polynomial space ( ), consisting of all problems solvable by a conventional computer using a polynomial amount of memory. This solves an open problem proposed by one of us in 2005, and gives an essentially complete understanding of computational complexity in the presence of CTCs. Following the work of Deutsch, we treat a CTC as simply a region of spacetime where a ‘causal consistency’ condition is imposed, meaning that nature has to produce a (probabilistic or quantum) fixed point of some evolution operator. Our conclusion is then a consequence of the following theorem: given any quantum circuit (not necessarily unitary), a fixed point of the circuit can be (implicitly) computed in . This theorem might have independent applications in quantum information.

arXiv:0808.2669•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Nov 11, 2008•109 citations

The Temporal Causality Barrier

Uday Patil

This paper presents a conceptual and analytical investigation into the limits of temporal access through the combined perspectives of causality, relativity, quantum mechanics, thermodynamics, and information theory. The work introduces the concept of the “Temporal Causality Barrier,” a selective and logically grounded framework that distinguishes between passive temporal observation and active temporal intervention. The paper argues that passive observation of the past is both physically permissible and continuously occurring through ordinary causal processes such as light propagation, memory, historical records, and astronomical observation. In contrast, active intervention into the past including backward information transfer, causal alteration of previous events, and closed causal loops is shown to generate logical contradictions and violations of causal consistency. The analysis critically examines major theoretical approaches related to time travel and retrocausality, including closed timelike curves, Novikov’s self-consistency principle, Deutsch’s quantum closed timelike curve model, and the two-state vector formalism in quantum mechanics. The paper argues that while some interpretations may mathematically describe retrocausal correlations, none currently provide an operational mechanism for backward information transmission without encountering paradoxes or information-theoretic inconsistencies. The framework further connects the causal structure of spacetime with the thermodynamic arrow of time, emphasizing the role of entropy, light cone geometry, and information propagation in preserving temporal coherence. The work also explores broader philosophical implications concerning the nature of time, consciousness, causality, and agency within a causally structured universe. Rather than proposing a new physical force or replacing existing theories, this paper provides a logically structured analysis of why temporal observation is compatible with known physics while active temporal intervention remains fundamentally constrained by both physical law and logical consistency.

•May 30, 2026•0 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.
The intersection of General Relativity and Quantum Mechanics suggests the possibility of nonlinearcausal structures, typically formalized as Closed Timelike Curves (CTCs). However, existingkinematic models suffer from logical ambiguities or exponential thermodynamic costs. In this work,we present a unified dynamic framework that resolves these pathologies through **DissipativeFeedback Control**. (I) We derive a Universal Contraction Theorem, proving that any non-linearquantum loop relaxes to a unique fixed point if the dissipation rate γ exceeds the feedback Lipschitzconstant K. We identify a thermodynamic phase transition between a stable ”Novikov phase”and a chaotic phase. (II) We analyze the computational complexity of this physically realizableregime, demonstrating that thermodynamic stability collapses the complexity class from PSPACEto BQP, thereby preserving the extended Church-Turing thesis. (III) We propose a concreteexperimental verification using interacting Rydberg polaritons in an EIT configuration, where thestable fixed point appears as a temporal soliton. This comprehensive study establishes non-linearquantum feedback not as a metaphysical anomaly, but as a testable branch of non-equilibriumthermodynamics.
The consistency of quantum mechanics in the presence of Closed Timelike Curves (CTCs) has traditionally been framed as a kinematic constraint. We propose a general dynamic framework where causal consistency emerges as a thermodynamic fixed point of open quantum systems. By modeling retrocausal loops as non-linear quantum channels with dissipation, we prove a Universal Contraction Theorem using the logarithmic norm of the Liouvillian superoperator. We demonstrate that any feedback system where the dissipation rate γ exceeds the non-linear Lipschitz constant K must relax to a unique, paradox-free state. We apply this framework to superconducting transmon qubits, deriving quantitative stability bounds (K < 10⁴ s⁻¹) testable with current FPGA technology. This work unifies the arrow of time with the Second Law of Thermodynamics, suggesting that causality is an emergent phase of non-equilibrium matter.
One out of many emerging implications from solutions of Einstein's general relativity equations are closed timelike curves (CTCs), which are trajectories through space-time that allow for time travel to the past without exceeding the speed of light. Two main quantum models of computation with the use of CTCs were introduced by Deutsch (D-CTC) and by Bennett and Schumacher (P-CTC). Unlike the classical theory in which CTCs lead to logical paradoxes, the quantum D-CTC model provides a solution that is logically consistent due to the self-consistency condition imposed on the evolving system, whereas the quantum P-CTC model chooses such a solution through postselection. Both models are nonequivalent and imply nonstandard phenomena in the field of quantum computation and quantum mechanics. In this paper, we study the implications of these two models on the second law of thermodynamics---the fundamental principle which states that in an isolated system the entropy never decreases. In particular, we construct CTC-based quantum circuits which lead to a decrease in entropy.
Born in the intersection between quantum mechanics and general relativity, indefinite causal structure is the idea that in the continuum of time, some sets of events do not have an inherent causal order between them. Process matrices, introduced by Oreshkov, Costa and Brukner (Nature Communications, 2012), define quantum information processing with indefinite causal structure -- a generalization of the operations allowed in standard quantum information processing, and to date, are the most studied such generalization. Araujo et al. (Physical Review A, 2017) defined the computational complexity of process matrices, and showed that polynomial-time process matrix computation is equivalent to standard polynomial-time quantum computation with access to a weakening of post-selection Closed Timelike Curves (CTCs), that are restricted to be linear\textit{linear}linear. Araujo et al. accordingly defined the complexity class for efficient process matrix computation as BQPℓCTC\mathbf{BQP}_{\ell CTC}BQPℓCTC​ (which trivially contains BQP\mathbf{BQP}BQP), and posed the open question of whether BQPℓCTC\mathbf{BQP}_{\ell CTC}BQPℓCTC​ contains computational tasks that are outside BQP\mathbf{BQP}BQP. In this work we solve this open question under a widely believed hardness assumption, by showing that NP⊆BQPℓCTC\mathbf{NP} \subseteq \mathbf{BQP}_{\ell CTC}NP⊆BQPℓCTC​. Our solution is captured by an even more restricted subset of process matrices that are purifiable (Araujo et al., Quantum, 2017), which (1) is conjectured more likely to be physical than arbitrary process matrices, and (2) is equivalent to polynomial-time quantum computation with access to unitary\textit{unitary}unitary (which are in particular linear) post-selection CTCs. Conceptually, our work shows that the previously held belief, that non-linearity is what enables CTCs to solve NP\mathbf{NP}NP, is false, and raises the importance of understanding whether purifiable process matrices are physical or not.
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to non-trivial insights into general relativity, quantum information and other areas. In this paper, we show that, if CTCs existed, quantum computers would be no more powerful than classical computers: both would have the (extremely large) power of the complexity class polynomial space ( ), consisting of all problems solvable by a conventional computer using a polynomial amount of memory. This solves an open problem proposed by one of us in 2005, and gives an essentially complete understanding of computational complexity in the presence of CTCs. Following the work of Deutsch, we treat a CTC as simply a region of spacetime where a ‘causal consistency’ condition is imposed, meaning that nature has to produce a (probabilistic or quantum) fixed point of some evolution operator. Our conclusion is then a consequence of the following theorem: given any quantum circuit (not necessarily unitary), a fixed point of the circuit can be (implicitly) computed in . This theorem might have independent applications in quantum information.
This paper presents a conceptual and analytical investigation into the limits of temporal access through the combined perspectives of causality, relativity, quantum mechanics, thermodynamics, and information theory. The work introduces the concept of the “Temporal Causality Barrier,” a selective and logically grounded framework that distinguishes between passive temporal observation and active temporal intervention. The paper argues that passive observation of the past is both physically permissible and continuously occurring through ordinary causal processes such as light propagation, memory, historical records, and astronomical observation. In contrast, active intervention into the past including backward information transfer, causal alteration of previous events, and closed causal loops is shown to generate logical contradictions and violations of causal consistency. The analysis critically examines major theoretical approaches related to time travel and retrocausality, including closed timelike curves, Novikov’s self-consistency principle, Deutsch’s quantum closed timelike curve model, and the two-state vector formalism in quantum mechanics. The paper argues that while some interpretations may mathematically describe retrocausal correlations, none currently provide an operational mechanism for backward information transmission without encountering paradoxes or information-theoretic inconsistencies. The framework further connects the causal structure of spacetime with the thermodynamic arrow of time, emphasizing the role of entropy, light cone geometry, and information propagation in preserving temporal coherence. The work also explores broader philosophical implications concerning the nature of time, consciousness, causality, and agency within a causally structured universe. Rather than proposing a new physical force or replacing existing theories, this paper provides a logically structured analysis of why temporal observation is compatible with known physics while active temporal intervention remains fundamentally constrained by both physical law and logical consistency.