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:quant-ph/0403079

Are all reversible computations tidy?

O. J. E. Maroney

Published Mar 10, 2004• 2 citations
arXivHTMLPDF

Abstract

It has long been known that to minimise the heat emitted by a deterministic computer during it's operation it is necessary to make the computation act in a logically reversible manner\cite{Lan61}. Such logically reversible operations require a number of auxiliary bits to be stored, maintaining a history of the computation, and which allows the initial state to be reconstructed by running the computation in reverse. These auxiliary bits are wasteful of resources and may require a dissipation of energy for them to be reused. A simple procedure due to Bennett\cite{Ben73} allows these auxiliary bits to be "tidied", without dissipating energy, on a classical computer. All reversible classical computations can be made tidy in this way. However, this procedure depends upon a classical operation ("cloning") that cannot be generalised to quantum computers\cite{WZ82}. Quantum computations must be logically reversible, and therefore produce auxiliary qbits during their operation. We show that there are classes of quantum computation for which Bennett's procedure cannot be implemented. For some of these computations there may exist another method for which the computation may be "tidied". However, we also show there are quantum computations for which there is no possible method for tidying the auxiliary qbits. Not all reversible quantum computations can be made "tidy". This represents a fundamental additional energy burden to quantum computations. This paper extends results in \cite{Mar01}.

DOI
10.48550/arxiv.quant-ph/0403079

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

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

Introduction to classical computation

This chapter introduces the basic concepts of computer science that are necessary for an understanding of quantum computation and information. We discuss the Turing machine, the fundamental model of computation since it formalizes the intuitive notion of an algorithm: if there exists an algorithm to solve a given problem, then this algorithm can be run on a Turing machine. We then introduce the circuit model of computation, which is equivalent to the Turing machine model but is nearer to real computers. In this model, the information is carried by wires and a small set of elementary logical operations (gates) allows implementation of any complex computation. It is important to find the minimum resources (computer memory, time and energy) required to solve a given problem with the best possible algorithm. This is the task of computational complexity, for which we provide a quick glance at the key concepts. We also examine the energy resources necessary to perform computations. Here we discuss the relation between energy and information, which was explained by Landauer and Bennett in their solution of Maxwell’s demon paradox. In particular, Landauer’s principle sets the minimum energy requirements for irreversible computation. On the other hand, it turns out that it is, in principle, possible to perform any complex computation by means of reversible gates, without energy dissipation. A concrete model of reversible computation, the so-called billiard-ball computer, is briefly discussed. Finally, we address the problem of energy dissipation in a real computation and show how it may be managed using reversible computation techniques.

WORLD SCIENTIFIC eBooks•Dec 1, 2018•0 citations

Schumacher’s quantum data compression as a quantum computation

Richard Cleve, David Peter Divincenzo

An explicit algorithm for performing Schumacher's noiseless compression of quantum bits is given. This algorithm is based on a combinatorial expression for a particular bijection among binary strings. The algorithm, which adheres to the rules of reversible programming, is expressed in a high-level pseudocode language. It is implemented using O(${\mathit{n}}^{3}$) two- and three-bit primitive reversible operations, where n is the length of the qubit strings to be compressed. Also, the algorithm makes use of O(n) auxiliary qubits. Space-saving techniques based on those proposed by Bennett are developed which reduce this workspace to O(\ensuremath{\surd}n) while maintaining a running time of O(${\mathit{n}}^{3}$) (albeit with a larger constant). This latter algorithm is of interest because it has a slightly smaller time-space product, which is considered to be the relevant figure of merit for efficiency in some physical models. \textcopyright{} 1996 The American Physical Society.

arXiv:quant-ph/9603009•Physical Review A•Oct 1, 1996•52 citations

Classical and Quantum Operation Modes of the Reversible Josephson-Junction Logic Circuits

Vasili K. Semenov, G.V. Danilov, D. V. Averin

One of the most important features of the quantum computing circuits that distinguishes them from the traditional computational models is their full, physical and logical, reversibility at all stages of the calculations. This makes the large-scale architecture of potential quantum and classical reversible computers quite similar. The goal of this work is to analyze this similarity in the case of reversible superconducting logic circuits based on the recently suggested elementary gate, the nSQUID. Specifically, we present the results of numerical simulations and some limited measurements of a reversible 8-bit circular shift register fabricated at HYPRES, Inc., and working in the classical mode. The measured energy dissipation per bit operation per nSQUID is still about 20 times higher than the thermodynamic reversibility threshold of kBTIn 2 at T ap 4 K. We also discuss qualitatively operation of the reversible circuits of galvan- ically-coupled nSQUIDs in the quantum mode which provides the basis for implementation of "flying" superconducting qubits. Such qubits have several attractive features for Josephson-junction quantum logic devices beyond the single- or two-qubit circuits.

