Related papers: Generalized Reversible Computing
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…
The Landauer principle sets a fundamental thermodynamic constraint on the minimum amount of heat that must be dissipated to erase one logical bit of information through a quasi-statically slow protocol. For finite time information erasure,…
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…
It is widely accepted that information erasure entails heat dissipation. Here we analyze asymmetric memory states to show that this energy cost can be shuffled around to any step in a write-erase cycle and need not accompany the logically…
The Landauer principle bridges the energetic cost and information processing, showing that irreversible computation inevitably demands energy dissipation. As energy demands from computation continue to rise, approximate computing has…
Landauer's erasure principle states that any irreversible erasure protocol of a single bit memory needs work of at least $k_B T ln2.$ Recent proof of concept experiments has demonstrated that the erasure protocols with work close to the…
The Landauer principle establishes a lower bound in the amount of energy that should be dissipated in the erasure of one bit of information. The specific value of this dissipated energy is tightly related to the definition of entropy. In…
The erasure of a classical bit of information is a dissipative process. The minimum heat produced during this operation has been theorized by Rolf Landauer in 1961 to be equal to $k_B T \ln 2$ and takes the name of Landauer limit, Landauer…
Reversible computation has been recognised as a potential solution to the technological bottleneck in the future of computing machinery. Rolf Landauer determined the lower limit for power dissipation in computation and noted that…
The Landauer's principle, a cornerstone of information thermodynamics, provides a fundamental lower bound on the energetic cost of information erasure in terms of the information content change. However, its traditional formulation is…
Landauer's principle makes a strong connection between information theory and thermodynamics by stating that erasing a one-bit memory at temperature $T_0$ requires an average energy larger than $W_{LB}=k_BT_0 \ln2$, with $k_B$ Boltzmann's…
There is one, and only one way, consistent with fundamental physics, that the efficiency of general digital computation can continue increasing indefinitely, and that is to apply the principles of reversible computing. We need to begin…
Within an inherently classical perspective, there is always an unavoidable energy cost associated with the information deletion and this common lore is at the heart of the Landauer's conjecture that does not impose, per se, any relevant…
The thermodynamic cost of resetting an arbitrary initial state to a particular desired state is lower bounded by Landauer's bound. However, here we demonstrate that this lower bound is necessarily unachievable for nearly every initial…
Information processing typically occurs via the composition of modular units, such as universal logic gates. The benefit of modular information processing, in contrast to globally integrated information processing, is that complex global…
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…
Computations implemented on a physical system are fundamentally limited by the laws of physics. A prominent example for a physical law that bounds computations is the Landauer principle. According to this principle, erasing a bit of…
Landauer's principle sets fundamental thermodynamical constraints for classical and quantum information processing, thus affecting not only various branches of physics, but also of computer science and engineering. Despite its importance,…
Recent analyses have calculated the minimal thermodynamic work required to perform a computation pi when two conditions hold: the output of pi is independent of its input (e.g., as in bit erasure); we use a physical computer C to implement…
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…