Finite-time erasing of information stored in fermionic bits

Landauer Bound in the Context of Minimal Physical Principles: Meaning, Experimental Verification, Controversies and Perspectives

The physical roots, interpretation, controversies, and precise meaning of the Landauer principle are surveyed. The Landauer principle is a physical principle defining the lower theoretical limit of energy consumption necessary for computation. It states that an irreversible change in information stored in a computer, such as merging two computational paths, dissipates a minimum amount of heat kBTln2 per a bit of information to its surroundings. The Landauer principle is discussed in the context of fundamental physical limiting principles, such as the Abbe diffraction limit, the Margolus-Levitin limit, and the Bekenstein limit. Synthesis of the Landauer bound with the Abbe, Margolus-Levitin, and Bekenstein limits yields the minimal time of computation, which scales as τmin~hkBT. Decreasing the temperature of a thermal bath will decrease the energy consumption of a single computation, but in parallel, it will slow the computation. The Landauer principle bridges John Archibald Wheeler's "it from bit" paradigm and thermodynamics. Experimental verifications of the Landauer principle are surveyed. The interrelation between thermodynamic and logical irreversibility is addressed. Generalization of the Landauer principle to quantum and non-equilibrium systems is addressed. The Landauer principle represents the powerful heuristic principle bridging physics, information theory, and computer engineering.

Thermodynamic trade-off relation for first passage time in resetting processes

Resetting is a strategy for boosting the speed of a target-searching process. Since its introduction over a decade ago, most studies have been carried out under the assumption that resetting takes place instantaneously. However, due to its irreversible nature, resetting processes incur a thermodynamic cost, which becomes infinite in the case of instantaneous resetting. Here, we take into consideration both the cost and the first passage time (FPT) required for a resetting process, in which the reset or return to the initial location is implemented using a trapping potential over a finite but random time period. An iterative generating function and a counting functional method à la Feynman and Kac are employed to calculate the FPT and the average work for this process. From these results, we obtain an explicit form of the time-cost trade-off relation, which provides the lower bound of the mean FPT for a given work input when the trapping potential is linear. This trade-off relation clearly shows that instantaneous resetting is achievable only when an infinite amount of work is provided. More surprisingly, the trade-off relation derived from the linear potential seems to be valid for a wide range of trapping potentials. In addition, we have also shown that the fixed-time or sharp resetting can further enhance the trade-off relation compared to that of the stochastic resetting.

How to train your demon to do fast information erasure without heat production

Time-dependent protocols that perform irreversible logical operations, such as memory erasure, cost work and produce heat, placing bounds on the efficiency of computers. Here we use a prototypical computer model of a physical memory to show that it is possible to learn feedback-control protocols to do fast memory erasure without input of work or production of heat. These protocols, which are enacted by a neural-network "demon," do not violate the second law of thermodynamics because the demon generates more heat than the memory absorbs. The result is a form of nonlocal heat exchange in which one computation is rendered energetically favorable while a compensating one produces heat elsewhere, a tactic that could be used to rationally design the flow of energy within a computer.

Minimally Dissipative Information Erasure in a Quantum Dot via Thermodynamic Length

In this Letter, we explore the use of thermodynamic length to improve the performance of experimental protocols. In particular, we implement Landauer erasure on a driven electron level in a semiconductor quantum dot, and compare the standard protocol in which the energy is increased linearly in time with the one coming from geometric optimization. The latter is obtained by choosing a suitable metric structure, whose geodesics correspond to optimal finite-time thermodynamic protocols in the slow driving regime. We show experimentally that geodesic drivings minimize dissipation for slow protocols, with a bigger improvement as one approaches perfect erasure. Moreover, the geometric approach also leads to smaller dissipation even when the time of the protocol becomes comparable with the equilibration timescale of the system, i.e., away from the slow driving regime. Our results also illustrate, in a single-electron device, a fundamental principle of thermodynamic geometry: optimal finite-time thermodynamic protocols are those with constant dissipation rate along the process.

Speed Limit for a Highly Irreversible Process and Tight Finite-Time Landauer's Bound

