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

Advanced series in applied physics

Reversible Computation: Implications for Measurement, Communication, and Physical Law

Rolf W. Landauer

Published Jan 1, 1997• 0 citations
Publisher

Abstract

This short note is closer to an annotated bibliography, than to a real review. We allude to reversible computation, but do not repeat the many existing discussions. We point out that minimal energy dissipation requirements in classical measurement and in the communications channel are now understood as a result of the insights gained from the studies of reversible computation. In all three areas (computation, communication, and measurement) dissipation can be made as small as desired, per step, as long as information is not discarded. Erasure of information is not essential in computation or communication, but is needed to reset the meter after measurement. We speculate on the implications for physical law, arising from the likely limited computational recision available in the universe. We become even more speculative, and suggest that the ultimate physical laws, as a result of their limited precision, have something akin to a built-in noise source, and that this is the ultimate source of irreversibility.

DOI
10.1142/9789812819895_0038

Related papers

Information is Inevitably Physical

Rolf W. Landauer

Information is inevitably tied to a physical representation, and therefore to all the possibilities and restrictions allowed by our real physical universe. The theory of computational limits is reviewed in a historical fashion. After some widespread initial errors, it was eventually understood that statistical mechanics and elementary quantum mechanics do not provide any limits. The energy requirements of the communications channel are particularly emphasized; it is an area where lower bounds, accepted for decades, are circumventable. The utility of the time-modulated potential going from monostability to bistability and back, is emphasized. Despite its use by von Neumann, Feynman, and many others, it has not received broad attention, i.e.by those not actually invoking it for their own purposes. I revisit my long-standing contention that our real universe does not permit the unlimited chain of infallible operations, envisioned in continuum mathematics, and that this has an influence on the ultimate nature of physical law. Finally, in the spirit of a volume dedicated to Richard Feynman’s impact, I deplore the strong effects of fashions in science.

CRC Press eBooks•Nov 15, 2018•48 citations

Reversible computation

E. Desurvire

This chapter makes us walk a few preliminary, but decisive, steps towards quantum information theory (QIT), which will be the focus of the rest of this book. Here, we shall remain in the classical world, yet getting a hint that it is possible to think of a different world where computations may be reversible, namely, without any loss of information. One key realization through this paradigm shift is that “information is physical.” As we shall see, such a nonintuitive and striking conclusion actually results from the age-long paradox of Maxwell's demon in thermodynamics, which eventually found an elegant conclusion in Landauer's principle. This principle states that the erasure of a single bit of information requires one to provide an energy that is proportional to log 2, which, as we know from Shannon's theory, is the measure of information and also the entropy of a two-level system with a uniformly distributed source. This consideration brings up the issue of irreversible computation. Logic gates, used at the heart of the CPU in modern computers, are based on such computation irreversibility. I shall then describe the computers' von Newman's architecture, the intimate workings of the ALU processing network, and the elementary logic gates on which the ALU is based. This will also provide some basics of Boolean logic, expanding on Chapter 1, which is the key to the following logic-gate concepts.

Cambridge University Press eBooks•Feb 19, 2009•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

QUANTUM COMPUTATION

Dorit Aharonov

In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically powerful computational tool. This review is about to tell the story of theoretical quantum computation. I left out the developing topic of experimental realizations of the model, and neglected other closely related topics which are quantum information and quantum communication. As a result of narrowing the scope of this paper, I hope it has gained the benefit of being an almost self contained introduction to the exciting field of quantum computation. The review begins with background on theoretical computer science, Turing machines and Boolean circuits. In light of these models, I define quantum computers, and discuss the issue of universal quantum gates. Quantum algorithms, including Shor's factorization algorithm and Grover's algorithm for searching databases, are explained. I will devote much attention to understanding what the origins of the quantum computational power are, and what the limits of this power are. Finally, I describe the recent theoretical results which show that quantum computers maintain their complexity power even in the presence of noise, inaccuracies and finite precision. I tried to put all results in their context, asking what the implications to other issues in computer science and physics are. In the end of this review I make these connections explicit, discussing the possible implications of quantum computation on fundamental physical questions, such as the transition from quantum to classical physics.

arXiv:quant-ph/9812037•WORLD SCIENTIFIC eBooks•Mar 1, 1999•139 citations

Quantum measurements and Landauer’s principle

Vladimir I Shevchenko

Information processing systems must obey laws of physics. One of particular examples of this general statement is known as Landauer’s principle - irreversible operations (such as erasure) performed by any computing device at finite temperature have to dissipate some amount of heat bound from below. Together with other results of this kind, Landauer’s principle represents a fundamental limit any modern or future computer must obey.

EPJ Web of Conferences•Jan 1, 2015•3 citations

Quantum reversibility is relative, or does a quantum measurement reset initial conditions?

Wojciech Hubert Zurek

I compare the role of the information in classical and quantum dynamics by examining the relation between information flows in measurements and the ability of observers to reverse evolutions. I show that in the Newtonian dynamics reversibility is unaffected by the observer's retention of the information about the measurement outcome. By contrast-even though quantum dynamics is unitary, hence, reversible-reversing quantum evolution that led to a measurement becomes, in principle, impossible for an observer who keeps the record of its outcome. Thus, quantum irreversibility can result from the information gain rather than just its loss-rather than just an increase of the (von Neumann) entropy. Recording of the outcome of the measurement resets, in effect, initial conditions within the observer's (branch of) the Universe. Nevertheless, I also show that the observer's friend-an agent who knows what measurement was successfully carried out and can confirm that the observer knows the outcome but resists his curiosity and does not find out the result-can, in principle, undo the measurement. This relativity of quantum reversibility sheds new light on the origin of the arrow of time and elucidates the role of information in classical and quantum physics. Quantum discord appears as a natural measure of the extent to which dissemination of information about the outcome affects the ability to reverse the measurement.This article is part of a discussion meeting issue 'Foundations of quantum mechanics and their impact on contemporary society'.

