Related papers: Thermodynamically-Efficient Local Computation and …
Quantum transport simulations often use explicit, yet finite, electronic reservoirs. These should converge to the correct continuum limit, albeit with a trade-off between discretization and computational cost. Here, we study this interplay…
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…
The minimum amount of thermodynamic work required in order to implement a quantum computation or a quantum state transformation can be quantified using frameworks based on the resource theory of thermodynamics, deeply rooted in the works of…
Quantum models of computation are widely believed to be more powerful than classical ones. Efforts center on proving that, for a given problem, quantum algorithms are more resource efficient than any classical one. All this, however,…
High-performance techniques to simulate quantum programs on classical hardware rely on exponentially large vectors to represent quantum states. When simulating quantum algorithms, the quantum states that occur are often sparse due to…
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…
One of the potential applications of a quantum computer is solving quantum chemical systems. It is known that one of the fastest ways to obtain somewhat accurate solutions classically is to use approximations of density functional theory.…
We define formally decohered quantum computers (using density matrices), and present a simulation of them by a probabalistic classical Turing Machine. We study the slowdown of the simulation for two cases: (1) sequential quantum computers,…
We consider an overdamped nanoparticle in a driven double-well potential as a generic model of an erasable one-bit memory. We study in detail the statistics of the heat dissipated during an erasure process and show that full erasure may be…
The widely debated feasibility of thermodynamic machines achieving Carnot efficiency at finite power has been convincingly dismissed. Yet, the common wisdom that efficiency can only be optimal in the limit of infinitely-slow processes…
Controlled quantum mechanical devices provide a means of simulating more complex quantum systems exponentially faster than classical computers. Such "quantum simulators" rely heavily upon being able to prepare the ground state of…
The fading memory property is a key requirement for reservoir computers -- a specific type of recurrent neural network with fixed internal weights. While mostly undesired in gate-based quantum computing, dissipation due to material…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
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's Principle states that the energy cost of information processing must exceed the product of the temperature and the change in Shannon entropy of the information-bearing degrees of freedom. However, this lower bound is achievable…
In the study of closed many-body quantum systems one is often interested in the evolution of a subset of degrees of freedom. On many occasions it is possible to approach the problem by performing an appropriate decomposition into a bath and…
Erasing memory is a fundamental operational task in quantum information processing, governed by Landauer's principle, which links information loss to thermodynamic work. We introduce and analyze assisted quantum erasure, where correlations…
Landauer's principle provides a perspective on the physical meaning of information as well as on the minimum working cost of information processing. Whereas most studies have related the decrease in entropy during a computationally…
For quantum many-body systems in one dimension, computational complexity theory reveals that the evaluation of ground-state energy remains elusive on quantum computers, contrasting the existence of a classical algorithm for temperatures…
Identifying optimal thermodynamical processes has been the essence of thermodynamics since its inception. Here, we show that differentiable programming (DP), a machine learning (ML) tool, can be employed to optimize finite-time…