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:2211.06107

Reversible computation and the causal structure of space-time

Anandamay Das Bhowmik, Preeti Parashar

Published Nov 11, 2022• 0 citations
arXivHTMLPDF

Abstract

Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit. The reversible operations that a quantum computer can perform on a qubit are group of linear unitary transformations. However, laws of quantum mechanics prohibit implementation of anti-linear anti-unitary gates, even though they are perfectly reversible. Here we show that such a restriction on possible set of reversible operations is, remarkably, a fundamental constraint of spacetime structure. In particular, it will be shown that construction of any anti-linear anti-unitary gate will lead to violation of a fundamental causal primitive which, as we shall argue, is fundamentally different from the principle of relativistic causality.

DOI
10.48550/arxiv.2211.06107

Related papers

Forward Unitarity and the Temporal Field T: A Forward‑Directed Reformulation of Quantum Mechanics Compatible with General Relativity

Richard Thomas

Quantum mechanics is traditionally formulated using the reversible coordinate time \(t\), which enforces a globally reversible unitary group structure and time‑symmetric propagators. This conflicts with physically irreversible processes such as decoherence, measurement, entropy production, causal propagation, and curvature‑driven focusing in general relativity. We resolve this mismatch by replacing \(t\) with the monotonic temporal field \(T\), previously developed in the context of global causal structure, temporal focusing, and worldline ordering in curved spacetime. Once \(T\) is taken as the fundamental evolution parameter, quantum dynamics cannot be reversible: the inverse operator \(U^{-1}\) is not physically realizable, and unitary evolution becomes a forward‑directed semigroup. We formulate **forward unitarity**, in which physical evolution is generated only by forward‑directed operators \(U_{\rm phys}(T_2,T_1)\) with \(T_2 > T_1\). Pure states evolve according to a forward Schrödinger equation with an intrinsic, monotonic decoherence functional \(\mathcal{D}(T)\), while mixed states evolve under a forward Lindblad structure. Probability is conserved, but coherent recoverability is forbidden by geometric irreversibility, causal structure, and temporal focusing. We construct a Forward‑QM Lagrangian, a forward Heisenberg picture, and a forward path integral restricted to histories with non‑decreasing \(T\), showing how operator algebras, propagators, correlation functions, and creation/annihilation operators inherit the arrow of time. Forward‑QM provides a unified, forward‑directed formulation of quantum mechanics compatible with general relativity, causal geometry, and the irreversible structure of spacetime. It replaces reversible unitary groups with physically meaningful semigroup evolution, aligns quantum dynamics with measurement, decoherence, and entropy production, and establishes the foundation for Forward Quantum Field Theory (FQFT). The extension to FQFT—covering forward propagators, interacting fields, renormalization in the presence of monotonic decoherence, and causal compatibility in curved spacetime—will be developed in future work.

•Oct 15, 2026•0 citations

Construction of Quantum Circuits for Classical Logical Gates Using Quantum Gates with Qiskit

Sumathi Pawar, Suchetha N V, Ramasubramanian Murugesan +2 more

The fundamental difference between classical and quantum computation lies in the nature of information representation and logical operations. This paper presents design of quantum circuits to the different classical gates. Quantum gates operate on qubits and are mathematically represented by unitary matrices, ensuring reversibility and preservation of information. In this system, using the Pauli-X gate, Controlled NOT gate, and Toffoli gate, the equivalent classical gates are constructed. The analysis demonstrates that while quantum gates reproduce classical logical outputs for computational basis states, they fundamentally differ in structure, requiring auxiliary qubits to maintain reversibility. Furthermore, quantum gates support superposition and entanglement, which extend computational capabilities beyond classical limitations. This article is result implementation of quantum gates using Qiskit simulation software. The results highlight that quantum logic gates can be viewed as reversible generalizations of classical gates under unitary constraints. This article also analyses the fault-taulorent and cost effectiveness of the designed circuits.

International Conference Computational Vision and Bio Inspired Computing•Aug 1, 2026•0 citations

Quantum Gates and Circuits

Kolla Bhanu Prakash

Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.

Wiley eBooks•Aug 17, 2026•0 citations

Investigations in Quantum Computing: Causality and Graph Isomorphism

David Beckman

In this thesis I explore two different types of limits on the time complexity of quantum computation---that is, limits on how much time is required to perform a given class of quantum operations on a quantum system. Upper limits can be found by explicit construction; I explore this approach for the problem of determining whether two graphs are isomorphic. Finding lower limits, on the other hand, usually requires appeal to some fundamental principle of the operation under consideration; I use this approach to derive lower limits placed by the requirements of relativistic causality on the time required for implementation of some nonlocal quantum operations. In some situations these limits are attainable, but for other physical spacetime geometries we exhibit classes of operations which do not violate relativistic causality but which are nevertheless not implementable.

•May 28, 2004•1 citation

A Quantum Model of Computation

Phillip Kaye, Raymond Laflamme, Michele Mosca

