Universal Bound on Energy Cost of Bit Reset in Finite Time
Yi-Zheng Zhen, Dario Egloff, Kavan Modi, Oscar Dahlsten

TL;DR
This paper establishes a fundamental, hardware-independent lower bound on the additional energy required to reset a bit in finite time, linking energy dissipation to protocol duration and error, impacting irreversible computer speed limits.
Contribution
It derives a universal, closed-form lower bound on the energy cost of bit reset in finite time within a stochastic process framework, applicable to various systems.
Findings
Lower bound depends on reset time and error probability.
Bound applies to both discrete and continuous systems.
Energy penalty increases as reset time decreases.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