Landauer's bound is the minimum thermodynamic cost for erasing one bit of information. As this bound is achievable only for quasistatic processes, finite-time operation incurs additional energetic costs. We find a tight finite-time Landauer's bound by establishing a general form of the classical speed limit. This tight bound well captures the divergent behavior associated with the additional cost of a highly irreversible process, which scales differently from a nearly irreversible process. We also find an optimal dynamics which saturates the equality of the bound. We demonstrate the validity of this bound via discrete one-bit and coarse-grained bit systems. Our Letter implies that more heat dissipation than expected occurs during high-speed irreversible computation.

Minimal energy cost to initialize a bit with tolerable error

Landauer's principle imposes a fundamental limit on the energy cost to perfectly initialize a classical bit, which is only reached under the ideal operation with infinitely long time. The question on the cost in the practical operation for a bit has been raised under the constraint by the finiteness of operation time. We discover a raise-up of energy cost by L^{2}(ε)/τ from the Landaeur's limit (k_{B}Tln2) for a finite-time τ initialization of a bit with an error probability ε. The thermodynamic length L(ε) between the states before and after initializing in the parametric space increases monotonously as the error decreases. For example, in the constant dissipation coefficient (γ_{0}) case, the minimal additional cost is 0.997k_{B}T/(γ_{0}τ) for ε=1% and 1.288k_{B}T/(γ_{0}τ) for ε=0.1%. Furthermore, the optimal protocol to reach the bound of minimal energy cost is proposed for the bit initialization realized via a finite-time isothermal process.

Information thermodynamics of encoding and encoders

Non-isolated systems have diverse coupling relations with the external environment. These relations generate complex thermodynamics and information transmission between the system and its environment. The framework depicted in the current research attempts to glance at the critical role of the internal orders inside the non-isolated system in shaping the information thermodynamics coupling. We characterize the coupling as a generalized encoding process, where the system acts as an information thermodynamics encoder to encode the external information based on thermodynamics. We formalize the encoding process in the context of the nonequilibrium second law of thermodynamics, revealing an intrinsic difference in information thermodynamics characteristics between information thermodynamics encoders with and without internal correlations. During the information encoding process of an external source Y, specific sub-systems in an encoder X with internal correlations can exceed the information thermodynamics bound on ( X , Y ) and encode more information than system X works as a whole. We computationally verify this theoretical finding in an Ising model with a random external field and a neural data set of the human brain during visual perception and recognition. Our analysis demonstrates that the stronger internal correlation inside these systems implies a higher possibility for specific sub-systems to encode more information than the global one. These findings may suggest a new perspective in studying information thermodynamics in diverse physical and biological systems.

Universal Bound on Energy Cost of Bit Reset in Finite Time

We consider how the energy cost of bit reset scales with the time duration of the protocol. Bit reset necessarily takes place in finite time, where there is an extra penalty on top of the quasistatic work cost derived by Landauer. This extra energy is dissipated as heat in the computer, inducing a fundamental limit on the speed of irreversible computers. We formulate a hardware-independent expression for this limit in the framework of stochastic processes. We derive a closed-form lower bound on the work penalty as a function of the time taken for the protocol and bit reset error. It holds for discrete as well as continuous systems, assuming only that the master equation respects detailed balance.

Optimality of nonconservative driving for finite-time processes with discrete states

An optimal finite-time process drives a given initial distribution to a given final one in a given time at the lowest cost as quantified by total entropy production. We prove that for a system with discrete states this optimal process involves nonconservative driving, i.e., a genuine driving affinity, in contrast to the case of a system with continuous states. In a multicyclic network, the optimal driving affinity is bounded by the number of states within each cycle. If the driving affects forward and backwards rates nonsymmetrically, the bound additionally depends on a structural parameter characterizing this asymmetry.

Information and Thermodynamics: Fast and Precise Approach to Landauer's Bound in an Underdamped Micromechanical Oscillator

