Optimal finite-time erasure of a classical bit

Shortcuts to Adiabaticity across a Separatrix

Shortcuts to adiabaticity are strategies for conserving adiabatic invariants under nonadiabatic (i.e. fast-driving) conditions. Here, we show how to extend classical, Hamiltonian shortcuts to adiabaticity to allow the crossing of a phase-space separatrix-a situation in which a corresponding adiabatic protocol does not exist. Specifically, we show how to construct a time-dependent Hamiltonian that evolves one energy shell to another energy shell across a separatrix. Leveraging this method, we design an erasure procedure whose energy cost bound and fidelity do not depend on the protocol's duration.

Decomposition of metric tensor in thermodynamic geometry in terms of relaxation timescales

Geometrical methods are extensively applied to thermodynamics, including stochastic thermodynamics. In the case of a slow-driving linear response regime, a geometrical framework, known as thermodynamic geometry, is established. The key to this framework is the thermodynamic length characterized by a metric tensor defined in the space of controlling variables. As the metric tensor is given in terms of the equilibrium time-correlation functions of the thermodynamic forces, it contains the information on timescales, which may be useful for analyzing the performance of heat engines. In this paper, we show that the metric tensor for underdamped Langevin dynamics can be decomposed in terms of the relaxation times of a system itself, which govern the timescales of the equilibrium time-correlation functions of the thermodynamic forces. As an application of the decomposition of the metric tensor, we demonstrate that it is possible to achieve Carnot efficiency at finite power by taking the vanishing limit of relaxation times without breaking trade-off relations between efficiency and power of heat engines in terms of thermodynamic geometry.

Shortcut to finite-time memory erasure

To achieve fast computation, it is crucial to reset the memory to a desired state within a limited time. However, the inherent delay in the system's response often prevents reaching the desired state once the control process is completed in finite time. To address this challenge, we propose a shortcut strategy that incorporates an auxiliary control to guide the system towards an equilibrium state that corresponds to the intended control, thus enabling memory reset to desired accuracy regardless of the erasure speed. Through the application of thermodynamic geometry, we derive an optimal shortcut protocol for erasure processes that minimizes the energy cost. This research provides an effective design principle for realizing the finite-time erasure process to desired accuracy while simultaneously reducing the energy cost, thereby alleviating the burden of heat dissipation.

Beyond Linear Response: Equivalence between Thermodynamic Geometry and Optimal Transport

A fundamental result of thermodynamic geometry is that the optimal, minimal-work protocol that drives a nonequilibrium system between two thermodynamic states in the slow-driving limit is given by a geodesic of the friction tensor, a Riemannian metric defined on control space. For overdamped dynamics in arbitrary dimensions, we demonstrate that thermodynamic geometry is equivalent to L^{2} optimal transport geometry defined on the space of equilibrium distributions corresponding to the control parameters. We show that obtaining optimal protocols past the slow-driving or linear response regime is computationally tractable as the sum of a friction tensor geodesic and a counterdiabatic term related to the Fisher information metric. These geodesic-counterdiabatic optimal protocols are exact for parametric harmonic potentials, reproduce the surprising nonmonotonic behavior recently discovered in linearly biased double well optimal protocols, and explain the ubiquitous discontinuous jumps observed at the beginning and end times.

Qubit reset with a shortcut-to-isothermal scheme

Landauer's principle shows that the minimum energy cost to reset a classical bit in a bath with temperature T is k_{B}Tln2 in the infinite time. However, the task to reset the bit in finite time has posted a new challenge, especially for quantum bit (qubit) where both the operation time and controllability are limited. We design a shortcut-to-isothermal scheme to reset a qubit in finite time τ with limited controllability. The energy cost is minimized with the optimal control scheme with and without bound. This optimal control scheme can provide a reference to realize qubit reset with minimum energy cost for the limited time.

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.

Efficient control protocols for an active Ornstein-Uhlenbeck particle

Designing a protocol to efficiently drive a stochastic system is an active field of research. Here we extend such control theory to an active Ornstein-Uhlenbeck particle (AOUP) in a bistable potential, driven by a harmonic trap. We find that protocols designed to minimize the excess work (up to linear response) perform better than naive protocols with constant velocity for a wide range of protocol durations.

Fundamental energy cost of finite-time parallelizable computing

The fundamental energy cost of irreversible computing is given by the Landauer bound of [Formula: see text]/bit, where k is the Boltzmann constant and T is the temperature in Kelvin. However, this limit is only achievable for infinite-time processes. We here determine the fundamental energy cost of finite-time parallelizable computing within the framework of nonequilibrium thermodynamics. We apply these results to quantify the energetic advantage of parallel computing over serial computing. We find that the energy cost per operation of a parallel computer can be kept close to the Landauer limit even for large problem sizes, whereas that of a serial computer fundamentally diverges. We analyze, in particular, the effects of different degrees of parallelization and amounts of overhead, as well as the influence of non-ideal electronic hardware. We further discuss their implications in the context of current technology. Our findings provide a physical basis for the design of energy-efficient computers.

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.

Optimal Control of the F1-ATPase Molecular Motor

F₁-ATPase is a rotary molecular motor that in vivo is subject to strong nonequilibrium driving forces. There is great interest in understanding the operational principles governing its high efficiency of free-energy transduction. Here we use a near-equilibrium framework to design a nontrivial control protocol to minimize dissipation in rotating F₁ to synthesize adenosine triphosphate. We find that the designed protocol requires much less work than a naive (constant-velocity) protocol across a wide range of protocol durations. Our analysis points to a possible mechanism for energetically efficient driving of F₁ in vivo and provides insight into free-energy transduction for a broader class of biomolecular and synthetic machines.

Limited-control optimal protocols arbitrarily far from equilibrium

Recent studies have explored finite-time dissipation-minimizing protocols for stochastic thermodynamic systems driven arbitrarily far from equilibrium, when granted full external control to drive the system. However, in both simulation and experimental contexts, systems often may only be controlled with a limited set of degrees of freedom. Here, going beyond slow- and fast-driving approximations employed in previous studies, we obtain exact finite-time optimal protocols for this limited-control setting. By working with deterministic Fokker-Planck probability density time evolution, we can frame the work-minimizing protocol problem in the standard form of an optimal control theory problem. We demonstrate that finding the exact optimal protocol is equivalent to solving a system of Hamiltonian partial differential equations, which in many cases admit efficiently calculable numerical solutions. Within this framework, we reproduce analytical results for the optimal control of harmonic potentials and numerically devise optimal protocols for two anharmonic examples: varying the stiffness of a quartic potential and linearly biasing a double-well potential. We confirm that these optimal protocols outperform other protocols produced through previous methods, in some cases by a substantial amount. We find that for the linearly biased double-well problem, the mean position under the optimal protocol travels at a near-constant velocity. Surprisingly, for a certain timescale and barrier height regime, the optimal protocol is also nonmonotonic in time.

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.

Geometric Bound on the Efficiency of Irreversible Thermodynamic Cycles

Stochastic thermodynamics has revolutionized our understanding of heat engines operating in finite time. Recently, numerous studies have considered the optimal operation of thermodynamic cycles acting as heat engines with a given profile in thermodynamic space (e.g., P-V space in classical thermodynamics), with a particular focus on the Carnot engine. In this work, we use the lens of thermodynamic geometry to explore the full space of thermodynamic cycles with continuously varying bath temperature in search of optimally shaped cycles acting in the slow-driving regime. We apply classical isoperimetric inequalities to derive a universal geometric bound on the efficiency of any irreversible thermodynamic cycle and explicitly construct efficient heat engines operating in finite time that nearly saturate this bound for a specific model system. Given the bound, these optimal cycles perform more efficiently than all other thermodynamic cycles operating as heat engines in finite time, including notable cycles, such as those of Carnot, Stirling, and Otto. For example, in comparison to recent experiments, this corresponds to orders of magnitude improvement in the efficiency of engines operating in certain time regimes. Our results suggest novel design principles for future mesoscopic heat engines and are ripe for experimental investigation.

Solution to the Fokker-Planck equation for slowly driven Brownian motion: Emergent geometry and a formula for the corresponding thermodynamic metric

