Paper Info
Title
A Cost/Speed/Reliability Tradeoff to Erasing
Abstract
We present a Kullback-Leibler (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 KL cost required to erase a bit. We show that rapid erasing of a reliable bit costs at least log 2 - log(1 - e (-tau e/tau r) ) > log 2, which goes to 1/2 log 2 tau(r)/tau(e) when tau(r) > > tau(e).
Year
DOI
Venue
2015
10.3390/e18050165
ENTROPY
Keywords
Field
DocType
erasing,information,thermodynamics,Kullback-Leibler,optimal control,reliability,speed,tradeoff
Discrete mathematics,Quantum mechanics,Markov chain,Entropy production,Information storage,Kullback–Leibler divergence,Physics
Conference
Volume
Issue
ISSN
18
5
1099-4300
Citations 
PageRank 
References 
0
0.34
0
Authors
1
Name
Order
Citations
PageRank
Manoj Gopalkrishnan1144.56