Universal Bound on Energy Cost of Bit Reset in Finite Time.

@article{Zhen2021UniversalBO,
  title={Universal Bound on Energy Cost of Bit Reset in Finite Time.},
  author={Yi-Zheng Zhen and Dario Egloff and Kavan Modi and Oscar C. O. Dahlsten},
  journal={Physical review letters},
  year={2021},
  volume={127 19},
  pages={
          190602
        }
}
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… 

Figures from this paper

Inverse linear vs. exponential scaling of work penalty in finite-time bit reset
Yi-Zheng Zhen, 2 Dario Egloff, 4 Kavan Modi, and Oscar Dahlsten Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics, University of Science and Technology of
Experimental verification of the work fluctuation-dissipation relation for information-to-work conversion
David Barker, Matteo Scandi, Sebastian Lehmann, Claes Thelander, Kimberly A. Dick, 3 Mart́ı Perarnau-Llobet, and Ville F. Maisi NanoLund and Solid State Physics, Lund University, Box 118, 22100 Lund,

References

SHOWING 1-10 OF 72 REFERENCES
Guaranteed energy-efficient bit reset in finite time.
TLDR
It is proved analytically that it is possible to reset a bit with a work cost close to kBTln2 in a finite time, and an explicit protocol is constructed that achieves this, which involves thermalizing and changing the system's Hamiltonian so as to avoid quantum coherences.
Optimal finite-time erasure of a classical bit.
TLDR
Close agreement is demonstrated between the exact optimal cycle and the protocol found using a linear response framework for deletion of a classical bit of information stored by the position of a particle diffusing in a double-well potential.
Quantum Landauer erasure with a molecular nanomagnet
The erasure of a bit of information is an irreversible operation whose minimal entropy production of kB ln 2 is set by the Landauer limit1. This limit has been verified in a variety of classical
Heat generation required by information erasure.
  • Shizume
  • Physics, Medicine
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 1995
TLDR
A basic model of the memory is dealt with, a system including a particle making the Brownian motion in a time-dependent potential well, and it is shown that Landauer's claim holds rigorously if the random force acting on the particle is white and Gaussian, even if the potential is not static.
The thermodynamics of computation—a review
Computers may be thought of as engines for transforming free energy into waste heat and mathematical work. Existing electronic computers dissipate energy vastly in excess of the mean thermal
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
Quantum speed limits in open system dynamics.
TLDR
A time-energy uncertainty relation is derived for open quantum systems undergoing a general, completely positive, and trace preserving evolution which provides a bound to the quantum speed limit.
Erasure without Work in an Asymmetric Double-Well Potential.
TLDR
Surprisingly, erasure protocols that differ subtly give measurably different values for the asymptotic work, a result that helps clarify the distinctions between thermodynamic and logical reversibility.
Tight, robust, and feasible quantum speed limits for open dynamics
Starting from a geometric perspective, we derive a quantum speed limit for arbitrary open quantum evolution, which could be Markovian or non-Markovian, providing a fundamental bound on the time taken
Approaching the physical limits of computing
  • M. Frank
  • Computer Science
    35th International Symposium on Multiple-Valued Logic (ISMVL'05)
  • 2005
TLDR
This work reviews the physical and architectural requirements that must be met if real machines are to break through the barriers preventing further progress, and approach the true fundamental physical limits to computing.
...
1
2
3
4
5
...