Skip to content
DraconiticResearch
Search Sources API
182,460 studies31 sourcesUpdated 50 min ago
PreprintarXiv licencearXiv

Energetics of Fault-Tolerant Spin-Qubit Quantum Computation

Abstract

Semiconductor spin qubits offer a promising route to compact and scalable quantum computers, combining long coherence times in isotopically purified silicon with compatibility with semiconductor manufacturing. Beyond computational speedup, their energy efficiency is an important consideration for future large-scale systems. We evaluate the power and energy requirements of a Loss-DiVincenzo spin-qubit quantum computer by analyzing the Quantum Fourier Transform (QFT) and benchmarking it against the classical Fast Fourier Transform (FFT). We develop a detailed energy budget, identifying cryogenic cooling as the dominant baseline contribution before quantum error correction (QEC). The comparison between the QFT and the classical FFT reveals that, for any quantum workload operating under a polynomially bounded sampling regime, the crossover in energy consumption occurs at smaller problem sizes than the crossover in execution time. Thus, quantum computing can become energetically competitive before achieving a speedup in execution time. We then incorporate surface-code QEC and analyze the energy costs of QEC cycles, gate synthesis, and decoding. At scale, instrumentation and decoding become dominant contributions, while cryogenic cooling imposes a constraint on scalability. We show that optimizing the control-signal demultiplexing ratio can reduce the overall energy cost by approximately two orders of magnitude. For a system with about one million physical qubits, we estimate a power consumption of approximately 100 kW, at least one order of magnitude below that of today's highest-performance classical computing systems.

Related

  1. Fault-tolerant quantum computation with static atomic buses
    M. Bergonzoni, L. Pecorari, S. A. Norrell +3
    PRX QuantumPeer-reviewedCC BY 4.0Quantum physics & quantum informationCrossref
  2. Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes
    Nathaniel Selub, Aditya Bhardwaj, Ethan Lake
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationStatistical & nonlinear physicsarXiv
  3. Purely-logarithmic-time- and constant-space-overhead fault-tolerant quantum computation
    Zhengyi Han, Zi-Wen Liu
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Towards fault-tolerant quantum computation with universal continuous-variable gates
    Sheron Blair, Francesco Arzani, Giulia Ferrini +1
    HALPreprintCC BY 4.0Full textQuantum physics & quantum informationHAL
  5. Signal-to-noise problems in fault-tolerant quantum computation
    Hyunwoo Oh
    arXivPreprintarXiv licenceFull textHigh-energy & particle physicsNuclear physicsarXiv
BibTeX
@misc{santos2026energetics,
  title = {{Energetics of Fault-Tolerant Spin-Qubit Quantum Computation}},
  author = {João Santos and Jayshankar Nath and Marco Pezzutto and Valentin Savin and Tristan Meunier and Yasser Omar},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.22199},
  eprint = {2610.22199},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.22199},
}
RIS
TY  - UNPB
TI  - Energetics of Fault-Tolerant Spin-Qubit Quantum Computation
AU  - João Santos
AU  - Jayshankar Nath
AU  - Marco Pezzutto
AU  - Valentin Savin
AU  - Tristan Meunier
AU  - Yasser Omar
PY  - 2026
DA  - 2026/10/15
PB  - arXiv
DO  - 10.48550/arxiv.2610.22199
UR  - https://arxiv.org/abs/2610.22199
AB  - Semiconductor spin qubits offer a promising route to compact and scalable quantum computers, combining long coherence times in isotopically purified silicon with compatibility with semiconductor manufacturing. Beyond computational speedup, their energy efficiency is an important consideration for future large-scale systems. We evaluate the power and energy requirements of a Loss-DiVincenzo spin-qubit quantum computer by analyzing the Quantum Fourier Transform (QFT) and benchmarking it against the classical Fast Fourier Transform (FFT). We develop a detailed energy budget, identifying cryogenic cooling as the dominant baseline contribution before quantum error correction (QEC). The comparison between the QFT and the classical FFT reveals that, for any quantum workload operating under a polynomially bounded sampling regime, the crossover in energy consumption occurs at smaller problem sizes than the crossover in execution time. Thus, quantum computing can become energetically competitive before achieving a speedup in execution time. We then incorporate surface-code QEC and analyze the energy costs of QEC cycles, gate synthesis, and decoding. At scale, instrumentation and decoding become dominant contributions, while cryogenic cooling imposes a constraint on scalability. We show that optimizing the control-signal demultiplexing ratio can reduce the overall energy cost by approximately two orders of magnitude. For a system with about one million physical qubits, we estimate a power consumption of approximately 100 kW, at least one order of magnitude below that of today's highest-performance classical computing systems.
ER  -