Related papers: Minimal Energy Cost to Initialize a Quantum Bit wi…
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…
Quantum entanglement is a key physical resource in quantum information processing that allows for performing basic quantum tasks such as teleportation and quantum key distribution, which are impossible in the classical world. Ever since the…
The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes,…
Understanding how much energy is needed and dissipated as heat for a given computational system and for a given program is a physically interesting and practically important problem. However, the thermodynamic costs of computational systems…
The calculation time for the energy of atoms and molecules scales exponentially with system size on a classical computer but polynomially using quantum algorithms. We demonstrate that such algorithms can be applied to problems of chemical…
By looking at quantum data compression in the second quantisation, we present a new model for the efficient generation and use of variable length codes. In this picture lossless data compression can be seen as the {\em minimum energy}…
We derive a formula for the time-energy costs of general quantum channels proposed in [Phys. Rev. A 88, 012307 (2013)]. This formula allows us to numerically find the time-energy cost of any quantum channel using positive semidefinite…
It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably…
The Landauer principle establishes a fundamental lower bound on the energetic cost of the erasure of a one-bit memory in thermal equilibrium. Here, we experimentally demonstrate how this bound can be effectively circumvented by introducing…
One of the primary motivations of the research in the field of computation is to optimize the cost of computation. The major ingredient that a computer needs is the energy to run a process, i.e., the thermodynamic cost. The analysis of the…
Starting from Landauer's slogan "information is physical," we revise and modify Landauer's principle stating that the erasure of information has a minimal price in the form of a certain quantity of free energy. We establish a direct link…
The Landauer principle establishes a lower bound in the amount of energy that should be dissipated in the erasure of one bit of information. The specific value of this dissipated energy is tightly related to the definition of entropy. In…
In this article, we focus on erasure of a bit of information in finite time. Landauer's principle states that the average heat dissipation due to erasure of information is k_B T ln 2, which is achievable only in an asymptotic manner. Recent…
Quantum random-access look-up of a string of classical bits is a necessary ingredient in several important quantum algorithms. In some cases, the cost of such quantum random-access memory (qRAM) is the limiting factor in the implementation…
According to Landauer's principle, a minimum amount of energy proportional to temperature must be dissipated during the erasure of a classical bit of information compensating the entropy loss, thereby linking the information and…
We introduce an energetically-optimal method inspired from Shortcut-To-Adiabaticity (STA) processes, named Quantum-Optimal-Shortcut-To-Energetics (QOSTE). QOSTE produces the same transformation as STA for a given protocol used in quantum…
We demonstrate an information erasure protocol that resets $N$ qubits at once. The method displays exceptional performances in terms of energy cost (it operates nearly at Landauer energy cost $kT \ln 2$), time duration ($\sim \mu s$) and…
We analyze an engine whose working fluid consists of a single quantum particle, paralleling Szilard's construction of a classical single-particle engine. Following his resolution of Maxwell's Second Law paradox using the latter, which…
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge…
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…