The Landauer principle states that at least k_{B}Tln2 of energy is required to erase a 1-bit memory, with k_{B}T the thermal energy of the system. We study the effects of inertia on this bound using as one-bit memory an underdamped micromechanical oscillator confined in a double-well potential created by a feedback loop. The potential barrier is precisely tunable in the few k_{B}T range. We measure, within the stochastic thermodynamic framework, the work and the heat of the erasure protocol. We demonstrate experimentally and theoretically that, in this underdamped system, the Landauer bound is reached with a 1% uncertainty, with protocols as short as 100 ms.

Engineered swift equilibration for arbitrary geometries

Engineered swift equilibration (ESE) is a class of driving protocols that enforce an equilibrium distribution with respect to external control parameters at the beginning and end of rapid state transformations of open, classical nonequilibrium systems. ESE protocols have previously been derived and experimentally realized for Brownian particles in simple, one-dimensional, time-varying trapping potentials; one recent study considered ESE in two-dimensional Euclidean configuration space. Here we extend the ESE framework to generic, overdamped Brownian systems in arbitrary curved configuration space and illustrate our results with specific examples not amenable to previous techniques. Our approach may be used to impose the necessary dynamics to control the full temporal configurational distribution in a wide variety of experimentally realizable settings.

Dissipation-Time Uncertainty Relation

We show that the entropy production rate bounds the rate at which physical processes can be performed in stochastic systems far from equilibrium. In particular, we prove the fundamental tradeoff ⟨S[over ˙]_{e}⟩T≥k_{B} between the entropy flow ⟨S[over ˙]_{e}⟩ into the reservoirs and the mean time T to complete any process whose time-reversed is exponentially rarer. This dissipation-time uncertainty relation is a novel form of speed limit: the smaller the dissipation, the larger the time to perform a process.

Finite-Time Landauer Principle

We study the thermodynamic cost associated with the erasure of one bit of information over a finite amount of time. We present a general framework for minimizing the average work required when full control of a system's microstates is possible. In addition to exact numerical results, we find simple bounds proportional to the variance of the microscopic distribution associated with the state of the bit. In the short-time limit, we get a closed expression for the minimum average amount of work needed to erase a bit. The average work associated with the optimal protocol can be up to a factor of 4 smaller relative to protocols constrained to end in local equilibrium. Assessing prior experimental and numerical results based on heuristic protocols, we find that our bounds often dissipate an order of magnitude less energy.

Optimal finite-time bit erasure under full control

We study the finite-time erasure of a one-bit memory consisting of a one-dimensional double-well potential, with each well encoding a memory macrostate. We focus on setups that provide full control over the form of the potential-energy landscape and derive protocols that minimize the average work needed to erase the bit over a fixed amount of time. We allow for cases where only some of the information encoded in the bit is erased. For systems required to end up in a local-equilibrium state, we calculate the minimum amount of work needed to erase a bit explicitly, in terms of the equilibrium Boltzmann distribution corresponding to the system's initial potential. The minimum work is inversely proportional to the duration of the protocol. The erasure cost may be further reduced by relaxing the requirement for a local-equilibrium final state and allowing for any final distribution compatible with constraints on the probability to be in each memory macrostate. We also derive upper and lower bounds on the erasure cost.

A space-time tradeoff for implementing a function with master equation dynamics

Master equations are commonly used to model the dynamics of physical systems, including systems that implement single-valued functions like a computer’s update step. However, many such functions cannot be implemented by any master equation, even approximately, which raises the question of how they can occur in the real world. Here we show how any function over some “visible” states can be implemented with master equation dynamics—if the dynamics exploits additional, “hidden” states at intermediate times. We also show that any master equation implementing a function can be decomposed into a sequence of “hidden” timesteps, demarcated by changes in what state-to-state transitions have nonzero probability. In many real-world situations there is a cost both for more hidden states and for more hidden timesteps. Accordingly, we derive a “space–time” tradeoff between the number of hidden states and the number of hidden timesteps needed to implement any given function.

Deterministic maps from initial to final states can always be modelled using the master equation formalism, provided additional “hidden” states are available. Here, the authors demonstrate a tradeoff between the required number of such states and the number of required, suitably defined “hidden time steps”.

Thermodynamics of Majority-Logic Decoding in Information Erasure

