Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2407.03096

Collective advantages in qubit reset: effect of coherent qubits

Yue Liu, Chenlong Huang, Xingyu Zhang, Dahai He

Published Jul 3, 2024• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2407.03096

Related papers

Impossibility of achieving Landauer's bound for almost every quantum state

Paul M. Riechers, Mile Gu

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.

arXiv:2103.02337•Physical Review A•Jul 19, 2021•17 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.04883•Physical Review Letters•Mar 11, 2025•1 citation

Geometric optimality of entanglement-induced fast qubit reset

Davide Rinaldi, Mattia Moroder, Dario Gerace +2 more

Fast and reliable qubit reset is essential for the efficient operation of quantum processors. Among the proposed strategies, Mpemba-effect-based protocols offer a simple route to accelerated relaxation, but provide limited insight into the optimality of the full reset dynamics. Geometric approaches, by contrast, quantify optimality but do not generally suggest practical acceleration protocols. Here, we bridge these perspectives through a geometric analysis of entanglement-assisted qubit reset. We show that entangling operations can redistribute local coherences across a multi-qubit register, allowing the reduced state of each qubit to follow a geodesic path towards the ground state. Remarkably, this locally optimal behaviour can emerge even when the collective evolution becomes suboptimal in the full state space. We illustrate this interplay for different families of initial multi-qubit states. Our results provide a geometric perspective on Mpemba-inspired reset acceleration and clarify when extending two-qubit protocols to larger registers provides a further advantage in the reset process.

quant-pharXiv:2608.26897•Aug 28, 2026•0 citations

Thermodynamic Limits of Fault-Tolerant Quantum Computing Beyond the Weak-Coupling, Quasistatic Regime

Mrittunjoy Guha Majumdar

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.

Entropy•May 11, 2026•1 citation

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.27341•Jul 31, 2026•0 citations

Guaranteed Energy-Efficient Bit Reset in Finite Time

Cormac Browne, Andrew J. P. Garner, Oscar Dahlsten +1 more

Landauer's principle states that it costs at least kBTln2 of work to reset one bit in the presence of a heat bath at temperature T. The bound of kBTln2 is achieved in the unphysical infinite-time limit. Here we ask what is possible if one is restricted to finite-time protocols. We prove analytically that it is possible to reset a bit with a work cost close to kBTln2 in a finite time. We construct an explicit protocol that achieves this, which involves thermalizing and changing the system's Hamiltonian so as to avoid quantum coherences. Using concepts and techniques pertaining to single-shot statistical mechanics, we furthermore prove that the heat dissipated is exponentially close to the minimal amount possible not just on average, but guaranteed with high confidence in every run. Moreover, we exploit the protocol to design a quantum heat engine that works near the Carnot efficiency in finite time.

arXiv:1311.7612•Physical Review Letters•Sep 4, 2014•31 citations
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.
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.
Fast and reliable qubit reset is essential for the efficient operation of quantum processors. Among the proposed strategies, Mpemba-effect-based protocols offer a simple route to accelerated relaxation, but provide limited insight into the optimality of the full reset dynamics. Geometric approaches, by contrast, quantify optimality but do not generally suggest practical acceleration protocols. Here, we bridge these perspectives through a geometric analysis of entanglement-assisted qubit reset. We show that entangling operations can redistribute local coherences across a multi-qubit register, allowing the reduced state of each qubit to follow a geodesic path towards the ground state. Remarkably, this locally optimal behaviour can emerge even when the collective evolution becomes suboptimal in the full state space. We illustrate this interplay for different families of initial multi-qubit states. Our results provide a geometric perspective on Mpemba-inspired reset acceleration and clarify when extending two-qubit protocols to larger registers provides a further advantage in the reset process.
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.
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.
Landauer's principle states that it costs at least kBTln2 of work to reset one bit in the presence of a heat bath at temperature T. The bound of kBTln2 is achieved in the unphysical infinite-time limit. Here we ask what is possible if one is restricted to finite-time protocols. We prove analytically that it is possible to reset a bit with a work cost close to kBTln2 in a finite time. We construct an explicit protocol that achieves this, which involves thermalizing and changing the system's Hamiltonian so as to avoid quantum coherences. Using concepts and techniques pertaining to single-shot statistical mechanics, we furthermore prove that the heat dissipated is exponentially close to the minimal amount possible not just on average, but guaranteed with high confidence in every run. Moreover, we exploit the protocol to design a quantum heat engine that works near the Carnot efficiency in finite time.