Considerable progress has recently been made with geometrical approaches to understanding and controlling small out-of-equilibrium systems, but a mathematically rigorous foundation for these methods has been lacking. Towards this end, we develop a perturbative solution to the Fokker-Planck equation for one-dimensional driven Brownian motion in the overdamped limit enabled by the spectral properties of the corresponding single-particle Schrödinger operator. The perturbation theory is in powers of the inverse characteristic timescale of variation of the fastest varying control parameter, measured in units of the system timescale, which is set by the smallest eigenvalue of the corresponding Schrödinger operator. It applies to any Brownian system for which the Schrödinger operator has a confining potential. We use the theory to rigorously derive an exact formula for a Riemannian "thermodynamic" metric in the space of control parameters of the system. We show that up to second-order terms in the perturbation theory, optimal dissipation-minimizing driving protocols minimize the length defined by this metric. We also show that a previously proposed metric is calculable from our exact formula with corrections that are exponentially suppressed in a characteristic length scale. We illustrate our formula using the two-dimensional example of a harmonic oscillator with time-dependent spring constant in a time-dependent electric field. Lastly, we demonstrate that the Riemannian geometric structure of the optimal control problem is emergent; it derives from the form of the perturbative expansion for the probability density and persists to all orders of the expansion.

Inverse linear versus exponential scaling of work penalty in finite-time bit reset

A bit reset is a basic operation in irreversible computing. This costs work and dissipates energy in the computer, creating a limit on speeds and energy efficiency of future irreversible computers. It was recently shown by Zhen et al. [Phys. Rev. Lett. 127, 190602 (2021)0031-900710.1103/PhysRevLett.127.190602] that for a finite-time reset protocol, the additional work on top of the quasistatic protocol can always be minimized by considering a two-level system, and then be lower bounded through a thermodynamical speed limit. An important question is to understand under what protocol parameters, including a bit reset error and maximum energy shift, this penalty decreases exponentially vs inverse linearly in the protocol time. Here we provide several analytical results to address this question, as well as numerical simulations of specific examples of protocols.

Finite-Time Quantum Landauer Principle and Quantum Coherence

The Landauer principle states that any logically irreversible information processing must be accompanied by dissipation into the environment. In this Letter, we investigate the heat dissipation associated with finite-time information erasure and the effect of quantum coherence in such processes. By considering a scenario wherein information is encoded in an open quantum system whose dynamics are described by the Markovian Lindblad equation, we show that the dissipated heat is lower bounded by the conventional Landauer cost, as well as a correction term inversely proportional to the operational time. To clarify the relation between quantum coherence and dissipation, we derive a lower bound for heat dissipation in terms of quantum coherence. This bound quantitatively implies that the creation of quantum coherence in the energy eigenbasis during the erasure process inevitably leads to additional heat costs. The obtained bounds hold for arbitrary operational time and control protocol. By following an optimal control theory, we numerically present an optimal protocol and illustrate our findings by using a single-qubit system.

Shortcuts to Thermodynamic Computing: The Cost of Fast and Faithful Information Processing

Landauer's Principle states that the energy cost of information processing must exceed the product of the temperature, Boltzmann's constant, and the change in Shannon entropy of the information-bearing degrees of freedom. However, this lower bound is achievable only for quasistatic, near-equilibrium computations-that is, only over infinite time. In practice, information processing takes place in finite time, resulting in dissipation and potentially unreliable logical outcomes. For overdamped Langevin dynamics, we show that counterdiabatic potentials can be crafted to guide systems rapidly and accurately along desired computational paths, providing shortcuts that allow for the precise design of finite-time computations. Such shortcuts require additional work, beyond Landauer's bound, that is irretrievably dissipated into the environment. We show that this dissipated work is proportional to the computation rate as well as the square of the information-storing system's length scale. As a paradigmatic example, we design shortcuts to create, erase, and transfer a bit of information metastably stored in a double-well potential. Though dissipated work generally increases with operation fidelity, we show that it is possible to compute with perfect fidelity in finite time with finite work. We also show that the robustness of information storage affects an operation's energetic cost-specifically, the dissipated work scales as the information lifetime of the bistable system. Our analysis exposes a rich and nuanced relationship between work, speed, size of the information-bearing degrees of freedom, storage robustness, and the difference between initial and final informational statistics.

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.

Entropy production given constraints on the energy functions

