Quantum error correction acts as an entropy pump, transferring noise-induced uncertainty from a protected quantum system into syndrome information stored in an auxiliary memory. Repeated operation requires this memory to be cleared which unavoidably contributes to the energetic cost of error correction. Here, we characterise this contribution for subspace quantum error-correcting codes and identify how it depends on the joint structure of the code, the noise, and the representation of the retained syndrome information. Starting from the Knill--Laflamme conditions, we construct an effective syndrome state whose von Neumann entropy sets a lower bound on the ideal work required to maintain a reusable syndrome register. Projective syndrome readout generally generates additional entropy, and we quantify the resulting gap through measurement inefficiency. We then specialise to stabiliser codes under independent local Pauli noise and analyse two classical levels of syndrome representation. At the level of abstract error labels, degeneracies among single-qubit errors reduce the leading-order entropy of processed recovery labels. At the parity-check level, lower-weight checks reduce the marginal entropy generated by individual measurement outcomes in the low-noise regime. We identify the additional burden associated with retaining and separately erasing these outcomes as a bit-level inefficiency, and illustrate both costs for the five-qubit, Steane, generalised Shor, and rotated surface codes. Our results establish a hierarchy of syndrome-memory energetic costs and identify the code, noise, and measurement structures that control the ideal thermodynamic burden of subspace quantum error correction.
Quantum error correction acts as an entropy pump, transferring noise-induced uncertainty from a protected quantum system into syndrome information stored in an auxiliary memory. Repeated operation requires this memory to be cleared which unavoidably contributes to the energetic cost of error correction. Here, we characterise this contribution for subspace quantum error-correcting codes and identify how it depends on the joint structure of the code, the noise, and the representation of the retained syndrome information. Starting from the Knill--Laflamme conditions, we construct an effective syndrome state whose von Neumann entropy sets a lower bound on the ideal work required to maintain a reusable syndrome register. Projective syndrome readout generally generates additional entropy, and we quantify the resulting gap through measurement inefficiency. We then specialise to stabiliser codes under independent local Pauli noise and analyse two classical levels of syndrome representation. At the level of abstract error labels, degeneracies among single-qubit errors reduce the leading-order entropy of processed recovery labels. At the parity-check level, lower-weight checks reduce the marginal entropy generated by individual measurement outcomes in the low-noise regime. We identify the additional burden associated with retaining and separately erasing these outcomes as a bit-level inefficiency, and illustrate both costs for the five-qubit, Steane, generalised Shor, and rotated surface codes. Our results establish a hierarchy of syndrome-memory energetic costs and identify the code, noise, and measurement structures that control the ideal thermodynamic burden of subspace quantum error correction.
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.
Quantum error correction will likely be essential for building a large-scale quantum computer, but it comes with significant requirements at the level of classical control software. In particular, a quantum error-correcting code must be supplemented with a fast and accurate classical decoding algorithm. Standard techniques for measuring the parity-check operators of a quantum error-correcting code involve repeated measurements, which both increases the amount of data that needs to be processed by the decoder, and changes the nature of the decoding problem. Knill error correction is a technique that replaces repeated syndrome measurements with a single round of measurements, but requires an auxiliary logical Bell state. Here, we provide a theoretical and numerical investigation into Knill error correction from the perspective of decoding. We give a self-contained description of the protocol, prove its fault tolerance under locally decaying (circuit-level) noise, and numerically benchmark its performance for quantum low-density parity-check codes. We show analytically and numerically that the time-constrained decoding problem for Knill error correction can be solved using the same decoder used for the simpler code-capacity noise model, illustrating that Knill error correction may alleviate the stringent requirements on classical control required for building a large-scale quantum computer.
Quantum thermodynamics and quantum information theory are often developed as neighboring subjects: the former studies energy, heat, work, irreversibility, and fluctuations in quantum systems, while the latter studies the representation, transmission, manipulation, and protection of information in quantum states. For fault-tolerant quantum technologies, however, the separation is artificial. A quantum memory or processor is an open, controlled, and dissipative information-processing system whose logical degrees of freedom are maintained against noise by repeated syndrome extraction, feedback, dissipation, and reset. This article develops a unifying framework in which quantum error correction (QEC) is interpreted as the stabilization of an emergent informational order in a driven nonequilibrium quantum system. The framework is organized around five common mathematical structures: density operators and quantum channels; relative entropy and nonequilibrium free energy; Gorini–Kossakowski–Lindblad–Sudarshan (GKLS) dynamics and entropy production; code subspaces, syndromes, and recovery channels; and Liouvillian spectral structure, metastability, and criticality. We show how active QEC can be viewed as an entropy-pumping cycle that transfers noise-generated uncertainty from protected degrees of freedom into syndrome and controller degrees of freedom, whose reuse requires thermodynamic reset. Continuous and autonomous QEC are formulated as competition between natural noise and engineered dissipative generators, yielding stationary or periodic nonequilibrium states with nonvanishing microscopic currents even when logical observables are approximately stationary. Complexity is introduced from the outset through multiscale organization, predictive coarse-graining, information dynamics, and spectral separation; these concepts distinguish structured persistence from entropy reduction alone. At the level of a conceptual synthesis, this perspective relates model-specific fault-tolerance thresholds to critical phenomena, logical subspaces with slow emergent manifolds, syndrome decoding with stochastic inference, and engineered dissipation with self-organization. We finally propose a thermodynamic-complexity description of QEC in terms of logical error rate, entropy-production rate, Liouvillian gap, information flow, and control power. The resulting framework provides a common language for quantum thermodynamics, nonequilibrium statistical mechanics, complexity science, and quantum information and identifies concrete questions for thermodynamically efficient fault-tolerant quantum architectures.
What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent X rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching 1/2 relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below 1/2, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's X distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.
The aim of quantum error correction (QEC) is to counteract the decoherence of qubits,which arises from their unavoidable interaction with the environment. In this work, westudy the lower bound of entropy production in quantum error correction, asking the cen-tral question: Is it possible to fight decoherence in a reversible way?A previous work established that ideal quantum error correction can, in principle,be performed reversibly. In this work, however, we consider fault-tolerant quantum errorcorrection, which explicitly accounts for faults occurring during the correction processitself. We show that when noise affects the circuit during the error-correcting operations,quantum error correction can no longer be reversible, because of unused correlations thatmust be dissipated at each correction cycle.This result can be better understood by drawing an analogy with Maxwell’s demon.In quantum error correction, the goal is to remove entropy from the data qubits. Ancillaryqubits are used to record the occurrence of errors (syndrome diagnosis), and this infor-mation is then employed to correct them (recovery operation). At the end of each cycle,the ancillary qubits are reset in order to start a new cycle. This is closely analogous to aMaxwell demon, which uses a memory to store information about a system, exploits thatinformation to reduce the system’s entropy, and finally resets its memory, dissipating heatinto the environment in accordance with Landauer’s principle.In this analogy, the demon’s memory corresponds to the ancillary qubits, while thesystem corresponds to the data qubits. During syndrome diagnosis, information aboutthe errors is recorded in the ancillary qubits, creating some correlations between dataand ancillary qubits. In the recovery operation, these correlations are used to correctthe errors on the data qubits and thus reduce their entropy. At the end of the cycle, theancillary qubits are reset to |0⟩, which generates a heat flow to the environment as dictatedby Landauer’s principle.For ideal quantum error correction, this process can, in principle, be performed re-versibly, thereby reaching equality in Landauer’s bound.However, when errors occur on the ancillary qubits during the QEC process (in the lan-guage of Maxwell’s demon, when faults affect the demon’s memory before the feedbackstep) these errors propagate to the data qubits, creating unwanted correlations betweendata and ancillas. Such correlations generate an additional finite heat flow to the bath,that prevents reaching equality in Landauer’s principle.
Recent work established that, for independent erasures, storing K logical qubits for S time steps with error at most ε requires a spacetime cost of Ω(S(K+log(S/ε))). A matching construction was also given, but assumes ideal error correction. Here we show that the same scaling can be achieved with an explicit noisy error-correction circuit and efficient decoding, counting all state-preparation, gate, measurement, and wait locations, provided that the hardware supports long-range qubit connectivity and fast, reliable classical processing. Thus, reliability adds only a logarithmic overhead shared by all stored qubits. The construction works for sufficiently weak but otherwise general circuit noise, including faults during syndrome extraction and correlated faults, and for independent erasures it matches the best known lower bound up to constant factors. We attain this scaling using quantum Tanner codes, with each memory step consisting of one round of syndrome extraction followed by a fixed number of parallel classical decoder steps that reduce the residual error enough to keep later faults correctable, regardless of memory size, storage time, or target accuracy. Together, this gives exponentially small failure probability per step while keeping the cost of each memory step linear in the code size. The same analysis also extends to certain constant-depth logical Clifford operations.