Thermodynamic optimization of quantum algorithms: On-the-go erasure of qubit registers

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.

10+9 pages, 12 figures

References in corpus (9)

• Entanglement detection
• The thermodynamic meaning of negative entropy
• Quantum technologies need a Quantum Energy Initiative
• One-Shot Operational Quantum Resource Theory
• 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
• Thermodynamics of a minimal algorithmic cooling refrigerator
• Second law of thermodynamics for batteries with vacuum state

Cited by in corpus (1)

• DQC1 as an Open Quantum System