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

Physical Review A

Reversible logic and quantum computers

Asher Peres

Published Dec 1, 1985• 909 citations
Publisher

Abstract

This article is concerned with the construction of a quantum-mechanical Hamiltonian describing a computer. This Hamiltonian generates a dynamical evolution which mimics a sequence of elementary logical steps. This can be achieved if each logical step is locally reversible (global reversibility is insufficient). Computational errors due to noise can be corrected by means of redundancy. In particular, reversible error-correcting codes can be embedded in the Hamiltonian itself. An estimate is given for the minimum amount of entropy which must be dissipated at a given noise level and tolerated error rate.

DOI
10.1103/physreva.32.3266

Related papers

On the (Im)possibility of Scalable Quantum Computing

Andrew Knight

The potential for scalable quantum computing depends on the viability of fault tolerance and quantum error correction, by which the entropy of environmental noise is removed during a quantum computation to maintain the physical reversibility of the computer’s logical qubits. However, the theory underlying quantum error correction applies a linguistic double standard to the words “noise” and “measurement” by treating environmental interactions during a quantum computation as inherently reversible, and environmental interactions at the end of a quantum computation as irreversible measurements. Specifically, quantum error correction theory models noise as interactions that are uncorrelated or that result in correlations that decay in space and/or time, thus embedding no permanent information to the environment. I challenge this assumption both on logical grounds and by discussing a hypothetical quantum computer based on “position qubits.” The technological difficulties of producing a useful scalable position-qubit quantum computer parallel the overwhelming difficulties in performing a double-slit interference experiment on an object comprising a million to a billion fermions.

•Nov 7, 2021•0 citations

Quantum Computing and Error Correction

Andrew M. Steane

The main ideas of quantum error correction are introduced. These are encoding, extraction of syndromes, error operators, and code construction. It is shown that general noise and relaxation of a set of 2-state quantum systems can always be understood as a combination of Pauli operators acting on the system. Each quantum error correcting code allows a subset of these errors to be corrected. In many situations the noise is such that the remaining uncorrectable errors are unlikely to arise, and hence quantum error correction has a high probability of success. In order to achieve the best noise tolerance in the presence of noise and imprecision throughout the computer, a hierarchical construction of a quantum computer is proposed.

arXiv:quant-ph/0304016•Apr 2, 2003•37 citations

FAULT-TOLERANT QUANTUM COMPUTING VIA PLANCK-SCALE MIMICRY AND SYSTEMS-LOGIC ORCHESTRATION IN THE KECM/CIRHE FRAMEWORK, VERSION 2

Christina Anne Knight

This work presents a unified, deterministic framework for fault‑tolerant quantum computing based on Planck‑scale mimicry and systems‑logic orchestration. Within the Knight Evolutionary Cyclic Model (KECM) and the Cyclic Infinite Reversible Heat Engine (CIRHE) paradigm, spacetime is modeled as a discrete graviton‑flux lattice that updates at the Planck‑scale interval tₚ = Lₚ / c. Decoherence is reinterpreted as a timing‑misalignment artifact rather than an intrinsic quantum limitation: quantum states remain stable when their evolution is synchronized with the substrate’s discrete update rhythm and become unstable when they drift relative to it. The fine structure constant α is recast as a geometric and temporal governor that defines the allowable deviation from this update interval. This leads to the Hardened Qubit, a hardware‑intrinsic stability model in which coherence arises from geometric boundary conditions and timing alignment rather than software‑level error correction. Materials engineered to mimic the fixed‑wavelength graviton‑flux lattice can mechanically reject noise modes that do not match the α‑scaled timing structure, enabling fault tolerance without exponential redundancy. A Systems‑Logic Orchestration layer, inspired by General Systems Theory, provides self‑correcting parametric logic, entropy distillation, and reversible heat‑engine computation. Together, these mechanisms outline a deterministic, physically grounded pathway toward scalable quantum computing that aligns with the universe’s own information‑preserving dynamics.

