Classical computations inherently require energy dissipation that increases significantly as the reliability of the computation improves. This dissipation arises when transitions between memory states are not balanced by their time-reversed counterparts. While classical memories exhibit a discrete set of possible time-reversal symmetries, quantum memory offers a continuum. This continuum enables the design of quantum memories that minimize irreversibility. As a result, quantum memory reduces energy dissipation several orders of magnitude below classical memory.
Classical computations inherently require energy dissipation that increases significantly as the reliability of the computation improves. This dissipation arises when transitions between memory states are not balanced by their time-reversed counterparts. While classical memories exhibit a discrete set of possible time-reversal symmetries, quantum memory offers a continuum. This continuum enables the design of quantum memories that minimize irreversibility. As a result, quantum memory reduces energy dissipation several orders of magnitude below classical memory.
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.
The emergence of irreversibility in physical processes, despite the fundamentally reversible nature of quantum mechanics, remains an open question in physics. This thesis explores the intricate relationship between quantum mechanics and thermodynamics, with a particular focus on minimizing entropy production in finite-time processes. By employing tools from quantum information theory and geometric thermodynamics, we tackle the challenge of deriving irreversible thermodynamic behavior from the reversible microscopic framework of quantum mechanics. We begin with a comprehensive review of the laws of thermodynamics, setting the stage for the subsequent analyses. We introduce novel developments in quantum thermodynamics through a generalized framework for geometric thermodynamics, which enables the derivation of finite-time corrections beyond the Markovian regime. Building on this foundation, we extend Landauer's principle by incorporating a finite-time correction that highlights the necessity of strong coupling for optimal information erasure processes. This result underscores the emergence of Planckian time as a fundamental speed limit to thermalization. Additionally, we explore how collective effects can be harnessed to reduce energy dissipation in thermodynamic operations, revealing that classical correlations between systems can significantly mitigate dissipation, though this may pose new questions regarding the third law of thermodynamics. Finally, we optimize thermodynamic processes in mesoscopic systems, including quantum dot engines and information engines. These findings not only enhance our understanding of the fundamental limits of irreversibility but also open new avenues for research. Future works will focus on fully exploiting collective effects, aligning these with the third law of thermodynamics, and understanding the thermodynamic consistency of master equations.
Quantum coherence allows for reduced-memory simulators of classical processes. Using recent results in single-shot quantum thermodynamics, we derive a minimal work cost rate for quantum simulators that is quasistatically attainable in the limit of asymptotically infinite parallel simulation. Comparing this cost with the classical regime reveals that quantizing classical simulators not only results in memory compression but also in reduced dissipation. We explore this advantage across a suite of representative examples.
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.
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.