Classical Reversible Computation by Quantum Coherence
Abstract
Rising energy demand from data-center and AI applications has renewed interest in reversible computation, where logic need not dissipate heat at every step if information is uncomputed. Implementations have so far been classical: adiabatic CMOS recovers part of the switching energy but still moves thousands of kBT per logic node at room temperature. Here we propose classical reversible logic implemented by coherent spin dynamics in a spin quantum-dot array, with inputs and outputs in classical basis states and no algorithmic use of superposition. The same spin stores, transports, and computes, with unitary rotation replacing irreversible switching. The universal building block is an iToffoli gate driven by DC voltage pulses and exchange between hole spins in Ge/SiGe quantum dots. Simulations with realistic model parameters reproduce the Toffoli truth table and yield a testable error landscape. Because shuttling transports the bit without measurement, logic and data movement remain unitary until readout. Millivolt pulses on femtofarad gates with superconducting lines dissipate only dielectric loss and have no thermodynamic floor. With the loss parameters assumed for a demonstrated device the gate energy is ∼ 102 kBTln 2 at 4 K; at a design point within reach of existing devices it can fall below the Landauer scale kBTln 2, five to seven orders of magnitude less than a CMOS Toffoli. The same semiconductor hardware therefore serves both purposes, supporting quantum algorithms when superposition is used and classical reversible logic otherwise.
Related
- HTM: A Hybrid Classical-Quantum Computation Model
- The Breakdown of Classical Minicrypt Equivalences in the Quantum-Computation Classical-Communication Model
- QRecoupling.jl: numerical and exact computation of classical and quantum recoupling coefficients
- Disorder-driven loss of crystalline coherence in two-dimensional electron solids: Quantum Hartree-Fock and classical molecular dynamics
- Induced Coherence in Quantum and Classical Interferometry: Origin and Control
BibTeX
@misc{loss2026classical,
title = {{Classical Reversible Computation by Quantum Coherence}},
author = {Daniel Loss},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2607.06219},
eprint = {2607.06219},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.06219},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Classical Reversible Computation by Quantum Coherence
AU - Daniel Loss
PY - 2026
DA - 2026/10/04
PB - arXiv
DO - 10.48550/arxiv.2607.06219
UR - https://arxiv.org/abs/2607.06219
AB - Rising energy demand from data-center and AI applications has renewed interest in reversible computation, where logic need not dissipate heat at every step if information is uncomputed. Implementations have so far been classical: adiabatic CMOS recovers part of the switching energy but still moves thousands of k_BT per logic node at room temperature. Here we propose classical reversible logic implemented by coherent spin dynamics in a spin quantum-dot array, with inputs and outputs in classical basis states and no algorithmic use of superposition. The same spin stores, transports, and computes, with unitary rotation replacing irreversible switching. The universal building block is an iToffoli gate driven by DC voltage pulses and exchange between hole spins in Ge/SiGe quantum dots. Simulations with realistic model parameters reproduce the Toffoli truth table and yield a testable error landscape. Because shuttling transports the bit without measurement, logic and data movement remain unitary until readout. Millivolt pulses on femtofarad gates with superconducting lines dissipate only dielectric loss and have no thermodynamic floor. With the loss parameters assumed for a demonstrated device the gate energy is ∼ 10^2 k_BTln 2 at 4 K; at a design point within reach of existing devices it can fall below the Landauer scale k_BTln 2, five to seven orders of magnitude less than a CMOS Toffoli. The same semiconductor hardware therefore serves both purposes, supporting quantum algorithms when superposition is used and classical reversible logic otherwise.
ER -