We investigate the performance of majority-logic decoding in both reversible and finite-time information erasure processes performed on macroscopic bits that contain N microscopic binary units. While we show that for reversible erasure protocols single-unit transformations are more efficient than majority-logic decoding, the latter is found to offer several benefits for finite-time erasure processes: Both the minimal erasure duration for a given erasure and the minimal erasure error for a given erasure duration are reduced, if compared to a single unit. Remarkably, the majority-logic decoding is also more efficient in both the small-erasure error and fast-erasure region. These benefits are also preserved under the optimal erasure protocol that minimizes the dissipated heat. Our work therefore shows that majority-logic decoding can lift the precision-speed-efficiency trade-off in information erasure processes.

Non-Markovianity and negative entropy production rates

Entropy production plays a fundamental role in nonequilibrium thermodynamics to quantify the irreversibility of open systems. Its positivity can be ensured for a wide class of setups, but the entropy production rate can become negative sometimes. This is often taken as an indicator of non-Markovianity. We make this link precise by showing under which conditions a negative entropy production rate implies non-Markovianity and when it does not. For a system coupled to a single heat bath, this can be established within a unified language for two setups: (i) the dynamics resulting from a coarse-grained description of a Markovian master equation and (ii) the classical Hamiltonian dynamics of a system coupled to a bath. The quantum version of the latter result is shown not to hold despite the fact that the integrated thermodynamic description is formally equivalent to the classical case. The instantaneous fixed point of a non-Markovian dynamics plays an important role in our study. Our key contribution is to provide a consistent theoretical framework to study the finite-time thermodynamics of a large class of dynamics with a precise link to its non-Markovianity.

A thermodynamically consistent model of finite-state machines

Finite-state machines (FSMs) are a theoretically and practically important model of computation. We propose a general, thermodynamically consistent model of FSMs and characterize the resource requirements of these machines. We model FSMs as time-inhomogeneous Markov chains. The computation is driven by instantaneous manipulations of the energy levels of the states. We calculate the entropy production of the machine, its error probability, and the time required to complete one update step. We find that a sequence of generalized bit-setting operations is sufficient to implement any FSM.

Correlation-powered information engines and the thermodynamics of self-correction

Information engines can use structured environments as a resource to generate work by randomizing ordered inputs and leveraging the increased Shannon entropy to transfer energy from a thermal reservoir to a work reservoir. We give a broadly applicable expression for the work production of an information engine, generally modeled as a memoryful channel that communicates inputs to outputs as it interacts with an evolving environment. The expression establishes that an information engine must have more than one memory state in order to leverage input environment correlations. To emphasize this functioning, we designed an information engine powered solely by temporal correlations and not by statistical biases, as employed by previous engines. Key to this is the engine's ability to synchronize-the engine automatically returns to a desired dynamical phase when thrown into an unwanted, dissipative phase by corruptions in the input-that is, by unanticipated environmental fluctuations. This self-correcting mechanism is robust up to a critical level of corruption, beyond which the system fails to act as an engine. We give explicit analytical expressions for both work and critical corruption level and summarize engine performance via a thermodynamic-function phase diagram over engine control parameters. The results reveal a thermodynamic mechanism based on nonergodicity that underlies error correction as it operates to support resilient engineered and biological systems.

Optimal protocols for slowly driven quantum systems

The design of efficient quantum information processing will rely on optimal nonequilibrium transitions of driven quantum systems. Building on a recently developed geometric framework for computing optimal protocols for classical systems driven in finite time, we construct a general framework for optimizing the average information entropy for driven quantum systems. Geodesics on the parameter manifold endowed with a positive semidefinite metric correspond to protocols that minimize the average information entropy production in finite time. We use this framework to explicitly compute the optimal entropy production for a simple two-state quantum system coupled to a heat bath of bosonic oscillators, which has applications to quantum annealing.

Optimal control of overdamped systems