•Apr 6, 2026•0 citations

Fault-Tolerant Quantum Computation with Adversarial Errors

Nikolas P. Breuckmann, Louis Golowich, Umesh Vazirani

We prove a fault-tolerance theorem for quantum computation against adversarial noise. For every quantum circuit on $\bar{N}$ logical qudits of depth $\bar{T}$, we construct a fault-tolerant circuit on $N=\text{poly}(\bar{N})$ physical qudits of depth $\bar{T}\cdot\bar{N}^{o(1)}$, which is robust against an adversary who may arbitrarily choose and corrupt an almost-linear number $N^{1-o(1)}$ of physical qudits at each time step. This robustness significantly improves upon prior fault-tolerance theorems, which assumed corruptions were either local and stochastic, or else only act on a polynomially vanishing fraction of qudits. Our fault-tolerance scheme addresses a key bottleneck towards constructing quantum PCPs via the circuit-to-Hamiltonian mapping of Anshu, Breuckmann, and Nguyen (STOC'24). More fundamentally, our result demonstrates that fault-tolerant quantum computation remains possible under noise models that are global, worst-case, and non-Markovian over the full duration of the computation, directly countering concerns that correlated noise could fundamentally undermine quantum fault tolerance. Our construction is based on a new family of subsystem product codes we develop, which have large dimension and distance along with low-weight parity-checks, and which support transversal non-Clifford gates. We show how to perform single-shot fault-tolerant error correction on these codes using a Floquet-like procedure based on the local testability of classical tensor codes. We then obtain a universal fault-tolerance scheme using repeated code switching in a hypercubic qudit architecture. Finally, we recursively compose our scheme with itself to reduce an initially exponential qudit dimension down to a constant.

quant-pharXiv:2608.16857•Aug 18, 2026•0 citations

Fault-tolerant preparation of quantum polar codes encoding one logical qubit

Ashutosh Goswami, Mehdi Mhalla, Valentin Savin

This paper explores an approach to fault-tolerant quantum computing (FTQC), relying on quantum polar codes. We consider quantum polar codes of Calderbank-Shor-Steane type, encoding one logical qubit, which we refer to as ${\mathcal{Q}}_{1}$ codes. First, we show that a subfamily of ${\mathcal{Q}}_{1}$ codes is equivalent to the well-known family of Shor codes. Moreover, we show that ${\mathcal{Q}}_{1}$ codes significantly outperform Shor codes, of the same length and minimum distance. Second, we consider the fault-tolerant preparation of ${\mathcal{Q}}_{1}$ code states. We give a recursive procedure to prepare a ${\mathcal{Q}}_{1}$ code state, based on two-qubit Pauli measurements only. The procedure is not by itself fault-tolerant; however, the measurement operations therein provide redundant classical bits, which can be advantageously used for error detection. Fault tolerance is then achieved by combining the proposed recursive procedure with an error detection method. Finally, we consider the fault-tolerant error correction of ${\mathcal{Q}}_{1}$ codes. We use Steane error correction, which incorporates the proposed fault-tolerant code state preparation procedure. We provide numerical estimates of the logical error rates for ${\mathcal{Q}}_{1}$ and Shor codes of length 16 and 64 qubits, assuming a circuit-level depolarizing noise model. Remarkably, the ${\mathcal{Q}}_{1}$ code of length 64 qubits achieves a logical error rate very close to ${10}^{\ensuremath{-}6}$ for the physical error rate $p={10}^{\ensuremath{-}3}$, therefore demonstrating the potential of the proposed polar-codes-based approach to FTQC.

arXiv:2209.06673•Physical Review A•Oct 11, 2023•8 citations

Quantum logic as reversible computing

Basil Evangelidis

The relation between entropy and information has great significance for computation. Based on the strict reversibility of the laws of microphysics, Landauer (1961), Bennett (1973), Priese (1976), Fredkin and Toffoli (1982), Feynman (1985) and others envisioned a reversible computer that cannot allow any ambiguity in backward steps of a calculation. It is this backward capacity that makes reversible computing radically different from ordinary, irreversible computing. The proposal aims at a higher kind of computer that would give the actual output of a computation together with the original input, with the absence of a minimum energy requirement. Hence, information retrievability and energy efficiency due to diminished heat dissipation are the exquisite tasks of quantum computer technology.

arXiv:2111.07431•Nov 14, 2021•2 citations
This article is concerned with the construction of a quantum-mechanical Hamiltonian describing a computer. This Hamiltonian generates a dynamical evolution which mimics a sequence of elementary logical steps. This can be achieved if each logical step is locally reversible (global reversibility is insufficient). Computational errors due to noise can be corrected by means of redundancy. In particular, reversible error-correcting codes can be embedded in the Hamiltonian itself. An estimate is given for the minimum amount of entropy which must be dissipated at a given noise level and tolerated error rate.
The potential for scalable quantum computing depends on the viability of fault tolerance and quantum error correction, by which the entropy of environmental noise is removed during a quantum computation to maintain the physical reversibility of the computer’s logical qubits. However, the theory underlying quantum error correction applies a linguistic double standard to the words “noise” and “measurement” by treating environmental interactions during a quantum computation as inherently reversible, and environmental interactions at the end of a quantum computation as irreversible measurements. Specifically, quantum error correction theory models noise as interactions that are uncorrelated or that result in correlations that decay in space and/or time, thus embedding no permanent information to the environment. I challenge this assumption both on logical grounds and by discussing a hypothetical quantum computer based on “position qubits.” The technological difficulties of producing a useful scalable position-qubit quantum computer parallel the overwhelming difficulties in performing a double-slit interference experiment on an object comprising a million to a billion fermions.
The main ideas of quantum error correction are introduced. These are encoding, extraction of syndromes, error operators, and code construction. It is shown that general noise and relaxation of a set of 2-state quantum systems can always be understood as a combination of Pauli operators acting on the system. Each quantum error correcting code allows a subset of these errors to be corrected. In many situations the noise is such that the remaining uncorrectable errors are unlikely to arise, and hence quantum error correction has a high probability of success. In order to achieve the best noise tolerance in the presence of noise and imprecision throughout the computer, a hierarchical construction of a quantum computer is proposed.
This work presents a unified, deterministic framework for fault‑tolerant quantum computing based on Planck‑scale mimicry and systems‑logic orchestration. Within the Knight Evolutionary Cyclic Model (KECM) and the Cyclic Infinite Reversible Heat Engine (CIRHE) paradigm, spacetime is modeled as a discrete graviton‑flux lattice that updates at the Planck‑scale interval tₚ = Lₚ / c. Decoherence is reinterpreted as a timing‑misalignment artifact rather than an intrinsic quantum limitation: quantum states remain stable when their evolution is synchronized with the substrate’s discrete update rhythm and become unstable when they drift relative to it. The fine structure constant α is recast as a geometric and temporal governor that defines the allowable deviation from this update interval. This leads to the Hardened Qubit, a hardware‑intrinsic stability model in which coherence arises from geometric boundary conditions and timing alignment rather than software‑level error correction. Materials engineered to mimic the fixed‑wavelength graviton‑flux lattice can mechanically reject noise modes that do not match the α‑scaled timing structure, enabling fault tolerance without exponential redundancy. A Systems‑Logic Orchestration layer, inspired by General Systems Theory, provides self‑correcting parametric logic, entropy distillation, and reversible heat‑engine computation. Together, these mechanisms outline a deterministic, physically grounded pathway toward scalable quantum computing that aligns with the universe’s own information‑preserving dynamics.
We prove a fault-tolerance theorem for quantum computation against adversarial noise. For every quantum circuit on Nˉ\bar{N}Nˉ logical qudits of depth Tˉ\bar{T}Tˉ, we construct a fault-tolerant circuit on N=poly(Nˉ)N=\text{poly}(\bar{N})N=poly(Nˉ) physical qudits of depth Tˉ⋅Nˉo(1)\bar{T}\cdot\bar{N}^{o(1)}Tˉ⋅Nˉo(1), which is robust against an adversary who may arbitrarily choose and corrupt an almost-linear number N1−o(1)N^{1-o(1)}N1−o(1) of physical qudits at each time step. This robustness significantly improves upon prior fault-tolerance theorems, which assumed corruptions were either local and stochastic, or else only act on a polynomially vanishing fraction of qudits. Our fault-tolerance scheme addresses a key bottleneck towards constructing quantum PCPs via the circuit-to-Hamiltonian mapping of Anshu, Breuckmann, and Nguyen (STOC'24). More fundamentally, our result demonstrates that fault-tolerant quantum computation remains possible under noise models that are global, worst-case, and non-Markovian over the full duration of the computation, directly countering concerns that correlated noise could fundamentally undermine quantum fault tolerance. Our construction is based on a new family of subsystem product codes we develop, which have large dimension and distance along with low-weight parity-checks, and which support transversal non-Clifford gates. We show how to perform single-shot fault-tolerant error correction on these codes using a Floquet-like procedure based on the local testability of classical tensor codes. We then obtain a universal fault-tolerance scheme using repeated code switching in a hypercubic qudit architecture. Finally, we recursively compose our scheme with itself to reduce an initially exponential qudit dimension down to a constant.
This paper explores an approach to fault-tolerant quantum computing (FTQC), relying on quantum polar codes. We consider quantum polar codes of Calderbank-Shor-Steane type, encoding one logical qubit, which we refer to as Q1{\mathcal{Q}}_{1}Q1​ codes. First, we show that a subfamily of Q1{\mathcal{Q}}_{1}Q1​ codes is equivalent to the well-known family of Shor codes. Moreover, we show that Q1{\mathcal{Q}}_{1}Q1​ codes significantly outperform Shor codes, of the same length and minimum distance. Second, we consider the fault-tolerant preparation of Q1{\mathcal{Q}}_{1}Q1​ code states. We give a recursive procedure to prepare a Q1{\mathcal{Q}}_{1}Q1​ code state, based on two-qubit Pauli measurements only. The procedure is not by itself fault-tolerant; however, the measurement operations therein provide redundant classical bits, which can be advantageously used for error detection. Fault tolerance is then achieved by combining the proposed recursive procedure with an error detection method. Finally, we consider the fault-tolerant error correction of Q1{\mathcal{Q}}_{1}Q1​ codes. We use Steane error correction, which incorporates the proposed fault-tolerant code state preparation procedure. We provide numerical estimates of the logical error rates for Q1{\mathcal{Q}}_{1}Q1​ and Shor codes of length 16 and 64 qubits, assuming a circuit-level depolarizing noise model. Remarkably, the Q1{\mathcal{Q}}_{1}Q1​ code of length 64 qubits achieves a logical error rate very close to ${10}^{\ensuremath{-}6}$ for the physical error rate $p={10}^{\ensuremath{-}3}$, therefore demonstrating the potential of the proposed polar-codes-based approach to FTQC.
The relation between entropy and information has great significance for computation. Based on the strict reversibility of the laws of microphysics, Landauer (1961), Bennett (1973), Priese (1976), Fredkin and Toffoli (1982), Feynman (1985) and others envisioned a reversible computer that cannot allow any ambiguity in backward steps of a calculation. It is this backward capacity that makes reversible computing radically different from ordinary, irreversible computing. The proposal aims at a higher kind of computer that would give the actual output of a computation together with the original input, with the absence of a minimum energy requirement. Hence, information retrievability and energy efficiency due to diminished heat dissipation are the exquisite tasks of quantum computer technology.