Related papers: Erasure without work in an asymmetric, double-well…
We apply evolutionary reinforcement learning to a simulation model in order to identify efficient time-dependent erasure protocols for a physical realization of a one-bit memory by an underdamped mechanical cantilever. We show that these…
The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method,…
An important step to incorporate information in the second law of thermodynamics was done by Landauer, showing that the erasure of information implies an increase in heat. Most attempts to justify Landauer's erasure principle are based on…
We briefly address Landauer's Principle and some related issues in thermal demons. We show that an error-free Turing computer works in the zero-entropy limit, which proves Landauer's derivation incorrect. To have a physical logic gate,…
Information erasure inevitably leads to heat dissipation. Minimizing this dissipation will be crucial for developing small-scale information processing systems, but little is known about the optimal procedures required. We have obtained…
We show that information in quantum memory can be erased and recovered perfectly if it is necessary. That the final states of environment are completely determined by the initial states of the system allows that an easure operation can be…
We study the problem of the energetic cost of information erasure by looking at it through the lens of the Jarzynski equality. We observe that the Landauer bound, $\langle W \rangle \geq kT \ln 2$, on average dissipated work $\langle W…
Landauer's principle states that the erasure of information must be a dissipative process. In this paper, we carefully analyze the recording and erasure of information on a physical memory. On the one hand, we show that in order to record…
According to Landauer's principle, erasure of information is the only part of a computation process that unavoidably involves energy dissipation. If done reversibly, such an erasure generates the minimal heat of $k_BT\ln 2$ per erased bit…
New concepts from nonequilibrium thermodynamics are used to show that Landauer's principle can be understood in terms of time asymmetry in the dynamical randomness generated by the physical process of the erasure of digital information. In…
Recent experiments have implemented resetting by means of a time-varying external harmonic trap whereby the trap stiffness is changed from an initial to a final value in finite-time and then the system is reset when it relaxes to an…
The Landauer principle asserts that the energy cost of erasure of one bit of information by the action of a thermal reservoir in equilibrium at temperature T is never less than $kTlog 2$. We discuss Landauer's principle for quantum…
Landauer's bound is the minimum thermodynamic cost for erasing one bit of information. As this bound is achievable only for quasistatic processes, finite-time operation incurs additional energetic costs. We find a tight finite-time…
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…
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,…
Landauer's principle states that the logical irreversibility of an operation, such as erasing one bit, whatever its physical implementation, necessarily implies its thermodynamical irreversibility. In this paper, a very simple…
Modern digital electronics support remarkably reliable computing, especially given the challenge of controlling nanoscale logical components that interact in fluctuating environments. However, we demonstrate that the high-reliability limit…
We consider the problem of performing linear regression over a stream of $d$-dimensional examples, and show that any algorithm that uses a subquadratic amount of memory exhibits a slower rate of convergence than can be achieved without…
The classic Landauer bound can be lowered when erasure errors are permitted. Here we point out that continuous phase transitions characterized by an order parameter can also be viewed as information erasure by resetting a certain number of…
Landauer's erasure principle is generalized to nondeterministic processes on systems having an arbitrary number of non-symmetrical logical states. The condition that the process is applied in the same way, irrespective of the initial…