相关论文: Extending Landauer's Bound from Bit Erasure to Arb…
According to the Landauer principle, any logically irreversible process accompanies entropy production, which results in heat dissipation in the environment. Erasing of information, one of the primary logically irreversible processes, has a…
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,…
Landauer discussed the minimum energy necessary for computation and stated that erasure of information is accompanied by heat generation to the amount of kT ln2/bit. Modifying the above statement, we claim that erasure of information is…
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…
The energy cost of erasing a bit of information was fundamentally lower bounded by Landauer, in terms of the temperature of its environment: $W\geq k_\mathrm{B} T \ln 2$. However, in real electronic devices, the information-bearing system…
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…
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…
Landauer's principle bounds the heat generated by logical operations, but in practice the thermodynamic cost of computation is dominated by the control systems that implement logic. CMOS gates dissipate energy far above the Landauer bound,…
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…
We characterize which coordinates of a factored state space determine optimal actions. For $\mathcal{D}=(A,S,U)$ with $S=X_1\times\cdots\times X_n$, coordinate set $I$ is sufficient if…
It is now well established that there is no lower bound for the energy dissipated during a computation. The relevance of the zero-energy limit is unclear, however, because it entails computations that are unreliable or infinitely slow, or…
Energy consumption in solving computational problems has been gaining growing attention as one of the key performance measures for computers. Quantum computation is known to offer advantages over classical computation in terms of various…
Landauer's principle states that erasure of each bit of information in a system requires at least a unit of energy $k_B T \ln 2$ to be dissipated. In return, the blank bit may possibly be utilized to extract usable work of the amount $k_B T…
Energy consumption of computing has found increasing prominence but the area still suffers from the lack of a consolidated formal theory. In this paper, a theory for the energy consumption of computing is structured as an axiomatic system.…
We propose a duality between thermodynamics and computational complexity, elevating the difficulty of a computational task to the status of a thermodynamic variable. By introducing a complexity measure C as a novel coordinate, we formulate…
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…
The fundamental lower bounds of the thermodynamic energy cost (work) needed for the measurement and the erasure of information are found. The lower bound for the erasure vindicates the "Landauer's principle" for a special case, but…
Framing computation as the transformation of metastable memories, we explore its fundamental thermodynamic limits. The true power of information follows from a novel decomposition of nonequilibrium free energy derived here, which provides a…
Modern computing architectures are vastly more energy-dissipative than fundamental thermodynamic limits suggest, motivating the search for principled approaches to low-dissipation logical operations. We formulate multi-bit logical gates…
Developing a thermodynamic theory of computation is a challenging task at the interface of non-equilibrium thermodynamics and computer science. In particular, this task requires dealing with difficulties such as stochastic halting times,…