Nonequilibrium physics encompasses a broad range of natural and synthetic small-scale systems. Optimizing transitions of such systems will be crucial for the development of nanoscale technologies and may reveal the physical principles underlying biological processes at the molecular level. Recent work has demonstrated that when a thermodynamic system is driven away from equilibrium then the space of controllable parameters has a Riemannian geometry induced by a generalized inverse diffusion tensor. We derive a simple, compact expression for the inverse diffusion tensor that depends solely on equilibrium information for a broad class of potentials. We use this formula to compute the minimal dissipation for two model systems relevant to small-scale information processing and biological molecular motors. In the first model, we optimally erase a single classical bit of information modeled by an overdamped particle in a smooth double-well potential. In the second model, we find the minimal dissipation of a simple molecular motor model coupled to an optical trap. In both models, we find that the minimal dissipation for the optimal protocol of duration τ is proportional to 1/τ, as expected, though the dissipation for the erasure model takes a different form than what we found previously for a similar system.

Degenerate optimal paths in thermally isolated systems

We present an analysis of the work performed on a system of interest that is kept thermally isolated during the switching of a control parameter. We show that there exists, for a certain class of systems, a finite-time family of switching protocols for which the work is equal to the quasistatic value. These optimal paths are obtained within linear response for systems initially prepared in a canonical distribution. According to our approach, such protocols are composed of a linear part plus a function which is odd with respect to time reversal. For systems with one degree of freedom, we claim that these optimal paths may also lead to the conservation of the corresponding adiabatic invariant. This points to an interesting connection between work and the conservation of the volume enclosed by the energy shell. To illustrate our findings, we solve analytically the harmonic oscillator and present numerical results for certain anharmonic examples.

Stochastic thermodynamics with information reservoirs

We generalize stochastic thermodynamics to include information reservoirs. Such information reservoirs, which can be modeled as a sequence of bits, modify the second law. For example, work extraction from a system in contact with a single heat bath becomes possible if the system also interacts with an information reservoir. We obtain an inequality, and the corresponding fluctuation theorem, generalizing the standard entropy production of stochastic thermodynamics. From this inequality we can derive an information processing entropy production, which gives the second law in the presence of information reservoirs. We also develop a systematic linear response theory for information processing machines. For a unicyclic machine powered by an information reservoir, the efficiency at maximum power can deviate from the standard value of 1/2. For the case where energy is consumed to erase the tape, the efficiency at maximum erasure rate is found to be 1/2.

Maximum work extraction and implementation costs for nonequilibrium Maxwell's demons

We determine the maximum amount of work extractable in finite time by a demon performing continuous measurements on a quadratic Hamiltonian system subjected to thermal fluctuations, in terms of the information extracted from the system. The maximum work demon is found to apply a high-gain continuous feedback involving a Kalman-Bucy estimate of the system state and operates in nonequilibrium. A simple and concrete electrical implementation of the feedback protocol is proposed, which allows for analytic expressions of the flows of energy, entropy, and information inside the demon. This let us show that any implementation of the demon must necessarily include an external power source, which we prove both from classical thermodynamics arguments and from a version of Landauer's memory erasure argument extended to nonequilibrium linear systems.

Optimal finite-time erasure of a classical bit

Information erasure inevitably leads to the generation of heat. Minimizing this dissipation will be crucial for developing small-scale information processing systems, but little is known about the optimal procedures required. We have obtained closed-form expressions for maximally efficient erasure cycles for deletion of a classical bit of information stored by the position of a particle diffusing in a double-well potential. We find that the extra heat generated beyond the Landauer bound is proportional to the square of the Hellinger distance between the initial and final states divided by the cycle duration, which quantifies how far out of equilibrium the system is driven. Finally, we demonstrate close agreement between the exact optimal cycle and the protocol found using a linear response framework.

Quantum effects improve the energy efficiency of feedback control

The laws of thermodynamics apply equally well to quantum systems as to classical systems, and because of this, quantum effects do not change the fundamental thermodynamic efficiency of isothermal refrigerators or engines. We show that, despite this fact, quantum mechanics permits measurement-based feedback control protocols that are more thermodynamically efficient than their classical counterparts. As part of our analysis, we perform a detailed accounting of the thermodynamics of unitary feedback control and elucidate the sources of inefficiency in measurement-based and coherent feedback.