相关论文: Generalized Zurek's bound on the cost of an indivi…
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…
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…
In classical Markov jump processes, current fluctuations can only be reduced at the cost of increased dissipation. To explore how quantum effects influence this trade-off, we analyze the uncertainty of steady-state currents in Markovian…
The amount of heat generated by computers is rapidly becoming one of the main problems for developing new generations of information technology. The thermodynamics of computation sets the ultimate physical bounds on heat generation. A lower…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
We introduce a new technique to bound the fluctuations exhibited by a physical system, based on the Euclidean geometry of the space of observables. Through a simple unifying argument, we derive a sweeping generalization of so-called…
The precision and response of trajectory observables offer valuable insights into the behavior of nonequilibrium systems. For classical systems, trade-offs between these characteristics and thermodynamic costs, such as entropy production…
The energy cost of computation has emerged as a central challenge at the intersection of physics and computer science. Recent advances in statistical physics -- particularly in stochastic thermodynamics -- enable precise characterizations…
The process of state preparation, its transmission and subsequent measurement can be classically simulated through the communication of some amount of classical information. Recently, we proved that the minimal communication cost is the…
We derive a condition for the realizability of heat released in nondeterministic processes from a fluctuation theorem, showing that this condition is strictly stronger than the probabilistic form of the second law of thermodynamics. With…
Information-theoretic approaches provide a promising avenue for extending the laws of thermodynamics to the nanoscale. Here, we provide a general fundamental lower limit, valid for systems with an arbitrary Hamiltonian and in contact with…
Irreversible information processing cannot be carried out without some inevitable thermodynamical work cost. This fundamental restriction, known as Landauer's principle, is increasingly relevant today, as the energy dissipation of computing…
Model-independent semantic requirements for user specification and interpretation of data before and after quantum computations are characterized. Classical computational costs of assigning classical data values to quantum registers and to…
In the framework of quantum thermodynamics preparing a quantum system in a general state requires the consumption of two distinct resources, namely, work and coherence. It has been shown that the work cost of preparing a quantum state is…
In classical thermodynamics the work cost of control can typically be neglected. On the contrary, in quantum thermodynamics the cost of control constitutes a fundamental contribution to the total work cost. Here, focusing on quantum…
We analytically derive universal bounds that describe the trade-off between thermodynamic cost and precision in a sequence of events related to some internal changes of an otherwise hidden physical system. The precision is quantified by the…
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…
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…
Computation is an input-output process, where a program encoding a problem to be solved is inserted into a machine that outputs a solution. Quantum computation conventionally relies on classical, external control outside the quantum…
We present a thermodynamic analysis of a quantum engine that uses a single quantum particle as its working fluid, inspired by Szilard's classical single-particle engine. Our design is modeled after the classically-chaotic Szilard Map and…