IEEE Transactions on Applied Superconductivity•Jun 1, 2007•36 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
It has long been known that to minimise the heat emitted by a deterministic computer during it's operation it is necessary to make the computation act in a logically reversible manner\cite{Lan61}. Such logically reversible operations require a number of auxiliary bits to be stored, maintaining a history of the computation, and which allows the initial state to be reconstructed by running the computation in reverse. These auxiliary bits are wasteful of resources and may require a dissipation of energy for them to be reused. A simple procedure due to Bennett\cite{Ben73} allows these auxiliary bits to be "tidied", without dissipating energy, on a classical computer. All reversible classical computations can be made tidy in this way. However, this procedure depends upon a classical operation ("cloning") that cannot be generalised to quantum computers\cite{WZ82}. Quantum computations must be logically reversible, and therefore produce auxiliary qbits during their operation. We show that there are classes of quantum computation for which Bennett's procedure cannot be implemented. For some of these computations there may exist another method for which the computation may be "tidied". However, we also show there are quantum computations for which there is no possible method for tidying the auxiliary qbits. Not all reversible quantum computations can be made "tidy". This represents a fundamental additional energy burden to quantum computations. This paper extends results in \cite{Mar01}.
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.
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.
This chapter introduces the basic concepts of computer science that are necessary for an understanding of quantum computation and information. We discuss the Turing machine, the fundamental model of computation since it formalizes the intuitive notion of an algorithm: if there exists an algorithm to solve a given problem, then this algorithm can be run on a Turing machine. We then introduce the circuit model of computation, which is equivalent to the Turing machine model but is nearer to real computers. In this model, the information is carried by wires and a small set of elementary logical operations (gates) allows implementation of any complex computation. It is important to find the minimum resources (computer memory, time and energy) required to solve a given problem with the best possible algorithm. This is the task of computational complexity, for which we provide a quick glance at the key concepts. We also examine the energy resources necessary to perform computations. Here we discuss the relation between energy and information, which was explained by Landauer and Bennett in their solution of Maxwell’s demon paradox. In particular, Landauer’s principle sets the minimum energy requirements for irreversible computation. On the other hand, it turns out that it is, in principle, possible to perform any complex computation by means of reversible gates, without energy dissipation. A concrete model of reversible computation, the so-called billiard-ball computer, is briefly discussed. Finally, we address the problem of energy dissipation in a real computation and show how it may be managed using reversible computation techniques.
An explicit algorithm for performing Schumacher's noiseless compression of quantum bits is given. This algorithm is based on a combinatorial expression for a particular bijection among binary strings. The algorithm, which adheres to the rules of reversible programming, is expressed in a high-level pseudocode language. It is implemented using O(n3{\mathit{n}}^{3}n3) two- and three-bit primitive reversible operations, where n is the length of the qubit strings to be compressed. Also, the algorithm makes use of O(n) auxiliary qubits. Space-saving techniques based on those proposed by Bennett are developed which reduce this workspace to O(\ensuremath{\surd}n) while maintaining a running time of O(n3{\mathit{n}}^{3}n3) (albeit with a larger constant). This latter algorithm is of interest because it has a slightly smaller time-space product, which is considered to be the relevant figure of merit for efficiency in some physical models. \textcopyright{} 1996 The American Physical Society.
One of the most important features of the quantum computing circuits that distinguishes them from the traditional computational models is their full, physical and logical, reversibility at all stages of the calculations. This makes the large-scale architecture of potential quantum and classical reversible computers quite similar. The goal of this work is to analyze this similarity in the case of reversible superconducting logic circuits based on the recently suggested elementary gate, the nSQUID. Specifically, we present the results of numerical simulations and some limited measurements of a reversible 8-bit circular shift register fabricated at HYPRES, Inc., and working in the classical mode. The measured energy dissipation per bit operation per nSQUID is still about 20 times higher than the thermodynamic reversibility threshold of kBTIn 2 at T ap 4 K. We also discuss qualitatively operation of the reversible circuits of galvan- ically-coupled nSQUIDs in the quantum mode which provides the basis for implementation of "flying" superconducting qubits. Such qubits have several attractive features for Josephson-junction quantum logic devices beyond the single- or two-qubit circuits.
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.