English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Inverse linear versus exponential scaling of work penalty in finite-time bit reset

MPS-Authors
/persons/resource/persons268566

Egloff,  Dario
Max Planck Institute for the Physics of Complex Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

2112.10449.pdf
(Preprint), 786KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Zhen, Y.-Z., Egloff, D., Modi, K., & Dahlsten, O. (2022). Inverse linear versus exponential scaling of work penalty in finite-time bit reset. Physical Review E, 105(4): 044147. doi:10.1103/PhysRevE.105.044147.


Cite as: https://hdl.handle.net/21.11116/0000-000A-CE1C-0
Abstract
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)] 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.