Related papers: Designing the Optimal Bit: Balancing Energetic Cos…
We study finite-time bit erasure in the context of majority-logic decoding. In particular, we calculate the minimum amount of work needed to erase a majority-logic bit when one has full control over the system dynamics. Although a single…
Energy costs of information processing are growing exponentially. Bit erasure is a key problem in this energy-information nexus, and a number of seminal relationships have been deduced regarding the relationship between thermodynamic costs…
The reliability of fast repeated erasures is studied experimentally and theoretically in a 1-bit underdamped memory. The bit is encoded by the position of a micro-mechanical oscillator whose motion is confined in a double well potential. To…
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…
We present a KL-control treatment of the fundamental problem of erasing a bit. We introduce notions of "reliability" of information storage via a reliability timescale $\tau_r$, and "speed" of erasing via an erasing timescale $\tau_e$. Our…
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…
Modern computing architectures are vastly more energy-dissipative than fundamental thermodynamic limits suggest, motivating the search for principled approaches to low-dissipation logical operations. We formulate multi-bit logical gates…
Nonequilibrium information thermodynamics determines the minimum energy dissipation to reliably erase memory under time-symmetric control protocols. We demonstrate that its bounds are tight and so show that the costs overwhelm those implied…
In this paper, we study the thermodynamic cost associated with erasing a static random access memory. By combining the stochastic thermodynamics framework of electronic circuits with machine learning-based optimization techniques, we show…
Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability. A main limitation of…
Modern digital electronics support remarkably reliable computing, especially given the challenge of controlling nanoscale logical components that interact in fluctuating environments. However, we demonstrate that the high-reliability limit…
Landauer's Principle states that the energy cost of information processing must exceed the product of the temperature and the change in Shannon entropy of the information-bearing degrees of freedom. However, this lower bound is achievable…
Using fault-tolerant constructions, computations performed with unreliable components can simulate their noiseless counterparts though the introduction of a modest amount of redundancy. Given the modest overhead required to achieve…
The problem of determining lower bounds for the energy cost of a given nanoscale design is addressed via a complexity theory-based approach. This paper provides a theoretical framework that is able to assess the trade-offs existing in…
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…
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…
In practical applications of quantum information science, quantum systems can have non-negligible interactions with the environment, and this generally degrades the power of quantum protocols as it introduces noise. Counteracting this by…
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…
Landauer's principle states that erasing a bit of information at fixed temperature T costs at least kT ln 2 units of work. Here we investigate erasure at varying temperature, to which Landauer's result does not apply. We formulate bit…
The min-cost matching problem suffers from being very sensitive to small changes of the input. Even in a simple setting, e.g., when the costs come from the metric on the line, adding two nodes to the input might change the optimal solution…