Refining Landauer’s Stack: Balancing Error and Dissipation When Erasing Information

Wimsatt, Gregory W.; Boyd, Alexander B.; Riechers, Paul M.; Crutchfield, James P.

doi:10.1007/s10955-021-02733-1

Cited by 11 publications

(6 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It seems not. Landauer's theory and follow-on results [61][62][63] and recent experiments [64,65] verified the lower bound.…”

Section: Discussionsupporting

confidence: 56%

Gigahertz Sub-Landauer Momentum Computing

J.¹,

Crutchfield²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

We introduce a fast and highly-efficient physically-realizable bit swap. Employing readily available and scalable Josephson junction microtechnology, the design implements the recently introduced paradigm of momentum computing. Its nanosecond speeds and sub-Landauer thermodynamic efficiency arise from dynamically storing memory in momentum degrees of freedom. As such, during the swap, the microstate distribution is never near equilibrium and the memory-state dynamics fall far outside of stochastic thermodynamics that assumes detailed-balanced Markovian dynamics. The device implements a bit-swap operation-a fundamental operation necessary to build reversible universal computing. Extensive, physically-calibrated simulations demonstrate that device performance is robust and that momentum computing can support thermodynamically-efficient, high-speed, large-scale general-purpose computing.

show abstract

“…It seems not. Landauer's theory and follow-on results [61][62][63] and recent experiments [64,65] verified the lower bound.…”

Section: Discussionsupporting

confidence: 56%

Gigahertz Sub-Landauer Momentum Computing

J.¹,

Crutchfield²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Within this class of computations, it is possible to design a protocol that gives perfect erasure in finite time and at finite cost. This demonstrates that, while alternate computational frameworks have a divergent error-dissipation tradeoff [ 28 , 48 ], counterdiabatic computing allows for zero-error logical operations without divergent energy costs.…”

Section: Counterdiabatic Erasurementioning

confidence: 99%

“…In contrast, if a computation is designed such that the equilibrium distribution exactly matches the desired distribution after the computation, with , then the energy landscape is given by for . Hamiltonian control of the system is the external driving of the system, determined in experimental systems perhaps by a preprogrammed virtual potential [ 47 ] or time varying magnetic fluxes applied to the system [ 48 ]. Thus, the potential energy landscape can be thought of as the external configuration of our memory storage device, which the experimenter can control directly.…”

Section: Counterdiabatic Erasurementioning

confidence: 99%

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

et al. 2022

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…One can use this expression to bound the entropy difference of a system from a wide array of limited observations of the system. This includes coarse graining time [21,22], system state space [15,21,22], as well as many other possibilities [23][24][25].…”

Section: Trajectory Partition Second Lawmentioning

confidence: 99%

Trajectory Class Fluctuation Theorem

Wimsatt¹,

Boyd²,

Crutchfield³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

The Trajectory Class Fluctuation Theorem (TCFT) substantially strengthens the Second Law of Thermodynamics-that, in point of fact, can be a rather weak bound on resource fluxes. Practically, it improves empirical estimates of free energies, a task known to be statistically challenging, and has diagnosed successful and failed information processing in experimentally-implemented Josephsonjunction information engines. The development here justifies that empirical analysis, explicating its mathematical foundations. The TCFT reveals the thermodynamics induced by macroscopic system transformations for each measurable subset of system trajectories. In this, it directly combats the statistical challenge of extremely rare events that dominate thermodynamic calculations. And, it reveals new forms of free energy-forms that can be solved for analytically and practically estimated. Conceptually, the TCFT unifies a host of previously-established fluctuation theorems, interpolating from Crooks' Detailed Fluctuation Theorem (single trajectories) to Jarzynski's Equality (trajectory ensembles).

show abstract

Refining Landauer’s Stack: Balancing Error and Dissipation When Erasing Information

Cited by 11 publications

References 47 publications

Gigahertz Sub-Landauer Momentum Computing

Gigahertz Sub-Landauer Momentum Computing

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

Trajectory Class Fluctuation Theorem

Contact Info

Product

Resources

About