Guaranteed energy-efficient bit reset in finite time

General limit to thermodynamic annealing performance

Annealing has proven highly successful in finding minima in a cost landscape. Yet, depending on the landscape, systems often converge towards local minima rather than global ones. In this Letter, we analyze the conditions for which annealing is approximately successful in finite time. We connect annealing to stochastic thermodynamics to derive a general bound on the distance between the system state at the end of the annealing and the ground state of the landscape. This distance depends on the amount of state updates of the system and the accumulation of nonequilibrium energy, two protocol and energy landscape-dependent quantities which we show are in a trade-off relation. We describe how to bound the two quantities both analytically and physically. This offers a general approach to assess the performance of annealing from accessible parameters, both for simulated and physical implementations.

Bound on annealing performance from stochastic thermodynamics, with application to simulated annealing

Annealing is the process of gradually lowering the temperature of a system to guide it towards its lowest energy states. In an accompanying paper [Y. Luo et al., Phys. Rev. E 108, L052105 (2023)10.1103/PhysRevE.108.L052105], we derived a general bound on annealing performance by connecting annealing with stochastic thermodynamics tools, including a speed limit on state transformation from entropy production. We here describe the derivation of the general bound in detail. In addition, we analyze the case of simulated annealing with Glauber dynamics in depth. We show how to bound the two case-specific quantities appearing in the bound, namely the activity, a measure of the number of microstate jumps, and the change in relative entropy between the state and the instantaneous thermal state, which is due to temperature variation. We exemplify the arguments by numerical simulations on the Sherrington-Kirkpatrick (SK) model of spin glasses.

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.

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.

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.

Quantum Fluctuations Hinder Finite-Time Information Erasure near the Landauer Limit

Information is physical but information is also processed in finite time. Where computing protocols are concerned, finite-time processing in the quantum regime can dynamically generate coherence. Here we show that this can have significant thermodynamic implications. We demonstrate that quantum coherence generated in the energy eigenbasis of a system undergoing a finite-time information erasure protocol yields rare events with extreme dissipation. These fluctuations are of purely quantum origin. By studying the full statistics of the dissipated heat in the slow-driving limit, we prove that coherence provides a non-negative contribution to all statistical cumulants. Using the simple and paradigmatic example of single bit erasure, we show that these extreme dissipation events yield distinct, experimentally distinguishable signatures.

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.

Novel Technique for Robust Optimal Algorithmic Cooling

Heat-bath algorithmic cooling provides algorithmic ways to improve the purity of quantum states. These techniques are complex iterative processes that change from each iteration to the next and this poses a significant challenge to implementing these algorithms. Here, we introduce a new technique that on a fundamental level, shows that it is possible to do algorithmic cooling and even reach the cooling limit without any knowledge of the state and using only a single fixed operation, and on a practical level, presents a more feasible and robust alternative for implementing heat-bath algorithmic cooling. We also show that our new technique converges to the asymptotic state of heat-bath algorithmic cooling and that the cooling algorithm can be efficiently implemented; however, the saturation could require exponentially many iterations and remains impractical. This brings heat-bath algorithmic cooling to the realm of feasibility and makes it a viable option for realistic application in quantum technologies.

Organic molecule fluorescence as an experimental test-bed for quantum jumps in thermodynamics

We demonstrate with an experiment how molecules are a natural test bed for probing fundamental quantum thermodynamics. Single-molecule spectroscopy has undergone transformative change in the past decade with the advent of techniques permitting individual molecules to be distinguished and probed. We demonstrate that the quantum Jarzynski equality for heat is satisfied in this set-up by considering the time-resolved emission spectrum of organic molecules as arising from quantum jumps between states. This relates the heat dissipated into the environment to the free energy difference between the initial and final state. We demonstrate also how utilizing the quantum Jarzynski equality allows for the detection of energy shifts within a molecule, beyond the relative shift.

Thermodynamics of complexity and pattern manipulation

Many organisms capitalize on their ability to predict the environment to maximize available free energy and reinvest this energy to create new complex structures. This functionality relies on the manipulation of patterns-temporally ordered sequences of data. Here, we propose a framework to describe pattern manipulators-devices that convert thermodynamic work to patterns or vice versa-and use them to build a "pattern engine" that facilitates a thermodynamic cycle of pattern creation and consumption. We show that the least heat dissipation is achieved by the provably simplest devices, the ones that exhibit desired operational behavior while maintaining the least internal memory. We derive the ultimate limits of this heat dissipation and show that it is generally nonzero and connected with the pattern's intrinsic crypticity-a complexity theoretic quantity that captures the puzzling difference between the amount of information the pattern's past behavior reveals about its future and the amount one needs to communicate about this past to optimally predict the future.

A general derivation and quantification of the third law of thermodynamics

The most accepted version of the third law of thermodynamics, the unattainability principle, states that any process cannot reach absolute zero temperature in a finite number of steps and within a finite time. Here, we provide a derivation of the principle that applies to arbitrary cooling processes, even those exploiting the laws of quantum mechanics or involving an infinite-dimensional reservoir. We quantify the resources needed to cool a system to any temperature, and translate these resources into the minimal time or number of steps, by considering the notion of a thermal machine that obeys similar restrictions to universal computers. We generally find that the obtainable temperature can scale as an inverse power of the cooling time. Our results also clarify the connection between two versions of the third law (the unattainability principle and the heat theorem), and place ultimate bounds on the speed at which information can be erased.

Beyond heat baths: Generalized resource theories for small-scale thermodynamics

Thermodynamics has recently been extended to small scales with resource theories that model heat exchanges. Real physical systems exchange diverse quantities: heat, particles, angular momentum, etc. We generalize thermodynamic resource theories to exchanges of observables other than heat, to baths other than heat baths, and to free energies other than the Helmholtz free energy. These generalizations are illustrated with "grand-potential" theories that model movements of heat and particles. Free operations include unitaries that conserve energy and particle number. From this conservation law and from resource-theory principles, the grand-canonical form of the free states is derived. States are shown to form a quasiorder characterized by free operations, d majorization, the hypothesis-testing entropy, and rescaled Lorenz curves. We calculate the work distillable from-and we bound the work cost of creating-a state. These work quantities can differ but converge to the grand potential in the thermodynamic limit. Extending thermodynamic resource theories beyond heat baths, we open diverse realistic systems to modeling with one-shot statistical mechanics. Prospective applications such as electrochemical batteries are hoped to bridge one-shot theory to experiments.