A cost/speed/reliability tradeoff to erasing
From Thermodynamics of Computation
- reference groups
- Computer Science Theory
- General Non-equilibrium Statistical Physics
- Stochastic Thermodynamics
- author-supplied keywords
- keywords
- authors
- Manoj Gopalkrishnan
- title
- A cost/speed/reliability tradeoff to erasing
- type
- conference_proceedings
- year
- 2015
- pages
- 192-201
- volume
- 9252
- publisher
- Springer Verlag
- abstract
- 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 problem formulation captures the tradeoff between speed, reliability, and the Kullback-Leibler (KL) cost required to erase a bit. We show that rapid erasing of a reliable bit costs at least [math]\displaystyle{ \log 2 - \log\left(1 - \operatorname{e}^{-\frac{\tau_e}{\tau_r}}\right) \gt \log 2 }[/math], which goes to [math]\displaystyle{ \frac{1}{2} \log\frac{2\tau_r}{\tau_e} }[/math] when [math]\displaystyle{ \tau_r\gt \gt \tau_e }[/math].
Counts
- Citation count
- Page views
- 13
Identifiers
- doi: 10.1007/978-3-319-21819-9_14 (Google search)
- issn: 16113349
- sgr: 84943625259
- isbn: 9783319218182
- arxiv: https://arxiv.org/abs/1410.1710
- scopus: 2-s2.0-84943625259
- pui: 606383559