Quantum error correction is priced in combinatorial currency — rate, distance, threshold — while the physical cost of performing correction goes uncounted. Every cycle of active (measurement-based) error correction erases information: syndrome extraction, majority voting, and ancilla re-initialization each reset redundancy, and Landauer's principle prices each erasure at no less than kT·ln2 per bit. This paper derives the resulting thermodynamic floor for correction overhead — (n−k)/k · kT·ln2 per logical qubit per round for an [[n,k]] code — verifies its scaling across code families (linear for repetition, quadratic for surface, constant for constant-rate), and applies the JPCUB joules-per-correct-answer metric to rank correction architectures. A two-level nested (tree-structured) code is compared with flat Hamming codes of equal rate on a clustered NAND-like channel: hierarchical decoding cuts the per-round erasure count by a factor of 1.6 to 3, while the naive construction pays a residual-error penalty — a partial null that leaves the floor claim intact and defines the protocol for an industrial flash-memory test. Biological systems that run robust quantum processes without correction (photosynthetic energy transfer, radical-pair magnetoreception) show the floor is an architecture choice: structure prepays in capital energy what correction pays in operating erasures. Autonomous and dissipative correction is identified as the boundary of the claim. A closing section documents the 2026 quantum-algorithms-and-QEC curriculum snapshot: the energy bill the paper prices is absent from the field's own teaching materials as of 2026-08-26.
Quantum error correction is priced in combinatorial currency — rate, distance, threshold — while the physical cost of performing correction goes uncounted. Every cycle of active (measurement-based) error correction erases information: syndrome extraction, majority voting, and ancilla re-initialization each reset redundancy, and Landauer's principle prices each erasure at no less than kT·ln2 per bit. This paper derives the resulting thermodynamic floor for correction overhead — (n−k)/k · kT·ln2 per logical qubit per round for an [[n,k]] code — verifies its scaling across code families (linear for repetition, quadratic for surface, constant for constant-rate), and applies the JPCUB joules-per-correct-answer metric to rank correction architectures. A two-level nested (tree-structured) code is compared with flat Hamming codes of equal rate on a clustered NAND-like channel: hierarchical decoding cuts the per-round erasure count by a factor of 1.6 to 3, while the naive construction pays a residual-error penalty — a partial null that leaves the floor claim intact and defines the protocol for an industrial flash-memory test. Biological systems that run robust quantum processes without correction (photosynthetic energy transfer, radical-pair magnetoreception) show the floor is an architecture choice: structure prepays in capital energy what correction pays in operating erasures. Autonomous and dissipative correction is identified as the boundary of the claim. A closing section documents the 2026 quantum-algorithms-and-QEC curriculum snapshot: the energy bill the paper prices is absent from the field's own teaching materials as of 2026-08-26.
Quantum error correction is priced in combinatorial currency — rate, distance, threshold — while the physical cost of performing correction goes uncounted. Every cycle of active (measurement-based) error correction erases information: syndrome extraction, majority voting, and ancilla re-initialization each reset redundancy, and Landauer's principle prices each erasure at no less than kT·ln2 per bit. This paper derives the resulting thermodynamic floor for correction overhead — (n−k)/k · kT·ln2 per logical qubit per round for an [[n,k]] code — verifies its scaling across code families (linear for repetition, quadratic for surface, constant for constant-rate), and applies the JPCUB joules-per-correct-answer metric to rank correction architectures. A two-level nested (tree-structured) code is compared with flat Hamming codes of equal rate on a clustered NAND-like channel: hierarchical decoding cuts the per-round erasure count by a factor of 1.6 to 3, while the naive construction pays a residual-error penalty — a partial null that leaves the floor claim intact and defines the protocol for an industrial flash-memory test. Biological systems that run robust quantum processes without correction (photosynthetic energy transfer, radical-pair magnetoreception) show the floor is an architecture choice: structure prepays in capital energy what correction pays in operating erasures. Autonomous and dissipative correction is identified as the boundary of the claim.
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.
Surface-code quantum error correction (QEC) is pivotal for fault-tolerant quantum computing, but its energy efficiency remains underexplored. This work derives a practical lower bound on the energy cost per logical-qubit operation, accounting for gate-fidelity decay's impact on code distance and physical-qubit overhead. By modeling the energy consumption of gate operations and error correction, we express the total cost as $ E = (E_g N_g + E_c N_c)/N_l $, where $ E_g $, $ E_c $, $ N_g $, $ N_c $, and $ N_l $ represent gate and physical-qubit energy costs, gate counts, physical-qubit counts, and logical qubit counts, respectively. Gate-fidelity decay increases the required code distance $ d $, scaling $ N_c $ and thus $ E $. We propose normalizing computational cost in joules per logical-qubit operation (JPCUB), isolating logical work from error-correction overhead. Quantitative predictions for $ E_g $, $ E_c $, and $ N_c $ remain [to verify], but the functional dependence on $ d $ and gate fidelities is established. This framework informs energy-efficient QEC design and benchmarks. ## 1. Introduction Surface codes enable fault-tolerant quantum computation by encoding logical qubits in a 2D lattice of physical qubits, correcting errors through syndrome measurements. However, the energy cost per logical operation—critical for scalability—remains poorly quantified. While theoretical foundations exist (Raussendorf & Terhal, 2006; Kitaev, 2003), prior work focuses on error-correction thresholds rather than energy efficiency. Here, we address this gap by deriving a lower bound on energy cost, considering how gate-fidelity decay necessitates larger code distances $ d $, increasing physical-qubit overhead $ N_c $. This analysis connects to the joules-per-compute (JPCUB) benchmark, advocating for energy normalization per logical qubit to disentangle computational work from error-correction costs. ## 2. Background Surface codes encode logical qubits using a 2D grid of
We present the ENSEMBLE-001 pilot study, reconciling three independent analyses of the minimum energy required to operate a fault-tolerant quantum computer at the 1,000-logical-qubit scale. The physics energy floor is defined by Landauer's limit on irreversible operations, the thermodynamic cost of error syndrome extraction, and the minimum overhead for magic-state distillation of non-Clifford gates. Our reconciled analysis finds that this physics floor lies 10^16–10^18 below current practical energy projections. The three independent writer legs converge on this headline figure but diverge on three methodological points: the logical-operation convention, the wall-power midpoint assumption, and the direction of the efficiency parameter η. We find a wall-power midpoint of 10–100 kW for sustained operation. The spread in the energy floor is primarily attributable to the choice of logical-op convention rather than physical disagreement. We conclude by identifying open questions regarding the applicability of the Landauer bound to reversible syndrome extraction and the scaling of these uncertainties to the 10,000-logical-qubit scale. ## 1. Introduction Fault-tolerant quantum computing (FTQC) relies on quantum error correction to protect logical qubits from physical noise. As architectures scale toward 1,000 logical qubits, the energy required for sustained operation becomes a critical bottleneck. This preprint details the ENSEMBLE-001 pilot study, which reconciles three independent analyses (writer legs a, b, and c) of the energy floor for FTQC at this scale. We define the energy floor as the minimum thermodynamic and computational energy required, assuming idealized physical components. We compare this floor to current practical resource estimates and track the provenance of divergences across the three independent analyses. ## 2. Background FTQC encodes logical qubits into many physical qubits using stabilizer codes, most notably the surface code [1]. To perform uni
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.
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.