Related papers: Extending Landauer's Bound from Bit Erasure to Arb…
Physical systems are often simulated using a stochastic computation where different final states result from identical initial states. Here, we derive the minimum energy cost of simulating a complex data set of a general physical system…
To make clear several issues relating with the thermodynamics of computations, we perform a simulation of a binary device using a Langevin equation. Based on our numerical results, we consider how to estimate thermodynamic entropy of…
Connections between information theory and thermodynamics have proven to be very useful to establish bounding limits for physical processes. Ideas such as Landauer's erasure principle and information assisted work extraction have greatly…
We study the complexity of estimating the partition function $\mathsf{Z}(\beta)=\sum_{x\in\chi} e^{-\beta H(x)}$ for a Gibbs distribution characterized by the Hamiltonian $H(x)$. We provide a simple and natural lower bound for quantum…
We introduce a fast and highly-efficient physically-realizable bit swap. Employing readily available and scalable Josephson junction microtechnology, the design implements the recently introduced paradigm of momentum computing. Its…
To scrutinize notions of computation and time complexity, we introduce and formally define an interactive model for computation that we call it the \emph{computation environment}. A computation environment consists of two main parts: i) a…
Quantum Gibbs state sampling algorithms generally suffer from either scaling exponentially with system size or requiring specific knowledge of spectral properties \textit{a priori}. Also, these algorithms require a large overhead of bath or…
Using a double-well potential as a physical memory, we study with experiments and numerical simulations the energy exchanges during erasure processes, and model quantitatively the cost of fast operation. Within the stochastic thermodynamics…
This study is the first experimental verification of the Landauer bound on a single spin, which is the smallest information carrier in size. We used four experiments (single spin experiment, giant spin experiment, nanomagnet experiment, and…
A key question in the thermodynamics of open quantum systems is how to partition thermodynamic quantities such as entropy, work, and internal energy between the system and its environment. We show that the only partition under which entropy…
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…
Computational complexity characterizes the usage of spatial and temporal resources by computational processes. In the classical theory of computation, e.g. in the Turing Machine model, computational processes employ only local space and…
We present an experiment in which a one-bit memory is constructed, using a system of a single colloidal particle trapped in a modulated double-well potential. We measure the amount of heat dissipated to erase a bit and we establish that in…
We analyze how the amount of work dissipated by a fixed nonequilibrium process depends on the initial distribution over states. Specifically, we compare the amount of dissipation when the process is used with some specified initial…
We experimentally demonstrate that highly structured distributions of work emerge during even the simple task of erasing a single bit. These are signatures of a refined suite of time-reversal symmetries in distinct functional classes of…
We analyze the thermodynamic cost of a logically reversible Brownian Turing machine operating in the first-passage time protocol based on the stochastic thermodynamics of resetting. In this framework, the thermodynamic cost of computation…
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…
This work examines the expected computational cost to determine an approximate global minimum of a class of cost functions characterized by the variance of coefficients. The cost function takes $N$-dimensional binary states as arguments and…
Since reversible computing requires preservation of all information throughout the entire computational process, this implies that all errors that appear as a result of the interaction of the information-carrying system with uncontrolled…
Extending the quantum formulation of [Phys. Rev. X 3, 041003 (2013)] to a more general setting for studying the thermodynamics of information processing including initial correlations, we generalize the second law of thermodynamics to…