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

Classical Reversible Computation by Quantum Coherence

Daniel Loss

cond-mat.mes-hallquant-phSubmitted Jul 7, 2026• Announced Jul 8, 2026• 1 citation• Revised Jul 20, 2026 (v3)
v1 · Jul 7, 2026v2 · Jul 9, 2026v3 · Jul 20, 2026v4 · Oct 4, 2026
arXivHTMLPDF

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 reduces dissipation by slowing charge motion but is still limited by the threshold physics of transistors. 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 anisotropic exchange in Ge/Si hole spins. Simulations with experimental parameters reproduce the Toffoli truth table and yield a testable error landscape. Because shuttling transports the bit without measurement, logic and data movement remain reversible until readout. Millivolt pulses on femtofarad gates yield a gate energy below the 4 K Landauer scale, about five (eight) orders of magnitude below a room-temperature CMOS Toffoli with (without) 4 K cooling overhead. The same semiconductor hardware is therefore dual-use, supporting quantum algorithms when superposition is used and classical reversible logic otherwise.

Comments
52-page Supplementary Information attached as ancillary file. v3: adds a one-bit reversible adder, an energy analysis of the classical control electronics, and shorter optimized pulse sequences

Related papers

Classical Computation by Quantum Bits

Bobby Antonio, J. Randall, W. K. Hensinger +2 more

Atomic-scale logic and the minimization of heating (dissipation) are both very high on the agenda for future computation hardware. An approach to achieve these would be to replace networks of transistors directly by classical reversible logic gates built from the coherent dynamics of a few interacting atoms. As superpositions are unnecessary before and after each such gate (inputs and outputs are bits), the dephasing time only needs to exceed a single gate operation time, while fault tolerance should be achieved with low overhead, by classical coding. Such gates could thus be a spin-off of quantum technology much before full-scale quantum computation. Thus motivated, we propose methods to realize the 3-bit Toffoli and Fredkin gates universal for classical reversible logic using a single time-independent 3-qubit Hamiltonian with realistic nearest neighbour two-body interactions. We also exemplify how these gates can be composed to make a larger circuit. We show that trapped ions may soon be scalable simulators for such architectures, and investigate the prospects with dopants in silicon.

arXiv:1509.03420•Sep 11, 2015•7 citations

STUDY AND REALIZATION OF SIMPLE QUANTUM GATES

Lavanya Ravala, S. Vishnu Priya, G .V. Sujitha +2 more

Quantum computing represents a paradigm shift in computation by leveraging the principles of quantum mechanics such as superposition, entanglement, and interference to perform operations beyond classical limitations. Unlike classical computing systems that rely on irreversible logic operations and suffer from energy dissipation due to information loss, quantum systems utilize reversible unitary transformations that preserve information and improve computational efficiency. This paper presents a comprehensive framework for the design, simulation, and validation of quantum gates and reversible arithmetic circuits, including half adders and half subtractors. The proposed approach systematically maps classical arithmetic logic into quantum circuits using fundamental quantum gates such as Pauli-X, Hadamard, Controlled-NOT (CNOT), and Toffoli gates. The circuits are implemented and simulated using the Qiskit Aer framework, enabling detailed analysis of quantum state evolution and measurement outputs. The results obtained from simulation include program-level outputs, state vector representations, measurement counts, and probability distributions, all of which demonstrate strong agreement with classical truth tables. The analysis confirms the correctness, reversibility, and scalability of the proposed designs. Furthermore, a comparative performance evaluation highlights the advantages of quantum computing over classical approaches in terms of parallelism and energy efficiency. The proposed framework establishes a robust foundation for future implementation of complex Boolean logic and arithmetic operations in quantum systems.

International Journal of Novel Research and Development•Apr 1, 2026•0 citations

Reversible Gates Using Quantum Phase Slip Junctions, Part A: Logical Reversible Design

