Physical Qubits per Logical Qubit in Rotated Surface Codes: An Overhead Census from Distance Three to Forty-One

Every overhead discussion in fault-tolerant quantum computing eventually reduces to a census: how many physical qubits stand behind one logical qubit. For the rotated surface code the census is exact arithmetic, 2d squared minus 1, split between d squared data qubits and d squared minus 1 measure qubits. This paper tabulates the census from distance three to forty-one, prices machines of ten, one hundred, one thousand and 6189 logical qubits at representative distances, and adds the multipliers that headline figures omit: routing lanes between patches, spare patches held against fabrication defects, and the measure-qubit share of the control load. The bare census at distance twenty-seven is 1457 physical qubits per logical qubit; a thousand-logical-qubit machine at distance twenty-one already needs 881,000 physical qubits before a single routing lane or factory is counted. Overhead is not a fudge factor applied at the end of a design; it is the design, and it is quadratic in the one parameter, distance, that error rates dictate.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24245507
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

Physical Qubits per Logical Qubit in Rotated Surface Codes: An Overhead Census from Distance Three to Forty-One

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

Physical Qubits per Logical Qubit in Rotated Surface Codes: An Overhead Census from Distance Three to Forty-One

William Alexander Aldred
article en

Abstract

Every overhead discussion in fault-tolerant quantum computing eventually reduces to a census: how many physical qubits stand behind one logical qubit. For the rotated surface code the census is exact arithmetic, 2d squared minus 1, split between d squared data qubits and d squared minus 1 measure qubits. This paper tabulates the census from distance three to forty-one, prices machines of ten, one hundred, one thousand and 6189 logical qubits at representative distances, and adds the multipliers that headline figures omit: routing lanes between patches, spare patches held against fabrication defects, and the measure-qubit share of the control load. The bare census at distance twenty-seven is 1457 physical qubits per logical qubit; a thousand-logical-qubit machine at distance twenty-one already needs 881,000 physical qubits before a single routing lane or factory is counted. Overhead is not a fudge factor applied at the end of a design; it is the design, and it is quadratic in the one parameter, distance, that error rates dictate.

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
Physical Qubits per Logical Qubit in Rotated Surface Codes: An Overhead Census from Distance Three to Forty-One — William Alexander Aldred · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS