相关论文: Extending Landauer's Bound from Bit Erasure to Arb…

Landauer's principle places a fundamental lower limit on the work required to perform a logically irreversible operation. Logically reversible gates provide a way to avoid these work costs, and also simplify the task of making the…

We develop a physics-based model for classical computation based on autonomous quantum thermal machines. These machines consist of few interacting quantum bits (qubits) connected to several environments at different temperatures. Heat flows…

Near zero-energy computing describes the concept of executing logic operations below the (kBT ln 2) energy limit. Landauer discussed that it is impossible to break this limit as long as the computations are performed in the conventional,…

Accurately quantifying the thermodynamic work costs of quantum operations is essential for the continued development and optimisation of emerging quantum technologies. This present a significant challenge in regimes of rapid control within…

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 the erasure of one bit of information requires the free energy kT ln 2. We argue that the reliability of the bit erasure process is bounded by the accuracy inherent in the statistical state of the energy…

Turing Machines (TMs) are the canonical model of computation in computer science and physics. We combine techniques from algorithmic information theory and stochastic thermodynamics to analyze the thermodynamic costs of TMs. We consider two…

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…

Computational complexity is a particularly important objective. The idea of Landauer principle was extended through mapping three classic problems (sorting,ordered searching and max of N unordered numbers) into Maxwell demon thought…

We outline the construction of a molecular system that could, in principle, implement a thermodynamically reversible Universal Turing Machine (UTM). By proposing a concrete-albeit idealised-design and operational protocol, we reveal…

We initiate the systematic study of the energy complexity of algorithms (in addition to time and space complexity) based on Landauer's Principle in physics, which gives a lower bound on the amount of energy a system must dissipate if it…

Biological sensory systems react to changes in their surroundings. They are characterized by fast response and slow adaptation to varying environmental cues. Insofar as sensory adaptive systems map environmental changes to changes of their…

I give a quick overview of some of the theoretical background necessary for using modern non-equilibrium statistical physics to investigate the thermodynamics of computation. I first present some of the necessary concepts from information…

If the 20th century was known for the computational revolution, what will the 21st be known for? Perhaps the recent strides in the nascent fields of molecular programming and biological computation will help bring about the 'Coming Era of…

Landauer's principle states that erasing a bit of information at fixed temperature T costs at least kT ln 2 units of work. Here we investigate erasure at varying temperature, to which Landauer's result does not apply. We formulate bit…

Landauer's principle asserts that any computation has an unavoidable energy cost that grows proportionally to its degree of logical irreversibility. But even a logically reversible operation, when run on a physical processor that operates…

We introduce a framework designed to analyze the thermodynamics of an abstractly defined logical computer like a deterministic finite automaton (DFA) or a Turing machine, without specifying any extraneous parameters (like rate matrices,…

We propose a novel bound on the mimimum dissipation required in any circumstances to transfer a certain amount of charge through any resistive device. We illustrate it on the task of writing a logical 1 (encoded as a prescribed voltage)…

Estimates of energy usage in layers of computing from devices to algorithms have been determined and analyzed. Building on the previous analysis [3], energy needed from single devices and systems including three large-scale computing…

Nonequilibrium information thermodynamics determines the minimum energy dissipation to reliably erase memory under time-symmetric control protocols. We demonstrate that its bounds are tight and so show that the costs overwhelm those implied…