Twenty Million Noisy Qubits for Eight Hours: A Resource Audit of Fault-Tolerant Factoring Estimates

The most quoted resource estimate in quantum computing holds that factoring a 2048-bit RSA integer takes 20,000,000 noisy physical qubits running for eight hours. This paper audits that estimate as a budget: what the headline total is composed of, which assumptions carry the most weight, and how the total moves when each assumption is perturbed. The implied census is 3,232 physical qubits per logical qubit across 6189 logical qubits, a figure far above the bare patch census at the estimate's working distance, with the difference accounted for by magic-state factories, routing and the estimate's deliberate conservatism. The total work is 1.6e8 physical-qubit-hours, and the non-Clifford throughput implied by the schedule is about 90,278 Toffoli-class operations per second sustained for the full run. Sensitivity analysis shows the total is hostage chiefly to physical error rates and cycle time, the two inputs a hardware program can actually move.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24245569
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Twenty Million Noisy Qubits for Eight Hours: A Resource Audit of Fault-Tolerant Factoring Estimates

William Alexander Aldred
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
article

Twenty Million Noisy Qubits for Eight Hours: A Resource Audit of Fault-Tolerant Factoring Estimates

William Alexander Aldred
article en

Abstract

The most quoted resource estimate in quantum computing holds that factoring a 2048-bit RSA integer takes 20,000,000 noisy physical qubits running for eight hours. This paper audits that estimate as a budget: what the headline total is composed of, which assumptions carry the most weight, and how the total moves when each assumption is perturbed. The implied census is 3,232 physical qubits per logical qubit across 6189 logical qubits, a figure far above the bare patch census at the estimate's working distance, with the difference accounted for by magic-state factories, routing and the estimate's deliberate conservatism. The total work is 1.6e8 physical-qubit-hours, and the non-Clifford throughput implied by the schedule is about 90,278 Toffoli-class operations per second sustained for the full run. Sensitivity analysis shows the total is hostage chiefly to physical error rates and cycle time, the two inputs a hardware program can actually move.

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Twenty Million Noisy Qubits for Eight Hours: A Resource Audit of Fault-Tolerant Factoring Estimates — William Alexander Aldred · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS