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

Logics between classical reversible logic and quantum logic

Alexis De Vos, Stijn De Baerdemacker

Published Jan 1, 2012• 2 citations
OpenAlex

Abstract

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.

Related papers

When Abandoned Bits Bite Back - Reversibility and Quantum Computing

Paul Fitzpatrick

Reversible logic was originally proposed as a way to build classical computers with very low energy requirements. Its greatest impact so far has in fact been on the field of quantum computing, where it is used pervasively -- but for an entirely different purpose. Quantum interference effects offer the potential for speeding up certain classical calculations. But if state information is expelled from a quantum computer into the unmodeled environment -- as happens whenever an irreversible operation is performed -- then it becomes impossible to predict or control when interference will occur. Reversibility is necessary because it allows bits to be erased by uncomputing them rather than simply expelling them, preserving control over interference effects.

•Jan 1, 2002•0 citations

Performance evaluation of reversible logic gates

Umesh Kumar, Lavisha Sahu, Uma Kant Sharma

It has been realized that quantum computing is one of the latest technologies using reversible logic. It is observed that increasing growth of transistor density, power consumption will reach their limits in conventional technologies. In conventional Circuits during the logic operations bits of information is erased resulting dissipation of energy in significant amount. Thus, if Circuits are designed so that information bits can be preserved, the power use can be reduced. In case of reversible logic computation, the information bits are not lost. We can use reversible logic technology for minimizing the power consumption, heat dissipation, increasing speed etc. This paper describes various logic gates based on reversible logic like Toffoli, Peres, Fredkin, and Feynman etc. A comparative between classical and quantum logic gates is also given on various parameters along with limitations of conventional computing.

IEEE International Conference on ICT in Business Industry & Government (ICTBIG)•Jan 1, 2016•18 citations

Reversible logic

W. David Pan, M. Nalasani

This work presents the logical reversibility. The inputs and outputs of reversible logic gates can be uniquely retrievable from each other. The reversible logic operations can't erase information and dissipate zero heat. The circuit actually operates in a backward operation, allows reproducing the inputs from the outputs and consumes zero power. As the basic elements of any logic circuit, logic gates are used to realize Boolean functions. By combining reversible logic gates, reversible circuits can perform complex logical and arithmetic operations. A one-to-one mapping between inputs and outputs is realized. The logical operations run backwards by cascading a reversible logic gate with its dual (inverse). Reversible circuits are also called lossless circuits, as there is neither energy loss nor information loss. These circuits are very attractive for applications where extremely low power consumption, or heat dissipation, is desirable in areas ranging from communications, low power VLSI (very large-scale integration) technology, optical computing to nanotechnology. Reversible logic found to be very useful in quantum computing where the quantum evolution is inherently reversible.

IEEE Potentials•Feb 1, 2005•56 citations

Reversible Computing and Quantum Computing

Hervé Fanet

This chapter provides reversible computing; allowing people to define the different reversible logic gate families, as well as the basic elements for synthesizing reversible logic architectures. The subject may seem complicated, but it will also be new for many peoples, as this approach is neither well known nor taught often. The people will no doubt find the mathematical richness of these concepts introduced, as well as by the contribution that group theory has made to synthesizing reversible logic architectures very useful. Quantum computing has points in common with reversible computing, especially when people think of descriptive mathematical tools and synthesis methods. However, it is fundamentally different because it does not manipulate 0 and 1 matrix elements like reversible computing, but uses more complex matrices. In order to illustrate this property, this is a huge part of quantum computing, let people use the example of Grover's algorithm.

Wiley eBooks•Aug 30, 2016•0 citations

Reversible Computing Foundations in Quantum Computation: From Classical Logic to Quantum Algorithms

Keval Barvaliya

Reversible computing provides a foundational framework for understanding quantum computation.This paper first examines classical reversible logic gates, including the CNOT and Toffoli gates, and demonstrates how they can simulate arbitrary Boolean functions.We then extend these concepts to quantum gates and circuits, where all operations are inherently unitary and reversible.Quantum algorithms such as the Deutsch-Jozsa algorithm, phase estimation, and Shor's factoring algorithm are discussed to illustrate how reversibility enables exponential computational speedups.Finally, current challenges and future directions in quantum hardware and algorithm design are presented.Highlighting the essential role of reversible computing in the realisation of practical quantum computers.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2026•3 citations

