Fundamental energy cost of finite-time computing

Abstract

The fundamental energy cost of irreversible computing is given by the Landauer bound of $kT\ln 2$~/bit. However, this limit is only achievable for infinite-time processes. We here determine the fundamental energy cost of finite-time irreversible computing \er{within the framework of nonequilibrium thermodynamics}. Comparing the lower bounds of energy required by ideal serial and parallel computers to solve a problem of a given size in a given finite time, we find that the energy cost of a serial computer fundamentally diverges with increasing problem size, whereas that of a parallel computer can stay close to the Landauer limit. We discuss the implications of this result in the context of current technology, and for different degrees of parallelization and amounts of overhead. Our findings provide a physical basis for the design of energy efficient computers.

References in corpus (10)

• High-precision test of Landauer's principle in a feedback trap
• Finite-time Landauer principle
• Finite-Time Quantum Landauer Principle and Quantum Coherence
• Information and thermodynamics: fast and precise approach to Landauer's bound in an underdamped micro-mechanical oscillator
• Universal Bound on Energy Cost of Bit Reset in Finite Time
• Optimal finite-time bit erasure under full control
• Dynamics of information erasure and extension of Landauer's bound to fast processes
• Principles of Low Dissipation Computing from a Stochastic Circuit Model
• Reliability and entropy production in non-equilibrium electronic memories
• The impossibility of Landauer's bound for almost every quantum state

Cited by in corpus (5)

• Collective advantages in finite-time thermodynamics
• Charging a quantum spin network towards Heisenberg-limited precision
• Experimental nonequilibrium memory erasure beyond Landauer's bound
• Optimally Fast Qubit Reset
• Improving the efficiency of finite-time memory erasure with potential barrier shaping