arXiv:1808.08598•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•May 28, 2018•19 citations
This short note is closer to an annotated bibliography, than to a real review. We allude to reversible computation, but do not repeat the many existing discussions. We point out that minimal energy dissipation requirements in classical measurement and in the communications channel are now understood as a result of the insights gained from the studies of reversible computation. In all three areas (computation, communication, and measurement) dissipation can be made as small as desired, per step, as long as information is not discarded. Erasure of information is not essential in computation or communication, but is needed to reset the meter after measurement. We speculate on the implications for physical law, arising from the likely limited computational recision available in the universe. We become even more speculative, and suggest that the ultimate physical laws, as a result of their limited precision, have something akin to a built-in noise source, and that this is the ultimate source of irreversibility.
Information is inevitably tied to a physical representation, and therefore to all the possibilities and restrictions allowed by our real physical universe. The theory of computational limits is reviewed in a historical fashion. After some widespread initial errors, it was eventually understood that statistical mechanics and elementary quantum mechanics do not provide any limits. The energy requirements of the communications channel are particularly emphasized; it is an area where lower bounds, accepted for decades, are circumventable. The utility of the time-modulated potential going from monostability to bistability and back, is emphasized. Despite its use by von Neumann, Feynman, and many others, it has not received broad attention, i.e.by those not actually invoking it for their own purposes. I revisit my long-standing contention that our real universe does not permit the unlimited chain of infallible operations, envisioned in continuum mathematics, and that this has an influence on the ultimate nature of physical law. Finally, in the spirit of a volume dedicated to Richard Feynman’s impact, I deplore the strong effects of fashions in science.
This chapter makes us walk a few preliminary, but decisive, steps towards quantum information theory (QIT), which will be the focus of the rest of this book. Here, we shall remain in the classical world, yet getting a hint that it is possible to think of a different world where computations may be reversible, namely, without any loss of information. One key realization through this paradigm shift is that “information is physical.” As we shall see, such a nonintuitive and striking conclusion actually results from the age-long paradox of Maxwell's demon in thermodynamics, which eventually found an elegant conclusion in Landauer's principle. This principle states that the erasure of a single bit of information requires one to provide an energy that is proportional to log 2, which, as we know from Shannon's theory, is the measure of information and also the entropy of a two-level system with a uniformly distributed source. This consideration brings up the issue of irreversible computation. Logic gates, used at the heart of the CPU in modern computers, are based on such computation irreversibility. I shall then describe the computers' von Newman's architecture, the intimate workings of the ALU processing network, and the elementary logic gates on which the ALU is based. This will also provide some basics of Boolean logic, expanding on Chapter 1, which is the key to the following logic-gate concepts.
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.
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically powerful computational tool. This review is about to tell the story of theoretical quantum computation. I left out the developing topic of experimental realizations of the model, and neglected other closely related topics which are quantum information and quantum communication. As a result of narrowing the scope of this paper, I hope it has gained the benefit of being an almost self contained introduction to the exciting field of quantum computation. The review begins with background on theoretical computer science, Turing machines and Boolean circuits. In light of these models, I define quantum computers, and discuss the issue of universal quantum gates. Quantum algorithms, including Shor's factorization algorithm and Grover's algorithm for searching databases, are explained. I will devote much attention to understanding what the origins of the quantum computational power are, and what the limits of this power are. Finally, I describe the recent theoretical results which show that quantum computers maintain their complexity power even in the presence of noise, inaccuracies and finite precision. I tried to put all results in their context, asking what the implications to other issues in computer science and physics are. In the end of this review I make these connections explicit, discussing the possible implications of quantum computation on fundamental physical questions, such as the transition from quantum to classical physics.
I compare the role of the information in classical and quantum dynamics by examining the relation between information flows in measurements and the ability of observers to reverse evolutions. I show that in the Newtonian dynamics reversibility is unaffected by the observer's retention of the information about the measurement outcome. By contrast-even though quantum dynamics is unitary, hence, reversible-reversing quantum evolution that led to a measurement becomes, in principle, impossible for an observer who keeps the record of its outcome. Thus, quantum irreversibility can result from the information gain rather than just its loss-rather than just an increase of the (von Neumann) entropy. Recording of the outcome of the measurement resets, in effect, initial conditions within the observer's (branch of) the Universe. Nevertheless, I also show that the observer's friend-an agent who knows what measurement was successfully carried out and can confirm that the observer knows the outcome but resists his curiosity and does not find out the result-can, in principle, undo the measurement. This relativity of quantum reversibility sheds new light on the origin of the arrow of time and elucidates the role of information in classical and quantum physics. Quantum discord appears as a natural measure of the extent to which dissemination of information about the outcome affects the ability to reverse the measurement.This article is part of a discussion meeting issue 'Foundations of quantum mechanics and their impact on contemporary society'.