Insights into classical irreversible computation using quantum information concepts

Berry Groisman

The method of using concepts and insight from quantum information theory in order to solve problems in reversible classical computing (introduced in Ref. [1]) have been generalized to irreversible classical computing. The method have been successfully tested on two computational tasks. Several basic logic gates have been analyzed and the nonlocal content of the associate quantum transformations have been calculated. The results provide us with new interesting insight into the notion of complexity of logic operations.

arXiv:0810.3710•Oct 21, 2008•0 citations
Reversible logic was originally proposed as a way to build classical computers with very low energy requirements. Its greatest impact so far has in fact been on the field of quantum computing, where it is used pervasively -- but for an entirely different purpose. Quantum interference effects offer the potential for speeding up certain classical calculations. But if state information is expelled from a quantum computer into the unmodeled environment -- as happens whenever an irreversible operation is performed -- then it becomes impossible to predict or control when interference will occur. Reversibility is necessary because it allows bits to be erased by uncomputing them rather than simply expelling them, preserving control over interference effects.
It has been realized that quantum computing is one of the latest technologies using reversible logic. It is observed that increasing growth of transistor density, power consumption will reach their limits in conventional technologies. In conventional Circuits during the logic operations bits of information is erased resulting dissipation of energy in significant amount. Thus, if Circuits are designed so that information bits can be preserved, the power use can be reduced. In case of reversible logic computation, the information bits are not lost. We can use reversible logic technology for minimizing the power consumption, heat dissipation, increasing speed etc. This paper describes various logic gates based on reversible logic like Toffoli, Peres, Fredkin, and Feynman etc. A comparative between classical and quantum logic gates is also given on various parameters along with limitations of conventional computing.
This work presents the logical reversibility. The inputs and outputs of reversible logic gates can be uniquely retrievable from each other. The reversible logic operations can't erase information and dissipate zero heat. The circuit actually operates in a backward operation, allows reproducing the inputs from the outputs and consumes zero power. As the basic elements of any logic circuit, logic gates are used to realize Boolean functions. By combining reversible logic gates, reversible circuits can perform complex logical and arithmetic operations. A one-to-one mapping between inputs and outputs is realized. The logical operations run backwards by cascading a reversible logic gate with its dual (inverse). Reversible circuits are also called lossless circuits, as there is neither energy loss nor information loss. These circuits are very attractive for applications where extremely low power consumption, or heat dissipation, is desirable in areas ranging from communications, low power VLSI (very large-scale integration) technology, optical computing to nanotechnology. Reversible logic found to be very useful in quantum computing where the quantum evolution is inherently reversible.
This chapter provides reversible computing; allowing people to define the different reversible logic gate families, as well as the basic elements for synthesizing reversible logic architectures. The subject may seem complicated, but it will also be new for many peoples, as this approach is neither well known nor taught often. The people will no doubt find the mathematical richness of these concepts introduced, as well as by the contribution that group theory has made to synthesizing reversible logic architectures very useful. Quantum computing has points in common with reversible computing, especially when people think of descriptive mathematical tools and synthesis methods. However, it is fundamentally different because it does not manipulate 0 and 1 matrix elements like reversible computing, but uses more complex matrices. In order to illustrate this property, this is a huge part of quantum computing, let people use the example of Grover's algorithm.
Reversible computing provides a foundational framework for understanding quantum computation.This paper first examines classical reversible logic gates, including the CNOT and Toffoli gates, and demonstrates how they can simulate arbitrary Boolean functions.We then extend these concepts to quantum gates and circuits, where all operations are inherently unitary and reversible.Quantum algorithms such as the Deutsch-Jozsa algorithm, phase estimation, and Shor's factoring algorithm are discussed to illustrate how reversibility enables exponential computational speedups.Finally, current challenges and future directions in quantum hardware and algorithm design are presented.Highlighting the essential role of reversible computing in the realisation of practical quantum computers.
The method of using concepts and insight from quantum information theory in order to solve problems in reversible classical computing (introduced in Ref. [1]) have been generalized to irreversible classical computing. The method have been successfully tested on two computational tasks. Several basic logic gates have been analyzed and the nonlocal content of the associate quantum transformations have been calculated. The results provide us with new interesting insight into the notion of complexity of logic operations.