Thermodynamic Cost of Random-Time Protocols
Izaak Neri
TL;DR
This work resolves apparent violations of the second law in systems driven by randomly timed external protocols by treating the random time $T$ as temporal information stored in a memory. Through a non-autonomous Maxwell-demon framework and Landauer's erasure principle, the authors show that the average erasure cost bounds the extractable work, restoring the Kelvin and Carnot limits when memory costs are included. They introduce a random-time Szilard engine in discrete and continuous versions, analyze finite-memory detectors, and compare measurement strategies for first-passage times, establishing a consistent information-thermodynamics framework for random-time control. The study demonstrates that temporal information behaves analogously to spatial information in thermodynamics and has broad implications for stochastic resetting and cyclic heat engines using random-time protocols.
Abstract
Systems that are driven by a randomly timed, external protocol can seemingly violate the second law of thermodynamics. We show that this thermodynamic paradox is resolved if the outcome of the random time is stored in a memory device. Specifically, we show that the average work required to erase the memory is always larger than the average work gained from the protocol. We also discuss concrete setups that measure random times directly without continuous monitoring. Taken together, this paper discusses the relationship between temporal information and thermodynamics. This framework is relevant for external protocols employing random times, such as, stochastic resetting protocols and cyclically driven heat engines that use randomly timed protocols.
