Thermodynamic optimization of quantum algorithms: On-the-go erasure of qubit registers
arXiv:2112.04402 · doi:10.1103/PhysRevA.106.062426
Abstract
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: freeing up auxiliary qubits as they stop being useful would facilitate the parallelization of computations. We study the minimal thermodynamic cost of erasure in these scenarios, applying results on the Landauer erasure of entangled quantum registers. For the class of algorithms solving the Abelian hidden subgroup problem, we find optimal on-the-go erasure protocols. We conclude that there is a trade-off: if we have enough partial information about a problem to build efficient on-the-go erasure, we can use it to instead simplify the algorithm, so that fewer qubits are needed to run the computation in the first place. We provide explicit protocols for these two approaches.
arXiv comment10+9 pages, 12 figures
References in corpus (29)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Entanglement detection
- The role of quantum information in thermodynamics --- a topical review
- Fundamental limitations for quantum and nano thermodynamics
- The Resource Theory of Quantum States Out of Thermal Equilibrium
- Negative entropy and information in quantum mechanics
- The thermodynamic meaning of negative entropy
- Experimental realization of a Szilard engine with a single electron
- Work extraction and thermodynamics for individual quantum systems
- Extractable work, the role of correlations, and asymptotic freedom in quantum batteries
- The general structure of quantum resource theories
- An improved Landauer Principle with finite-size corrections
- Truly work-like work extraction
- Quantum technologies need a Quantum Energy Initiative
- An introductory review of the resource theory approach to thermodynamics
- The quantum query complexity of the hidden subgroup problem is polynomial
- One-Shot Operational Quantum Resource Theory
- A short note on passivity, complete passivity and virtual temperatures
- A measure of majorisation emerging from single-shot statistical mechanics
- Heat-Bath Algorithmic Cooling with optimal thermalization strategies
- Third Law of Thermodynamics as a Single Inequality
- Geometry of two-qubit states with negative conditional entropy
- Fundamental energy requirement of reversible quantum operations
- Gaussian Thermal Operations and the Limits of Algorithmic Cooling
- Unifying paradigms of quantum refrigeration: fundamental limits of cooling and associated work costs
- Finite-bath corrections to the second law of thermodynamics
- Thermodynamics of a minimal algorithmic cooling refrigerator
- Second law of thermodynamics for batteries with vacuum state
- The Free Energy of a General Computation