Related papers: Finite-time Landauer principle
Landauer's erasure principle exposes an intrinsic relation between thermodynamics and information theory: the erasure of information stored in a system, S, requires an amount of work proportional to the entropy of that system. This entropy,…
The construction of models from data is a significant contributor to the energetic costs of computation. Because of this, understanding how foundational thermodynamic bounds apply to modeling algorithms will be increasingly important. Here,…
Quantum state engineering and quantum computation rely on information erasure procedures that, up to some fidelity, prepare a quantum object in a pure state. Such processes occur within Landauer's framework if they rely on an interaction…
We consider the technologically relevant costs of operating a reliable bit that can be erased rapidly. We find that both erasing and reliability times are non-monotonic in the underlying friction, leading to a trade-off between erasing…
Landauer's principle shows that the minimum energy cost to reset a classical bit in a bath with temperature $T$ is $k_{B}T\ln2$ in the infinite time. However, the task to reset the bit in finite time has posted a new challenge, especially…
Information is central to thermodynamics, providing the grounds to the formulation of the theory in powerful abstract statistical terms. One must not forget, however, that, as put by Landauer, {\it information is physical}. This means that…
Information is physical but information is also processed in finite time. Where computing protocols are concerned, finite-time processing in the quantum regime can dynamically generate coherence. Here we show that this can have significant…
Using the operational framework of completely positive, trace preserving operations and thermodynamic fluctuation relations, we derive a lower bound for the heat exchange in a Landauer erasure process on a quantum system. Our bound comes…
The tradeoff relation between speed and cost is a central issue in designing fast and efficient information processing devices. We derive an achievable bound on thermodynamic cost for obtaining information through finite-time…
We study the thermodynamics of a Brownian particle under the influence of a time multiplexed harmonic potential of finite width. The memory storage mechanism and the erasure protocol realized by time multiplexed potentials are utilized to…
Landauer's principle states that information erasure requires heat dissipation. Landauer's original result focused on equilibrium memories. We here investigate the reset of information stored in a nonequilibrium state of a symmetric…
In this work, we introduce a generalization of the Landauer bound for erasure processes that stems from absolutely irreversible dynamics. Assuming that the erasure process is carried out in an absolutely irreversible way so that the…
Conventional computing has many sources of heat dissipation, but one of these--the Landauer limit--poses a fundamental lower bound of 1 bit of entropy per bit erased. 'Reversible Computing' avoids this source of dissipation, but is…
We propose one of the very few constructive consequences of the second law of thermodynamics. More specifically, we present protocols for secret-key establishment and multiparty computation the security of which is based fundamentally on…
Landauer argued that the process of erasing the information stored in a memory device incurs an energy cost in the form of a minimum amount of mechanical work. We find, however, that this energy cost can be reduced to zero by paying a cost…
We measured the energy efficiency of information erasure using silicon DRAM cells capable of counting charges on capacitors at the single-electron level. Our measurements revealed that the efficiency decreased as the erasure error…
A restricted form of Landauer's Principle, independent of computational considerations, is shown to hold for thermal systems by reference to the joint entropy associated with conjugate observables. It is shown that the source of the…
We investigate the performance of majority-logic decoding in both reversible and finite-time information erasure processes performed on macroscopic bits that contain $N$ microscopic binary units. While we show that for reversible erasure…
We confirm Landauer's 1961 hypothesis that reducing the number of possible macroscopic states in a system by a factor of two requires work of at least kT ln 2. Our experiment uses a colloidal particle in a time-dependent, virtual potential…
Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the…