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

Springer eBooks

Classical and Reversible Computation

Osama M. Raisuddin, Suvranu De

Published Nov 14, 2025• 0 citations
Publisher
DOI
10.1007/978-3-032-03325-3_12

Related papers

Quantum reversibility and a new model of quantum automaton

Massimo Pica Ciamarra

This article is an attempt to generalize the classical theory of reversible computing, principally developed by Bennet [IBM J. Res. Develop., 17(1973)] and by Fredkin and Toffoli [Internat. J. Theoret. Phys., 21(1982)], to the quantum case. This is a fundamental step towards the construction of a quantum computer because a time efficient quantum computation is a reversible physical process. The paper is organized as follows. The first section reviews the classical theory of reversible computing. In the second section it is showed that the designs used in the classical framework to decrease the consumption of space cannot be generalized to the quantum case; it is also suggested that quantum computing is generally more demanding of space than classical computing. In the last section a new model of fully quantum and reversible automaton is proposed. The computational power of this automaton is at least equal to that of classical automata. Some conclusion are drawn in the last section.

arXiv:quant-ph/0102104•Feb 21, 2001•1 citation

Classical computation

A. Kitaev, Alexander Khanievich Shen', M. Vyalyi

Graduate studies in mathematics•May 31, 2002•1 citation

A Critical Assessment of Reversible Computing’s Role in the Quantum Advantage Narrative

White Elijah

Reversibility is one of the most frequently invoked ideas in the public and scholarly narrative around quantum computational advantage. It is cited to explain why quantum computers can outperform classical ones, why they might be energy efficient, and why classical hardware may or may not be able to compete. This paper asks which of these claims survive scrutiny. It separates three senses of reversibility that are often run together: logical reversibility (a computation that preserves information), thermodynamic reversibility (a physical process that approaches zero dissipation), and unitary reversibility (the invertible evolution of an isolated quantum system). The paper then traces four channels through which reversibility enters the quantum advantage discussion: historical lineage, algorithm and circuit engineering, energy accounting, and competition from reversible classical hardware. It assesses six recurring claims against an explicit evidence ladder. The assessment finds that reversibility is not the source of quantum advantage, because reversible classical machines are no more powerful than irreversible ones. Unitarity is necessary only in the idealized circuit model, not in every physical architecture. Reversible-computing theory contributes substantially and credibly to quantum circuit engineering, especially in arithmetic, ancilla management, and uncomputation. Claims that quantum computers are energy efficient because they are reversible are not supported by the current literature, since measurement, reset, error correction, and cryogenic and classical control infrastructure are irreversible and dominate the energy budget.

•Oct 30, 2026•0 citations

Elements of Classical Computation

Springer eBooks•Feb 2, 2007•0 citations

Logics between classical reversible logic and quantum logic

Alexis De Vos, Stijn De Baerdemacker

Classical reversible logic and quantum computing share the common feature that all computations are reversible, each result of a computation can be brought back to the initial state without loss of information.

•Jan 1, 2012•2 citations

Introduction to Classical Computation

WORLD SCIENTIFIC eBooks•Apr 1, 2004•1 citation
This article is an attempt to generalize the classical theory of reversible computing, principally developed by Bennet [IBM J. Res. Develop., 17(1973)] and by Fredkin and Toffoli [Internat. J. Theoret. Phys., 21(1982)], to the quantum case. This is a fundamental step towards the construction of a quantum computer because a time efficient quantum computation is a reversible physical process. The paper is organized as follows. The first section reviews the classical theory of reversible computing. In the second section it is showed that the designs used in the classical framework to decrease the consumption of space cannot be generalized to the quantum case; it is also suggested that quantum computing is generally more demanding of space than classical computing. In the last section a new model of fully quantum and reversible automaton is proposed. The computational power of this automaton is at least equal to that of classical automata. Some conclusion are drawn in the last section.
Reversibility is one of the most frequently invoked ideas in the public and scholarly narrative around quantum computational advantage. It is cited to explain why quantum computers can outperform classical ones, why they might be energy efficient, and why classical hardware may or may not be able to compete. This paper asks which of these claims survive scrutiny. It separates three senses of reversibility that are often run together: logical reversibility (a computation that preserves information), thermodynamic reversibility (a physical process that approaches zero dissipation), and unitary reversibility (the invertible evolution of an isolated quantum system). The paper then traces four channels through which reversibility enters the quantum advantage discussion: historical lineage, algorithm and circuit engineering, energy accounting, and competition from reversible classical hardware. It assesses six recurring claims against an explicit evidence ladder. The assessment finds that reversibility is not the source of quantum advantage, because reversible classical machines are no more powerful than irreversible ones. Unitarity is necessary only in the idealized circuit model, not in every physical architecture. Reversible-computing theory contributes substantially and credibly to quantum circuit engineering, especially in arithmetic, ancilla management, and uncomputation. Claims that quantum computers are energy efficient because they are reversible are not supported by the current literature, since measurement, reset, error correction, and cryogenic and classical control infrastructure are irreversible and dominate the energy budget.