arXiv:2112.04402 · Physical Review A

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

Florian Meier, Lídia del Rio

Published Dec 20, 2022• 3 citations

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.

DOI: 10.1103/physreva.106.062426

Related papers

Quantum vs Classical Erasure: Equal Bounds but Unequal Costs

Jan Neuser, Jake Xuereb, Pharnam Bakhshinezhad +1 more

Irreversibility has a fundamental thermodynamic cost, erasing information inevitably generates heat. This connection is quantified by the Landauer bound, which gives the minimum dissipation needed to erase a single bit of information. While this bound applies in both classical and quantum settings, it is saturated only in idealised limits of infinite resources. Here, we provide a unified first principles description of finite-resource erasure in both classical and quantum systems. We begin by proving the communal folklore that in the idealised regime the erasure cost of a bit encoded in a quantum or classical system is the same. Despite this, we show that their practical implementation differs substantially: achieving comparable erasure quality in quantum systems requires more control, larger accessible energy gaps and longer operation times. Classical protocols can achieve the erasure of a comparable quantum protocol under far weaker constraints which we expose in trade-off relations. Our results explain why practical erasure schemes fall short of Landauer's bound and show that classical systems enjoy several fundamental thermodynamic advantages.

quant-pharXiv:2607.27341Jul 31, 20260 citations

Thermodynamic Recycling of Algorithmic Failure Branches: Quantum-Computer Demonstration with Quantum Error Correction

Nobumasa Ishida, Yoshihiko Hasegawa

Thermodynamic trade-off relations dictate fundamental limits on the performance of thermodynamic tasks through costs such as heat dissipation. Here, we propose a framework called thermodynamic recycling to circumvent these limits in quantum processors by exploiting failure branches of quantum algorithms, which are usually discarded. The key component is an athermal bath naturally generated during the resetting of a failure branch. By coupling this bath to a target system prior to relaxation, thermodynamic tasks can be performed beyond conventional thermodynamic limits. We apply this framework to information erasure and derive the reduction in heat dissipation analytically. As a demonstration, we implement our framework on IBM's superconducting quantum processor by combining the Harrow--Hassidim--Lloyd algorithm with three-qubit quantum error correction, thereby reducing the heat dissipated in erasing syndrome information. Despite substantial noise and errors in current hardware, our method achieves erasure with heat dissipation below the Landauer limit. This work establishes an operational connection between quantum computing and quantum thermodynamics for resource-efficient quantum computation.

quant-pharXiv:2601.07522Jan 13, 20260 citations

Optimally Fast Qubit Reset

Yue Liu, Chenlong Huang, Xingyu Zhang +1 more

In practice, qubit reset must be operated in an extremely short time, which incurs a thermodynamic cost within multiple orders of magnitude above the Landauer bound. We present a general framework to determine the minimal thermodynamic cost and the corresponding optimal protocol for memory erasure under arbitrary erasure speeds. Our study reveals the divergent behavior of minimal entropy production in the short-time limit depends on the convergence and divergence of the jump operator. There is an inherent trade-off between the minimal required time and the set error probability for the convergent class. Moreover, we find the optimal protocol exhibits general features in the fast-driving regime. To illustrate these findings, we employ fermionic and bosonic baths as examples. Our results suggest that the super-Ohmic bosonic heat bath is suitable for qubit reset.

arXiv:2412.04883Physical Review LettersMar 11, 20251 citation

Efficiently Cooling Quantum Systems with Finite Resources: Insights from Thermodynamic Geometry

Philip Taranto, Patryk Lipka-Bartosik, Nayeli A. Rodríguez-Briones +4 more

Landauer's limit on heat dissipation during information erasure is critical as devices shrink, requiring optimal pure-state preparation to minimize errors. However, Nernst's third law states this demands infinite resources in energy, time, or control complexity. We address the challenge of cooling quantum systems with finite resources. Using Markovian collision models, we explore resource trade-offs and present efficient cooling protocols (that are optimal for qubits) for coherent and incoherent control. Leveraging thermodynamic length, we derive bounds on heat dissipation for swap-based strategies and discuss the limitations of preparing pure states efficiently.

arXiv:2404.06649Physical Review LettersFeb 18, 202512 citations

Exclusive Control of Quantum Memory Erasure

Mir Alimuddin, Nathan Shettell, Raja Yehia +2 more

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 with a remote system reduce the energetic cost of resetting a memory. We identify exclusive control of erasure as the central operational requirement: only a designated party should be able to achieve the minimal cost, whereas any adversary must fail. In the device-dependent regime, we show that entanglement of formation exactly characterizes exclusivity, establishing entanglement as the decisive thermodynamic resource. Moving to a one-sided device-independent scenario, in which only the memory holder's device is trusted, we develop an operational erasure protocol based on random dephasing and conditional operations. Finally, in a fully device-independent setting, we show how Bell nonlocality and self-testing translate observed violations into lower bounds on any adversary's erasure capability, yielding a device-independent notion of exclusive thermodynamic control. Taken together, these results elevate quantum erasure from a thermodynamic constraint to an operational primitive: the erasure work cost quantifies secure, exclusive control over quantum memory, ensuring that an unauthorized agent cannot fully erase information under a bounded work budget.

quant-pharXiv:2512.05761Physical Review ResearchDec 8, 20250 citations

Minimizing Dissipation in Multiqubit Erasure via Engineered Quantum Reservoirs

Sergio Arias

The erasure of quantum information is governed by two fundamental thermodynamic bounds: Landauer’s principle, which establishes the absolute minimum energetic cost of resetting a state, and Nernst’s unattainability principle, which dictates that perfect cooling to absolute zero entropy requires infinite resources. Under finite constraints, conventional cooling protocols utilizing thermal baths composed of n non-interacting particles are bottlenecked by a linear dissipation barrier (O(1/n)). In this thesis, we establish the ultimate thermodynamic limits of finite-resource multiqubit erasure and introduce the most thermodynamically efficient cooling protocol currently known. Building upon the max-cooling framework—a global unitary operation that systematically sorts the eigenvalues of the joint system-bath state to pack the highest probability mass into the target’s ground state—we engineer a bath Hamiltonian with specific, target-dependent degeneracies for arbitrary m-qubit systems. This collective protocol achieves an optimal asymptotic entropy production scaling of Σ = O(mˆ2/nˆ2), successfully saturating the scaling of the fundamental theoretical lower bound. This degeneracy-optimized approach strictly outperforms both standard non-interacting reservoirs and the best-known protocol for the independent cooling of single qubits using a reservoir of interacting particles (O(mˆ3/nˆ2)). Furthermore, we establish that surpassing conventional dissipation barriers requires an operational threshold of just n ≥ 2mˆ2 bath particles to achieve this optimal scaling.

Aug 24, 20260 citations