Santa Fe Institute Collaboration Platform

Thermodynamics of Computation

A cost/speed/reliability tradeoff to erasing

From Thermodynamics of Computation
Revision as of 09:18, April 29, 2019 by Wikiworks (talk | contribs) (use Math)
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 , which goes to when .


Counts

Citation count
Page views
12

Identifiers