Azam Malekpoor, Seyed Amir Hashemi, Satyabrata Jit

Quantum phase slip junction (QPSJ) can offer very low power switching operation and represent near adiabatic switching operation for using in designing of the reversible logic gates. The reversible gates have logical reversibility, where the inputs can be logically reconstructed from the outputs and no data is lost, and physical (adiabatic) reversibility, where the energy dissipation can be decreased even below the Landauer limit. In this manuscript, for the first time, designing of the QPSJ-based basic reversible gates, namely Feynman, Toffoli, Peres and Fredkin, from the logical reversibility point of view is represented. The main logic function in these gates is the XOR function. First, a new two-input QPSJ-based XOR gate with simple circuit is designed in which the outputs of the previous gate can be connected directly to its inputs without the need for splitter lines. Second, the proposed XOR gate is used to design the Feynman and Toffoli gates. Further, the Peres and Fredkin gates are designed by using the proposed Feynman and Toffoli gates. Proper operation of the proposed gates are verified by simulation results. Logical reversibility of the Feynman and Toffoli gates is verified by cascading them and operating their logical function two times, i.e.f(f(x))=x.

IEEE Transactions on Applied Superconductivity•Mar 25, 2024•1 citation

Single spin Toffoli–Fredkin logic gate

Amit Ranjan Trivedi, Supriyo Bandyopadhyay

The Toffoli–Fredkin (TF) gate is a universal reversible logic gate capable of performing logic operations without dissipating energy. Here, we show that a linear array of three quantum dots, each hosting a single electron, can realize the TF gate, if we encode logic bits in the spin polarization of the electrons and allow nearest neighbor exchange coupling. The dynamics of the TF gate is realized by selectively driving spin resonances in the coupled spin system with an ac magnetic field. The conditions for gate operation are established, and an estimate of the switching speed and gate error are provided.

Journal of Applied Physics•May 15, 2008•9 citations

Low power quantum gates for the implementation of reversible memory elements using quantum dot cellular automata

Samyukta A Hassan, Preeta Sharan

Energy can neither be created nor be destroyed but it can be conserved. The processors of present day computers are designed using conventional logic circuits which are irreversible in nature. They suffer from loss of information during computation, leading to energy dissipation in the form of heat affecting the performance and life of the circuits. These limitations of conventional logic circuits can be overcome by the reversible logic circuits designed using quantum gates, the essential elements for quantum computing. Quantum computing is an emerging area of research which finds application in optical computing, DNA computing, cryptography, low power CMOS design, digital signal processing and nanotechnology.

International Conference on Computing for Sustainable Global Development•Mar 16, 2016•4 citations

Reversible Fluxon Logic for Future Computing

Kevin D. Osborn, Waltraut Wustmann

Today's industrial digital logic gates are reaching a technological limit and meanwhile, superconducting circuits produce fundamentally different technologies for the future of digital computing. The standard logic is irreversible and yet superconducting circuits allow digital reversible logic with a much higher energy efficiency per gate operation. Previous reversible gate circuits were “adiabatic,” meaning that they used adiabatic-clocking waveforms for their operation power. However, we are studying logic starting from a ballistic model, where ftuxons enable gates using only energy from their inertia. Our ftuxons are defined in Long Josephson Junctions (LJJs) and may travel ballistically, similar to a particle with negligible damping. Once a ftuxon's energy approaches close enough to the gate, a resonance is induced at the gate and the ftuxon loses its definite topology. Gates are comprised of the (few Josephson-penetration-depth long) ends of LJJs and a connecting circuit interface. Only after the resonance does a ftuxon get formed and yield the gate result without external power: a ftuxon for bit-state 0 or an antiftuxon for bit-state 1. Through earlier analysis of the numerically discovered phenomena we find that dynamics can be described with ftuxon- and antiftuxon-like excitations at the ends of LJJs within the gate. The bit-switching action in our gates is resonant indicating fundamentally different dynamics than the classic model of adiabatic reversible circuits. Our ballistic Reversible Fluxon Logic (RFL) gates have no added damping and calculated energy efficiencies of over 97%. Thus in our dynamical process the “bit energy” is preserved. However, irreversible logic completely dissipates this at each operation (e.g., charging energy in CMOS or SFQ energy in irreversible SFQ logic). An RFL gate can achieve a fast gate operation since its resonance is only few JJ plasma periods. We also describe the CNOT in our technology. It is enabled by a couple of vital gates: A IDSN logic gate, similar to our other ballistic gates, and a Store-aNd-Launch (SNL) timing gate to ensure proper synchronization of the bits. The latter allows bit storage followed by launching of a data ftuxon using an adiabatic pulse from a clock ftuxon with lower energy than the data ftuxon for good CNOT efficiency.

