Related papers: Minimal Energy Cost to Initialize a Quantum Bit wi…
It is commonly recognized that the Landauer bound holds in (irreversible) quantum operations. In this study, we verified this bound by extracting a single spin from a spin-spin magnetic interaction experiment to demonstrate that the…
Landauer's principle makes a strong connection between information theory and thermodynamics by stating that erasing a one-bit memory at temperature $T_0$ requires an average energy larger than $W_{LB}=k_BT_0 \ln2$, with $k_B$ Boltzmann's…
The construction of models from data is a significant contributor to the energetic costs of computation. Because of this, understanding how foundational thermodynamic bounds apply to modeling algorithms will be increasingly important. Here,…
Establishing quantum entanglement between two distant parties is an essential step of many protocols in quantum information processing. One possibility for providing long-distance entanglement is to create an entangled composite state…
We consider two bottlenecks in quantum computing: limited memory size and noise caused by heat dissipation. Trying to optimize both, we investigate "on-the-go erasure" of quantum registers that are no longer needed for a given algorithm:…
As we enter the era of useful quantum computers we need to better understand the limitations of classical support hardware, and develop mitigation techniques to ensure effective qubit utilisation. In this paper we discuss three key…
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,…
According to the International Technology Roadmap for Semiconductors in the next 10-15 years the limits imposed by the physics of switch operation will be the major roadblock for future scaling of the CMOS technology. Among these limits the…
The minimum heat cost of computation is subject to bounds arising from Landauer's principle. Here, I derive bounds on finite modelling -- the production or anticipation of patterns (time-series data) -- by devices that model the pattern in…
Recently Shor showed how to perform fault tolerant quantum computation when the error probability is logarithmically small. We improve this bound and describe fault tolerant quantum computation when the error probability is smaller than…
Modularity dissipation identifies how locally-implemented computation entails costs beyond those required by Landauer's bound on thermodynamic computing. We establish a general theorem for efficient local computation, giving the necessary…
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…
We consider a quantum gate, driven by a general time-dependent Hamiltonian, that complements the state of a qubit and then adds to it an arbitrary phase shift. It is shown that the minimum operation time of the gate is tau = (h/4E)(1+2…
We prove that the entanglement cost equals the regularized entanglement of formation for any infinite-dimensional quantum state $\rho_{AB}$ with finite quantum entropy on at least one of the subsystems $A$ or $B$. This generalizes a…
Quantum computing brings a promise of new approaches into computational quantum chemistry. While universal, fault-tolerant quantum computers are still not available, we want to utilize today's noisy quantum processors. One of their flagship…
We compare several quantum phase estimation (QPE) protocols intended for early fault-tolerant quantum computers (EFTQCs) in the context of models of their implementations on a surface code architecture. We estimate the logical and physical…
Phase estimation, due to Kitaev [arXiv'95], is one of the most fundamental subroutines in quantum computing. In the basic scenario, one is given black-box access to a unitary $U$, and an eigenstate $\lvert \psi \rangle$ of $U$ with unknown…
We initiate the systematic study of the energy complexity of algorithms (in addition to time and space complexity) based on Landauer's Principle in physics, which gives a lower bound on the amount of energy a system must dissipate if it…
We present a unified approach to analyzing the cost of various quantum error mitigation methods on the basis of quantum estimation theory. By analyzing the quantum Fisher information matrix of a virtual quantum circuit that effectively…
We derive a standard quantum limit for probing mechanical energy quantization in a class of systems with mechanical modes parametrically coupled to external degrees of freedom. To resolve a single mechanical quantum, it requires a…