Irreversibility and heat generation in the computing process
TL;DR: Two simple, but representative, models of bistable devices are subjected to a more detailed analysis of switching kinetics to yield the relationship between speed and energy dissipation, and to estimate the effects of errors induced by thermal fluctuations.
Abstract: It is argued that computing machines inevitably involve devices which perform logical functions that do not have a single-valued inverse. This logical irreversibility is associated with physical irreversibility and requires a minimal heat generation, per machine cycle, typically of the order of kT for each irreversible function. This dissipation serves the purpose of standardizing signals and making them independent of their exact logical history. Two simple, but representative, models of bistable devices are subjected to a more detailed analysis of switching kinetics to yield the relationship between speed and energy dissipation, and to estimate the effects of errors induced by thermal fluctuations.
Citations
More filters
01 Dec 2010
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
Abstract: Part I. Fundamental Concepts: 1. Introduction and overview 2. Introduction to quantum mechanics 3. Introduction to computer science Part II. Quantum Computation: 4. Quantum circuits 5. The quantum Fourier transform and its application 6. Quantum search algorithms 7. Quantum computers: physical realization Part III. Quantum Information: 8. Quantum noise and quantum operations 9. Distance measures for quantum information 10. Quantum error-correction 11. Entropy and information 12. Quantum information theory Appendices References Index.
14,825 citations
Cites background from "Irreversibility and heat generation..."
...Landauer showed that energy is dissipated whenever information is erased[15]....
[...]
TL;DR: U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
Abstract: We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x,y) to (x,x ⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n )) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical AND of all remaining input bits is satisfied. These gates play a central role in many proposed constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number required for arbitrary n-bit unitary operations.
3,731 citations
TL;DR: The exciting successes in taming molecular-level movement thus far are outlined, the underlying principles that all experimental designs must follow, and the early progress made towards utilizing synthetic molecular structures to perform tasks using mechanical motion are highlighted.
Abstract: The widespread use of controlled molecular-level motion in key natural processes suggests that great rewards could come from bridging the gap between the present generation of synthetic molecular systems, which by and large rely upon electronic and chemical effects to carry out their functions, and the machines of the macroscopic world, which utilize the synchronized movements of smaller parts to perform specific tasks. This is a scientific area of great contemporary interest and extraordinary recent growth, yet the notion of molecular-level machines dates back to a time when the ideas surrounding the statistical nature of matter and the laws of thermodynamics were first being formulated. Here we outline the exciting successes in taming molecular-level movement thus far, the underlying principles that all experimental designs must follow, and the early progress made towards utilizing synthetic molecular structures to perform tasks using mechanical motion. We also highlight some of the issues and challenges that still need to be overcome.
2,301 citations
Book•
[...]
01 Jan 2001
TL;DR: Conservative logic shows that it is ideally possible to build sequential circuits with zero internal power dissipation and proves that universal computing capabilities are compatible with the reversibility and conservation constraints.
Abstract: Conservative logic is a comprehensive model of computation which explicitly reflects a number of fundamental principles of physics, such as the reversibility of the dynamical laws and the conservation of certain additive quantities (among which energy plays a distinguished role). Because it more closely mirrors physics than traditional models of computation, conservative logic is in a better position to provide indications concerning the realization of high-performance computing systems, i.e., of systems that make very efficient use of the "computing resources" actually offered by nature. In particular, conservative logic shows that it is ideally possible to build sequential circuits with zero internal power dissipation. After establishing a general framework, we discuss two specific models of computation. The first uses binary variables and is the conservative-logic counterpart of switching theory; this model proves that universal computing capabilities are compatible with the reversibility and conservation constraints. The second model, which is a refinement of the first, constitutes a substantial breakthrough in establishing a correspondence between computation and physics. In fact, this model is based on elastic collisions of identical "balls" and thus is formally identical with the atomic model that underlies the (classical) kinetic theory of perfect gases. Quite literally, the functional behavior of a general-purpose digital computer can be reproduced by a perfect gas placed in a suitably shaped container and given appropriate initial conditions.
1,888 citations
References
More filters
Book•
01 Jan 1950
TL;DR: The sentential calculus The calculus of classes (monadic predicate calculus) The restricted predicate calculus The extended predicate calculus Editor's notes Bibliography Index as discussed by the authors, Section 5.1.
Abstract: The sentential calculus The calculus of classes (monadic predicate calculus) The restricted predicate calculus The extended predicate calculus Editor's notes Bibliography Index.
180 citations