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.
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.
The Landauer principle sets a lower bound on the thermodynamic cost of qubit reset, which is only attainable for the quasistatic process. In this Letter, we explore the collective advantage of qubit reset of coherent qubits in three aspects. First, for the quasistatic process, the thermodynamic cost of collective reset is remarkably lower than parallel reset because of the reduced Hilbert space dimension due to entanglement effects. Second, for the finite-time qubit reset, we prove that the error probability fades away and per-qubit heat production tends the Landauer bound for initially continuous protocols in the thermodynamic limit. Third, we show that qubit reset performance enhances with the increase in the number of qubits. Our results, illustrated by different protocols, provide a blueprint for future quantum device fabrication.
The thermodynamic cost of resetting an arbitrary initial state to a particular desired state is lower bounded by Landauer's bound. However, here we demonstrate that this lower bound is necessarily unachievable for every initial state (except possibly the single minimally dissipative input) for any reliable reset mechanism. Since local heating threatens rapid decoherence, this issue is of substantial importance beyond mere energy efficiency. For the case of qubit reset, we find the minimally dissipative state analytically for any reliable reset protocol, in terms of the entropy-flow vector introduced here. This allows us to verify a recent theorem about initial-state dependence of entropy production for any finite-time transformation, as it pertains to quantum state preparation.
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.
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.
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.
The standard Landauer bound W≥kBTln2 sets the fundamental thermodynamic cost for information erasure under ideal conditions: weak system-bath coupling, quasistatic operation, and equilibrium reservoirs. However, realistic quantum error correction (QEC) operates in a profoundly different regime-finite-time syndrome extraction, strong coupling to cryogenic environments, and non-equilibrium dynamics. Here, we develop a unified thermodynamic framework for fault-tolerant quantum computing that incorporates corrections beyond the ideal Landauer limit. We derive a generalized bound on the heat dissipation per QEC cycle: Qmin≥kBTln2+kBTΔISB+ℏτ, and scaling this result to large-scale quantum computers, we find that the total heat load grows polynomially with code distance but remains in the nanowatt range for million-qubit systems-well within the cooling power of modern dilution refrigerators. Applying our model to superconducting qubit architectures, we show that while strong coupling can add up to ∼20% to the ideal cost, finite-time effects contribute approximately 0.55% at 100 ns and 5.5% at 10 ns reset operations. Our results establish that the true thermodynamic cost of fault tolerance, while exceeding the naive Landauer estimate, does not pose a fundamental obstacle to scalability; the dominant engineering challenges lie in the heat load of control electronics and wiring, not in the fundamental dissipation of qubit reset.