In Section 1.3, we introduced the circuit model of (classical) computation. We restricted attention to reversible circuits since they can simulate any non-reversible circuit with modest overhead. This model can be generalized to a model of quantum circuits. In the quantum circuit model, we have logical qubits carried along ‘wires’, and quantum gates that act on the qubits. A quantum gate acting on n qubits has the input qubits carried to it by n wires, and n other wires carry the output qubits away from the gate. A quantum circuit is often illustrated schematically by a circuit diagram as shown in Figure 4.1. The wires are shown as horizontal lines, and we imagine the qubits propagating along the wires from left to right in time. The gates are shown as rectangular blocks. For convenience, we will restrict attention to unitary quantum gates (which are also reversible). Recall from Section 3.5.3 that non-unitary (non-reversible) quantum operations can be simulated by unitary (reversible) quantum gates if we allow the possibility of adding an ancilla and of discarding some output qubits. A circuit diagram describing a superoperator being implemented using a unitary operator is illustrated in Figure 4.2. In the example of Figure 4.1, the 4-qubit state |ψi⟩= |0⟩⊗ |0⟩⊗ |0⟩⊗ |0⟩ enters the circuit at the left (recall we often write this state as |ψi⟩ = |0⟩|0⟩|0⟩|0⟩ or |ψi⟩ = |0000⟩.) These qubits are processed by the gates U1, U2, U3, and U4. At the output of the circuit we have the collective (possibly entangled) 4-qubit state |ψf⟩. A measurement is then made of the resulting state. The measurement will often be a simple qubit-by-qubit measurement in the computational basis, but in some cases may be a more general measurement of the joint state. A measurement of a single qubit in the computational basis is denoted on a circuit diagram by a small triangle, as shown in Figure 4.1 (there are other symbols used in the literature, but we adopt this one). The triangle symbol will be modified for cases in which there is a need to indicate different types of measurements.R50

Oxford University Press eBooks•Nov 16, 2006•0 citations

Quantum gates

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

This chapter delineates the theoretical and operational foundations of quantum gates, marking the radical transition from deterministic Boolean logic to the probabilistic, unitary formalism of quantum mechanics, and explores the mathematical elegance of gates as reversible operators acting within Hilbert space, where the preservation of probability amplitude fundamentally distinguishes them from irreversible classical counterparts. The discussion traverses the historical evolution of quantum computing, referencing pivotal contributions from Feynman to the Solovay–Kitaev theorem, while addressing the physical imperatives of gate fidelity and fault tolerance. Detailed analysis is provided for essential single-qubit components, including the Hadamard gate’s role in generating superposition and the Pauli group’s geometric rotations on the Bloch sphere. Furthermore, this chapter examines the Controlled-NOT gate as the critical enabler of entanglement and quantum parallelism. By synthesizing matrix algebra with physical implementation challenges—ranging from decoherence to the no-cloning theorem—this chapter establishes the necessary framework for understanding universal gate sets. Ultimately, it provides a rigorous yet accessible roadmap for constructing the complex quantum circuits that underpin advanced algorithms and error-correction protocols.

