Related papers: Inverse linear versus exponential scaling of work …
We consider how the energy cost of bit reset scales with the time duration of the protocol. Bit reset necessarily takes place in finite time, where there is an extra penalty on top of the quasistatic work cost derived by Landauer. This…
The goal of thermodynamic optimal control theory is to find protocols to change the state of a system from an initial to a desired final distribution, within a finite time, with the least possible expenditure of work. The optimal protocol…
Future miniaturization and mobilization of computing devices requires energy parsimonious `adiabatic' computation. This is contingent on logical reversibility of computation. An example is the idea of quantum computations which are…
In practice, qubit reset must be operated in an extremely short time, which incurs a thermodynamic cost within multiple orders of magnitude above the Landauer bound. We present a general framework to determine the minimal thermodynamic cost…
We study the finite-time erasure of a one-bit memory consisting of a one-dimensional double-well potential, with each well encoding a memory macrostate. We focus on setups that provide full control over the form of the potential-energy…
Solving inverse problems with iterative algorithms is popular, especially for large data. Due to time constraints, the number of possible iterations is usually limited, potentially affecting the achievable accuracy. Given an error one is…
Reversible computing can reduce the energy dissipation of computation, which can improve cost-efficiency in some contexts. But the practical applicability of this method depends sensitively on the space and time overhead required by…
The fundamental energy cost of irreversible computing is given by the Landauer bound of $kT \ln2$~/bit. However, this limit is only achievable for infinite-time processes. We here determine the fundamental energy cost of finite-time…
Landauer's principle states that it costs at least kTln2 of work to reset one bit in the presence of a heat bath at temperature T. The bound of kTln2 is achieved in the unphysical infinite-time limit. Here we ask what is possible if one is…
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit.…
It is now widely accepted that the CMOS technology implementing irreversible logic will hit a scaling limit beyond 2016, and that the increased power dissipation is a major limiting factor. Reversible computing can potentially require…
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…
Reversible simulation of irreversible algorithms is analyzed in the stylized form of a `reversible' pebble game. While such simulations incur little overhead in additional computation time, they use a large amount of additional memory space…
The NOT operation is a reversible transformation acting on a 1-bit logical state, and should be achievable in a physically reversible manner at no energetic cost. We experimentally demonstrate a bit-flip protocol based on the momentum of an…
It has long been known that to minimise the heat emitted by a deterministic computer during it's operation it is necessary to make the computation act in a logically reversible manner\cite{Lan61}. Such logically reversible operations…
A critical analysis of the feasibility of reversible computing is performed. The key question is: Is it possible to build a completely reversible computer? A closer look into the internal aspects of the reversible computing as well as the…
Even if a logical network consists of thermodynamically reversible gate operations, the computation process may have high dissipation rate if the gate implementation is controlled by external clock signals. It is an open question whether…
We study the thermodynamic cost associated with the erasure of one bit of information over a finite amount of time. We present a general framework for minimizing the average work required when full control of a system's microstates is…
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…
Energy costs of information processing are growing exponentially. Bit erasure is a key problem in this energy-information nexus, and a number of seminal relationships have been deduced regarding the relationship between thermodynamic costs…