← All papers

A Lower Bound on Energy Cost per Logical-Qubit Operation in Surface-Code Quantum Error Correction

DOI: 10.5281/zenodo.22278600
Published: 2026-09-03

A Lower Bound on Energy Cost per Logical-Qubit Operation in Surface-Code Quantum Error Correction

Abstract

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 physical qubits, with code distance $ d $ determining error-correction capability. A larger $ d $ increases the number of physical qubits $ n \propto d^2 $ and reduces the logical error rate $ \epsilon_l \propto \exp(-d/\xi) $, where $ \xi $ is the error threshold (Fowler et al., 2012). Gate fidelity $ F_i $, the probability that a gate operates correctly, degrades with system complexity, requiring higher $ d $ to maintain $ \epsilon_l $. The energy cost $ E $ combines gate operations $ E_g N_g $ and physical-qubit operations $ E_c N_c $, normalized by logical qubits $ N_l $.

3. Analysis

The energy cost per logical operation is decomposed into:

  1. Gate operations: $ E_g N_g $, where $ N_g $ depends on the quantum algorithm and surface-code implementation.
  2. Physical-qubit operations: $ E_c N_c $, with $ N_c = n / N_l \propto d^2 / N_l $.

Gate-fidelity decay $ 1 - F_i $ increases $ d $, as $ d \propto \log(1/\epsilon_l) $ (Duclos-Cianci & Poulin, 2013). Thus, $ E $ scales with $ d^2 $, assuming $ E_g $, $ E_c $, and $ N_g $ are fixed. Experimental data for $ E_g $ and $ E_c $ remain [to verify], but theoretical models (Fowler et al., 2012) suggest $ E_c \sim 10^{-18} $ J per operation.

4. Results

The derived lower bound on $ E $ is:

$$ E \geq \frac{E_g N_g + E_c \cdot \left(\frac{d^2}{N_l}\right)}{N_l} $$

This shows $ E $ increases quadratically with $ d $, driven by $ N_c $. For example, doubling $ d $ from 5 to 10 raises $ N_c $ by a factor of 4, assuming $ N_l $ is constant. Quantitative values for $ E_g $, $ E_c $, and $ N_g $ are [to verify], but the functional form is robust.

5. Discussion

The JPCUB metric normalizes energy cost per logical qubit, enabling comparisons across architectures. Surface codes face trade-offs: higher $ d $ reduces logical error rates but escalates energy costs. Alternative codes (e.g., color codes) may offer better energy efficiency, but their $ d $-scaling remains unverified. Open questions include optimizing $ N_g $ through error-mitigation techniques and quantifying $ E_g $ for superconducting vs. photonic qubits.

6. Conclusion

This work establishes a lower bound on energy cost per logical-qubit operation for surface-code QEC, emphasizing the interplay between gate fidelity, code distance, and physical overhead. By introducing JPCUB, we provide a framework to evaluate energy efficiency in fault-tolerant quantum computing. Future work requires experimental validation of $ E_g $, $ E_c $, and $ N_g $ to refine the bound.

References

  1. Raussendorf, R., & Terhal, B. (2006). A fault-tolerant quantum computation scheme based on the surface code. Physical Review A, 74(5), 052316. arXiv:quant-ph/0510124
  2. Kitaev, A. (2003). Fault-tolerant quantum computation using the surface code. Quantum Information & Computation, 3(4), 843–873. arXiv:quant-ph/0204079
  3. Fowler, A. G., et al. (2012). Surface code quantum error correction. arXiv preprint arXiv:1205.2011. arXiv:1205.2011
  4. Duclos-Cianci, G., & Poulin, D. (2013). Fault-tolerant quantum error correction for the surface code. Physical Review Letters, 111(20), 200501. DOI:10.1103/PhysRevLett.111.200501