We consider the problem of driving a finite-state classical system from some initial distribution p to some final distribution p^{'} with vanishing entropy production (EP), under the constraint that the driving protocols can only use some limited set of energy functions E. Assuming no other constraints on the driving protocol, we derive a simple condition that guarantees that such a transformation can be carried out, which is stated in terms of the smallest probabilities in {p,p^{'}} and a graph-theoretic property defined in terms of E. Our results imply that a surprisingly small amount of control over the energy function is sufficient (in particular, any transformation p→p^{'} can be carried out as soon as one can control some one-dimensional parameter of the energy function, e.g., the energy of a single state). We also derive a lower bound on the EP under more general constraints on the transition rates, which is formulated in terms of a convex optimization problem.

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.

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.

Modeling work-speed-accuracy trade-offs in a stochastic rotary machine

Molecular machines are stochastic systems that catalyze the energetic processes keeping living cells alive and structured. Inspired by the examples of F_{1}-ATP synthase and the bacterial flagellum, we present a minimal model of an externally driven stochastic rotary machine. We explore the trade-offs of work, driving speed, and driving accuracy when changing driving strength, speed, and the underlying system dynamics. We find an upper bound on accuracy and work for a particular speed. Our results favor slow driving when tasked with minimizing the work-accuracy ratio and maximizing the rate of successful cycles. Finally, in the parameter regime mapping to the dynamics of F_{1}-ATP synthase, we find a significant decay of driving accuracy at physiological rotation rates, raising questions about how ATP synthase achieves reasonable or even remarkable efficiency in vivo.

Geometry of Work Fluctuations versus Efficiency in Microscopic Thermal Machines

When engineering microscopic machines, increasing efficiency can often come at a price of reduced reliability due to the impact of stochastic fluctuations. Here we develop a general method for performing multiobjective optimization of efficiency and work fluctuations in thermal machines operating close to equilibrium in either the classical or quantum regime. Our method utilizes techniques from thermodynamic geometry, whereby we match optimal solutions to protocols parametrized by their thermodynamic length. We characterize the optimal protocols for continuous-variable Gaussian machines, which form a crucial class in the study of thermodynamics for microscopic systems.

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.

Maxwell's Demons with Finite Size and Response Time

Nearly all theoretical analyses of Maxwell's demon focus on its energetic and entropic costs of operation. Here, we focus on its rate of operation. In our model, a demon's rate limitation stems from its finite response time and gate area. We determine the rate limits of mass and energy transfer, as well as entropic reduction for four such demons: those that select particles according to (1) direction, (2) energy, (3) number, and (4) entropy. Last, we determine the optimal gate size for a demon with small, finite response time, and compare our predictions with molecular dynamics simulations with both ideal and nonideal gasses. Also, we study the conditions under which the demons are able to move both energy and particles in the chosen direction when attempting to only move one.

Theory of Nonequilibrium Free Energy Transduction by Molecular Machines

Biomolecular machines are protein complexes that convert between different forms of free energy. They are utilized in nature to accomplish many cellular tasks. As isothermal nonequilibrium stochastic objects at low Reynolds number, they face a distinct set of challenges compared with more familiar human-engineered macroscopic machines. Here we review central questions in their performance as free energy transducers, outline theoretical and modeling approaches to understand these questions, identify both physical limits on their operational characteristics and design principles for improving performance, and discuss emerging areas of research.

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.

Designing the optimal bit: balancing energetic cost, speed and reliability

We consider the challenge of operating a reliable bit that can be rapidly erased. We find that both erasing and reliability times are non-monotonic in the underlying friction, leading to a trade-off between erasing speed and bit reliability. Fast erasure is possible at the expense of low reliability at moderate friction, and high reliability comes at the expense of slow erasure in the underdamped and overdamped limits. Within a given class of bit parameters and control strategies, we define 'optimal' designs of bits that meet the desired reliability and erasing time requirements with the lowest operational work cost. We find that optimal designs always saturate the bound on the erasing time requirement, but can exceed the required reliability time if critically damped. The non-trivial geometry of the reliability and erasing time scales allows us to exclude large regions of parameter space as suboptimal. We find that optimal designs are either critically damped or close to critical damping under the erasing procedure.

Feedback traps for virtual potentials

Feedback traps are tools for trapping and manipulating single charged objects, such as molecules in solution. An alternative to optical tweezers and other single-molecule techniques, they use feedback to counteract the Brownian motion of a molecule of interest. The trap first acquires information about a molecule's position and then applies an electric feedback force to move the molecule. Since electric forces are stronger than optical forces at small scales, feedback traps are the best way to trap single molecules without 'touching' them (e.g. by putting them in a small box or attaching them to a tether). Feedback traps can do more than trap molecules: they can also subject a target object to forces that are calculated to be the gradient of a desired potential function U(x). If the feedback loop is fast enough, it creates a virtual potential whose dynamics will be very close to those of a particle in an actual potential U(x). But because the dynamics are entirely a result of the feedback loop-absent the feedback, there is only an object diffusing in a fluid-we are free to specify and then manipulate in time an arbitrary potential U(x,t). Here, we review recent applications of feedback traps to studies on the fundamental connections between information and thermodynamics, a topic where feedback plays an even more fundamental role. We discuss how recursive maximum-likelihood techniques allow continuous calibration, to compensate for drifts in experiments that last for days. We consider ways to estimate work and heat, using them to measure fluctuating energies to a precision of ±0.03 kT over these long experiments. Finally, we compare work and heat measurements of the costs of information erasure, the Landauer limit of kT ln 2 per bit of information erased. We argue that, when you want to know the average heat transferred to a bath in a long protocol, you should measure instead the average work and then infer the heat using the first law of thermodynamics.This article is part of the themed issue 'Horizons of cybernetical physics'.

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.

Erasure without Work in an Asymmetric Double-Well Potential

According to Landauer's principle, erasing a memory requires an average work of at least kTln2 per bit. Recent experiments have confirmed this prediction for a one-bit memory represented by a symmetric double-well potential. Here, we present an experimental study of erasure for a memory encoded in an asymmetric double-well potential. Using a feedback trap, we find that the average work to erase can be less than kTln2. Surprisingly, erasure protocols that differ subtly give measurably different values for the asymptotic work, a result we explain by showing that one protocol is symmetric with the respect to time reversal, while the other is not. The differences between the protocols help clarify the distinctions between thermodynamic and logical reversibility.

Thermodynamic geometry of minimum-dissipation driven barrier crossing

We explore the thermodynamic geometry of a simple system that models the bistable dynamics of nucleic acid hairpins in single molecule force-extension experiments. Near equilibrium, optimal (minimum-dissipation) driving protocols are governed by a generalized linear response friction coefficient. Our analysis demonstrates that the friction coefficient of the driving protocols is sharply peaked at the interface between metastable regions, which leads to minimum-dissipation protocols that drive rapidly within a metastable basin, but then linger longest at the interface, giving thermal fluctuations maximal time to kick the system over the barrier. Intuitively, the same principle applies generically in free energy estimation (both in steered molecular dynamics simulations and in single-molecule experiments), provides a design principle for the construction of thermodynamically efficient coupling between stochastic objects, and makes a prediction regarding the construction of evolved biomolecular motors.

Nonequilibrium work energy relation for non-Hamiltonian dynamics

Recent years have witnessed major advances in our understanding of nonequilibrium processes. The Jarzynski equality, for example, provides a link between equilibrium free energy differences and finite-time nonequilibrium dynamics. We propose a generalization of this relation to non-Hamiltonian dynamics, relevant for active matter systems, continuous feedback, and computer simulation. Surprisingly, this relation allows us to calculate the free energy difference between the desired initial and final equilibrium states using arbitrary dynamics. As a practical matter, this dissociation between the dynamics and the initial and final states promises to facilitate a range of techniques for free energy estimation in a single universal expression.

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.

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.

Guaranteed energy-efficient bit reset in finite time

Landauer's principle states that it costs at least kBTln2 of work to reset one bit in the presence of a heat bath at temperature T. The bound of kBTln2 is achieved in the unphysical infinite-time limit. Here we ask what is possible if one is restricted to finite-time protocols. We prove analytically that it is possible to reset a bit with a work cost close to kBTln2 in a finite time. We construct an explicit protocol that achieves this, which involves thermalizing and changing the system's Hamiltonian so as to avoid quantum coherences. Using concepts and techniques pertaining to single-shot statistical mechanics, we furthermore prove that the heat dissipated is exponentially close to the minimal amount possible not just on average, but guaranteed with high confidence in every run. Moreover, we exploit the protocol to design a quantum heat engine that works near the Carnot efficiency in finite time.