CRC Press eBooks•Nov 6, 2026•0 citations
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit. The reversible operations that a quantum computer can perform on a qubit are group of linear unitary transformations. However, laws of quantum mechanics prohibit implementation of anti-linear anti-unitary gates, even though they are perfectly reversible. Here we show that such a restriction on possible set of reversible operations is, remarkably, a fundamental constraint of spacetime structure. In particular, it will be shown that construction of any anti-linear anti-unitary gate will lead to violation of a fundamental causal primitive which, as we shall argue, is fundamentally different from the principle of relativistic causality.
Quantum mechanics is traditionally formulated using the reversible coordinate time ttt, which enforces a globally reversible unitary group structure and time‑symmetric propagators. This conflicts with physically irreversible processes such as decoherence, measurement, entropy production, causal propagation, and curvature‑driven focusing in general relativity. We resolve this mismatch by replacing ttt with the monotonic temporal field TTT, previously developed in the context of global causal structure, temporal focusing, and worldline ordering in curved spacetime. Once TTT is taken as the fundamental evolution parameter, quantum dynamics cannot be reversible: the inverse operator U−1U^{-1}U−1 is not physically realizable, and unitary evolution becomes a forward‑directed semigroup. We formulate **forward unitarity**, in which physical evolution is generated only by forward‑directed operators Uphys(T2,T1)U_{\rm phys}(T_2,T_1)Uphys​(T2​,T1​) with T2>T1T_2 > T_1T2​>T1​. Pure states evolve according to a forward Schrödinger equation with an intrinsic, monotonic decoherence functional D(T)\mathcal{D}(T)D(T), while mixed states evolve under a forward Lindblad structure. Probability is conserved, but coherent recoverability is forbidden by geometric irreversibility, causal structure, and temporal focusing. We construct a Forward‑QM Lagrangian, a forward Heisenberg picture, and a forward path integral restricted to histories with non‑decreasing TTT, showing how operator algebras, propagators, correlation functions, and creation/annihilation operators inherit the arrow of time. Forward‑QM provides a unified, forward‑directed formulation of quantum mechanics compatible with general relativity, causal geometry, and the irreversible structure of spacetime. It replaces reversible unitary groups with physically meaningful semigroup evolution, aligns quantum dynamics with measurement, decoherence, and entropy production, and establishes the foundation for Forward Quantum Field Theory (FQFT). The extension to FQFT—covering forward propagators, interacting fields, renormalization in the presence of monotonic decoherence, and causal compatibility in curved spacetime—will be developed in future work.
The fundamental difference between classical and quantum computation lies in the nature of information representation and logical operations. This paper presents design of quantum circuits to the different classical gates. Quantum gates operate on qubits and are mathematically represented by unitary matrices, ensuring reversibility and preservation of information. In this system, using the Pauli-X gate, Controlled NOT gate, and Toffoli gate, the equivalent classical gates are constructed. The analysis demonstrates that while quantum gates reproduce classical logical outputs for computational basis states, they fundamentally differ in structure, requiring auxiliary qubits to maintain reversibility. Furthermore, quantum gates support superposition and entanglement, which extend computational capabilities beyond classical limitations. This article is result implementation of quantum gates using Qiskit simulation software. The results highlight that quantum logic gates can be viewed as reversible generalizations of classical gates under unitary constraints. This article also analyses the fault-taulorent and cost effectiveness of the designed circuits.
Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.
In this thesis I explore two different types of limits on the time complexity of quantum computation---that is, limits on how much time is required to perform a given class of quantum operations on a quantum system. Upper limits can be found by explicit construction; I explore this approach for the problem of determining whether two graphs are isomorphic. Finding lower limits, on the other hand, usually requires appeal to some fundamental principle of the operation under consideration; I use this approach to derive lower limits placed by the requirements of relativistic causality on the time required for implementation of some nonlocal quantum operations. In some situations these limits are attainable, but for other physical spacetime geometries we exhibit classes of operations which do not violate relativistic causality but which are nevertheless not implementable.
In Section 1.3, we introduced the circuit model of (classical) computation. We restricted attention to reversible circuits since they can simulate any non-reversible circuit with modest overhead. This model can be generalized to a model of quantum circuits. In the quantum circuit model, we have logical qubits carried along ‘wires’, and quantum gates that act on the qubits. A quantum gate acting on n qubits has the input qubits carried to it by n wires, and n other wires carry the output qubits away from the gate. A quantum circuit is often illustrated schematically by a circuit diagram as shown in Figure 4.1. The wires are shown as horizontal lines, and we imagine the qubits propagating along the wires from left to right in time. The gates are shown as rectangular blocks. For convenience, we will restrict attention to unitary quantum gates (which are also reversible). Recall from Section 3.5.3 that non-unitary (non-reversible) quantum operations can be simulated by unitary (reversible) quantum gates if we allow the possibility of adding an ancilla and of discarding some output qubits. A circuit diagram describing a superoperator being implemented using a unitary operator is illustrated in Figure 4.2. In the example of Figure 4.1, the 4-qubit state |ψi⟩= |0⟩⊗ |0⟩⊗ |0⟩⊗ |0⟩ enters the circuit at the left (recall we often write this state as |ψi⟩ = |0⟩|0⟩|0⟩|0⟩ or |ψi⟩ = |0000⟩.) These qubits are processed by the gates U1, U2, U3, and U4. At the output of the circuit we have the collective (possibly entangled) 4-qubit state |ψf⟩. A measurement is then made of the resulting state. The measurement will often be a simple qubit-by-qubit measurement in the computational basis, but in some cases may be a more general measurement of the joint state. A measurement of a single qubit in the computational basis is denoted on a circuit diagram by a small triangle, as shown in Figure 4.1 (there are other symbols used in the literature, but we adopt this one). The triangle symbol will be modified for cases in which there is a need to indicate different types of measurements.R50
This chapter delineates the theoretical and operational foundations of quantum gates, marking the radical transition from deterministic Boolean logic to the probabilistic, unitary formalism of quantum mechanics, and explores the mathematical elegance of gates as reversible operators acting within Hilbert space, where the preservation of probability amplitude fundamentally distinguishes them from irreversible classical counterparts. The discussion traverses the historical evolution of quantum computing, referencing pivotal contributions from Feynman to the Solovay–Kitaev theorem, while addressing the physical imperatives of gate fidelity and fault tolerance. Detailed analysis is provided for essential single-qubit components, including the Hadamard gate’s role in generating superposition and the Pauli group’s geometric rotations on the Bloch sphere. Furthermore, this chapter examines the Controlled-NOT gate as the critical enabler of entanglement and quantum parallelism. By synthesizing matrix algebra with physical implementation challenges—ranging from decoherence to the no-cloning theorem—this chapter establishes the necessary framework for understanding universal gate sets. Ultimately, it provides a rigorous yet accessible roadmap for constructing the complex quantum circuits that underpin advanced algorithms and error-correction protocols.