Speaker
Description
What is the work cost of recurrently erasing information in a finite time duration? For Markovian processes, many results are known in the context of the so-called "finite-time Landauer erasure principle". Two optimization problems that are typically studied in this context are: 1) Designing optimal protocols that transition between two specified distributions within finite time and 2) designing optimum protocols that minimize the cost needed to shift between two different potential energy landscapes, often harmonic, in finite time. In both cases this optimization problem can be used to place very general bounds on the least amount of work cost necessary to implement information erasure in finite time.
In this talk I will talk about some results (including our own) in this topic.