In every syndrome cycle a data qubit spends most of its time doing nothing, waiting while its neighbouring measure qubits are read out and reset, and nothing is not free: idle decoherence accrues at a rate set by the ratio of waiting time to coherence time. This paper prices the wait. For a superconducting cycle of 1.0 microsecond in which entangling gates occupy a quarter of the schedule, against an energy-relaxation time of 100 microseconds, the idle error per data qubit per cycle is about 7.50e-3, which across the 441 data qubits of a distance-twenty-one patch amounts to an expectation of 3.3 idle error events per cycle, comparable to the entire gate-error contribution the cycle was designed around. The wait is a first-class error source, and the paper budgets the three ways to pay it down: faster cycles, longer coherence, and schedules that keep data qubits usefully busy, including dynamical decoupling, whose own costs are charged.
In every syndrome cycle a data qubit spends most of its time doing nothing, waiting while its neighbouring measure qubits are read out and reset, and nothing is not free: idle decoherence accrues at a rate set by the ratio of waiting time to coherence time. This paper prices the wait. For a superconducting cycle of 1.0 microsecond in which entangling gates occupy a quarter of the schedule, against an energy-relaxation time of 100 microseconds, the idle error per data qubit per cycle is about 7.50e-3, which across the 441 data qubits of a distance-twenty-one patch amounts to an expectation of 3.3 idle error events per cycle, comparable to the entire gate-error contribution the cycle was designed around. The wait is a first-class error source, and the paper budgets the three ways to pay it down: faster cycles, longer coherence, and schedules that keep data qubits usefully busy, including dynamical decoupling, whose own costs are charged.
Achieving high-precision quantum computation requires effective suppression of idling errors that occur when qubits remain inactive during waiting periods within a quantum circuit. Conventional mitigation techniques, such as dynamical decoupling, suppress decoherence by periodically refreshing quantum states through the insertion of additional control gates. In this paper, we propose an alternative approach that suppresses idling errors through quantum circuit scheduling without introducing any additional gate operations. By appropriately adjusting the execution timing of quantum gates with scheduling flexibility, we demonstrate through both numerical simulations and hardware experiments that the overall computational accuracy can be significantly influenced and, in many cases, improved. In addition, we analytically derive the density-matrix evolution under idling noise and provide a theoretical framework that explains the observed behavior.
Quantum computing in the Noisy Intermediate-Scale Quantum (NISQ) era faces significant challenges due to the limitations in quantum gate fidelity and elevated error rates, which impede the successful execution of large-scale quantum circuits. One major source of errors in quantum computing is ’coherence errors’, which arise from the idle time during circuit execution. Specifically, factors such as uneven gate operations, hardware limitations, and qubit connectivity constraints collectively contribute to the formation of ’holes’ in quantum circuits, leading to ’idle qubits’. These idle periods, in turn, increase noise and error rates, thus negatively impacting the overall reliability of quantum circuits’ outputs.
Quantum error correction protects logical qubits from decoherence but requires repeated syndrome extraction whose fundamental thermodynamic cost has not been characterized exactly. We prove five theorems and two corollaries that supply this characterization for stabilizer codes. First, a no-go result establishes that every error-correction cycle requires strictly positive work, ruling out passive error correction. Second, a duality identity shows that the combined measurement and erasure cost per syndrome-extraction round is determined solely by the number of stabilizer generators; only the split between measurement and erasure depends on the error rate. Third, a coherence dissipation theorem quantifies the additional irreversible work generated when projective stabilizer measurements destroy quantum coherence in the data register. CSS codes eliminate this cost for generators aligned with the noise channel’s eigenbasis, yielding a thermodynamic criterion for code selection under non-Pauli noise. Fourth, a Crooks fluctuation theorem for the full syndrome cycle yields a Jarzynski equality and exponential tail bounds on rare work fluctuations. Fifth, a variance formula captures the effect of syndrome correlations among stabilizers that share physical qubits. We evaluate all results across eleven codes, from a three-qubit repetition code to a 144-qubit quantum low-density parity-check code, establishing a Pareto trade-off between thermodynamic cost and error-suppression capability. Comparison with four experimental platforms—two superconducting, one trapped-ion, and one neutral-atom—shows that current hardware operates five to eleven orders of magnitude above the Landauer limit, with control and readout hardware, not syndrome extraction, as the dominant source of dissipation.
Error correction is a streaming problem. Every syndrome cycle, each measure qubit in every patch reports a bit, and a decoder must consume those bits at least as fast as the hardware produces them, or the backlog grows without bound and feedback arrives too late to matter. This paper prices the stream. A distance-twenty-seven patch emits 728 syndrome bits per microsecond-scale cycle, a rate of 728 megabits per second per patch; a machine of a thousand such patches produces syndrome data at hundreds of gigabits per second, all of it on a deadline. The stability condition is stated in its sharpest form: mean decoding time per round must sit below the cycle time, with headroom for the bursts that real decoders exhibit. Latency, distinct from throughput, is budgeted separately for the operations that need feedback, and the paper closes with the buffer arithmetic that converts a decoder's worst-case pause into the memory a control system must provision.
Classical retention costs almost nothing: a bit in DRAM costs 1.57e-8 J per bit-hour in self-refresh, a bit in flash at most 5.70e-14 J per bit-hour as an amortised rewrite bound, and a bit on tape on a shelf costs nothing. This paper prices the quantum analogue: holding one logical qubit, with no computation performed on it, below a cumulative failure probability of 1% for one hour, one day, and one year. Because bare qubits survive only microseconds (superconducting) to minutes (trapped ion), retention requires continuous surface-code error correction at a 100% refresh duty cycle, with code distance growing as the interval lengthens. Holding one logical qubit takes 15,741 W, 17,569 W, and 20,784 W continuously on the superconducting platform (physical error rate 1e-3, 1 microsecond cycles, distances 27/31/37, 10 kW fixed cryostat plant included) and 2,721 W, 3,057 W, and 3,681 W on the trapped-ion platform (1 ms cycles, distances 19/23/29). The energy per logical-qubit-hour exceeds the classical DRAM bit-hour by a factor of 6.23e14 to 4.76e15, the flash bit-hour by about 1e21, and is unbounded against tape on a shelf at zero holding cost. Quantum memory with present architectures is not a storage medium but a continuous power commitment. Model calculations are labelled SIMULATED, NOT MEASURED. The deposit includes the paper PDF and markdown, the computation script (compute.py) that produces every number in the paper, and its outputs (results.json, results.txt).
Abstract Dynamical decoupling (DD) is one of the simplest error suppression methods, aiming to enhance the coherence of qubits in open quantum systems. Moreover, DD has demonstrated effectiveness in reducing coherent crosstalk, one major error source in near-term quantum hardware, which manifests from two types of interactions. Static crosstalk exists in various hardware platforms, including superconductor and semiconductor qubits, by virtue of always-on qubit-qubit coupling. Additionally, driven crosstalk may occur as an unwanted drive term due to leakage from driven gates on other qubits. Here we explore a novel staggered DD protocol tailored for multi-qubit systems that suppresses the decoherence error and both types of coherent crosstalk. We develop two experimental setups—an ‘idle–idle’ experiment in which two pairs of qubits undergo free evolution simultaneously and a ‘driven-idle’ experiment in which one pair is continuously driven during the free evolution of the other pair. These experiments are performed on an IBM Quantum superconducting processor and demonstrate the significant impact of the staggered DD protocol in suppressing both types of coherent crosstalk. When compared to the standard DD sequences from state-of-the-art methodologies with the application of X 2 sequences, our staggered DD protocol enhances circuit fidelity by 19.7% and 8.5%, respectively, in addressing these two crosstalk types.