IEEE International Superconductive Electronics Conference (ISEC)•Jul 1, 2019•5 citations
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 reduces dissipation by slowing charge motion but is still limited by the threshold physics of transistors. 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 anisotropic exchange in Ge/Si hole spins. Simulations with experimental parameters reproduce the Toffoli truth table and yield a testable error landscape. Because shuttling transports the bit without measurement, logic and data movement remain reversible until readout. Millivolt pulses on femtofarad gates yield a gate energy below the 4 K Landauer scale, about five (eight) orders of magnitude below a room-temperature CMOS Toffoli with (without) 4 K cooling overhead. The same semiconductor hardware is therefore dual-use, supporting quantum algorithms when superposition is used and classical reversible logic otherwise.
Atomic-scale logic and the minimization of heating (dissipation) are both very high on the agenda for future computation hardware. An approach to achieve these would be to replace networks of transistors directly by classical reversible logic gates built from the coherent dynamics of a few interacting atoms. As superpositions are unnecessary before and after each such gate (inputs and outputs are bits), the dephasing time only needs to exceed a single gate operation time, while fault tolerance should be achieved with low overhead, by classical coding. Such gates could thus be a spin-off of quantum technology much before full-scale quantum computation. Thus motivated, we propose methods to realize the 3-bit Toffoli and Fredkin gates universal for classical reversible logic using a single time-independent 3-qubit Hamiltonian with realistic nearest neighbour two-body interactions. We also exemplify how these gates can be composed to make a larger circuit. We show that trapped ions may soon be scalable simulators for such architectures, and investigate the prospects with dopants in silicon.
Quantum computing represents a paradigm shift in computation by leveraging the principles of quantum mechanics such as superposition, entanglement, and interference to perform operations beyond classical limitations. Unlike classical computing systems that rely on irreversible logic operations and suffer from energy dissipation due to information loss, quantum systems utilize reversible unitary transformations that preserve information and improve computational efficiency. This paper presents a comprehensive framework for the design, simulation, and validation of quantum gates and reversible arithmetic circuits, including half adders and half subtractors. The proposed approach systematically maps classical arithmetic logic into quantum circuits using fundamental quantum gates such as Pauli-X, Hadamard, Controlled-NOT (CNOT), and Toffoli gates. The circuits are implemented and simulated using the Qiskit Aer framework, enabling detailed analysis of quantum state evolution and measurement outputs. The results obtained from simulation include program-level outputs, state vector representations, measurement counts, and probability distributions, all of which demonstrate strong agreement with classical truth tables. The analysis confirms the correctness, reversibility, and scalability of the proposed designs. Furthermore, a comparative performance evaluation highlights the advantages of quantum computing over classical approaches in terms of parallelism and energy efficiency. The proposed framework establishes a robust foundation for future implementation of complex Boolean logic and arithmetic operations in quantum systems.
Quantum phase slip junction (QPSJ) can offer very low power switching operation and represent near adiabatic switching operation for using in designing of the reversible logic gates. The reversible gates have logical reversibility, where the inputs can be logically reconstructed from the outputs and no data is lost, and physical (adiabatic) reversibility, where the energy dissipation can be decreased even below the Landauer limit. In this manuscript, for the first time, designing of the QPSJ-based basic reversible gates, namely Feynman, Toffoli, Peres and Fredkin, from the logical reversibility point of view is represented. The main logic function in these gates is the XOR function. First, a new two-input QPSJ-based XOR gate with simple circuit is designed in which the outputs of the previous gate can be connected directly to its inputs without the need for splitter lines. Second, the proposed XOR gate is used to design the Feynman and Toffoli gates. Further, the Peres and Fredkin gates are designed by using the proposed Feynman and Toffoli gates. Proper operation of the proposed gates are verified by simulation results. Logical reversibility of the Feynman and Toffoli gates is verified by cascading them and operating their logical function two times, i.e.f(f(x))=x.
The Toffoli–Fredkin (TF) gate is a universal reversible logic gate capable of performing logic operations without dissipating energy. Here, we show that a linear array of three quantum dots, each hosting a single electron, can realize the TF gate, if we encode logic bits in the spin polarization of the electrons and allow nearest neighbor exchange coupling. The dynamics of the TF gate is realized by selectively driving spin resonances in the coupled spin system with an ac magnetic field. The conditions for gate operation are established, and an estimate of the switching speed and gate error are provided.
Energy can neither be created nor be destroyed but it can be conserved. The processors of present day computers are designed using conventional logic circuits which are irreversible in nature. They suffer from loss of information during computation, leading to energy dissipation in the form of heat affecting the performance and life of the circuits. These limitations of conventional logic circuits can be overcome by the reversible logic circuits designed using quantum gates, the essential elements for quantum computing. Quantum computing is an emerging area of research which finds application in optical computing, DNA computing, cryptography, low power CMOS design, digital signal processing and nanotechnology.
Today's industrial digital logic gates are reaching a technological limit and meanwhile, superconducting circuits produce fundamentally different technologies for the future of digital computing. The standard logic is irreversible and yet superconducting circuits allow digital reversible logic with a much higher energy efficiency per gate operation. Previous reversible gate circuits were “adiabatic,” meaning that they used adiabatic-clocking waveforms for their operation power. However, we are studying logic starting from a ballistic model, where ftuxons enable gates using only energy from their inertia. Our ftuxons are defined in Long Josephson Junctions (LJJs) and may travel ballistically, similar to a particle with negligible damping. Once a ftuxon's energy approaches close enough to the gate, a resonance is induced at the gate and the ftuxon loses its definite topology. Gates are comprised of the (few Josephson-penetration-depth long) ends of LJJs and a connecting circuit interface. Only after the resonance does a ftuxon get formed and yield the gate result without external power: a ftuxon for bit-state 0 or an antiftuxon for bit-state 1. Through earlier analysis of the numerically discovered phenomena we find that dynamics can be described with ftuxon- and antiftuxon-like excitations at the ends of LJJs within the gate. The bit-switching action in our gates is resonant indicating fundamentally different dynamics than the classic model of adiabatic reversible circuits. Our ballistic Reversible Fluxon Logic (RFL) gates have no added damping and calculated energy efficiencies of over 97%. Thus in our dynamical process the “bit energy” is preserved. However, irreversible logic completely dissipates this at each operation (e.g., charging energy in CMOS or SFQ energy in irreversible SFQ logic). An RFL gate can achieve a fast gate operation since its resonance is only few JJ plasma periods. We also describe the CNOT in our technology. It is enabled by a couple of vital gates: A IDSN logic gate, similar to our other ballistic gates, and a Store-aNd-Launch (SNL) timing gate to ensure proper synchronization of the bits. The latter allows bit storage followed by launching of a data ftuxon using an adiabatic pulse from a clock ftuxon with lower energy than the data ftuxon for good CNOT efficiency.