dorsal/arxiv
View SchemaEfficient fault-tolerant quantum computing
| Authors | Andrew M. Steane |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9809054 |
| URL | https://arxiv.org/abs/quant-ph/9809054 |
| DOI | 10.1038/20127 |
Abstract
Fault tolerant quantum computing methods which work with efficient quantum error correcting codes are discussed. Several new techniques are introduced to restrict accumulation of errors before or during the recovery. Classes of eligible quantum codes are obtained, and good candidates exhibited. This permits a new analysis of the permissible error rates and minimum overheads for robust quantum computing. It is found that, under the standard noise model of ubiquitous stochastic, uncorrelated errors, a quantum computer need be only an order of magnitude larger than the logical machine contained within it in order to be reliable. For example, a scale-up by a factor of 22, with gate error rate of order $10^{-5}$, is sufficient to permit large quantum algorithms such as factorization of thousand-digit numbers.
{
"annotation_id": "a33e4227-16df-4d33-8ec4-9f7a917d41fb",
"date_created": "2026-03-02T18:02:44.968000Z",
"date_modified": "2026-03-02T18:02:44.968000Z",
"file_hash": "66d11a90439f1a45865cd9a747fc61b8ddb2fa85233fa9c8cd54658d15a94812",
"private": false,
"record": {
"abstract": "Fault tolerant quantum computing methods which work with efficient quantum\nerror correcting codes are discussed. Several new techniques are introduced to\nrestrict accumulation of errors before or during the recovery. Classes of\neligible quantum codes are obtained, and good candidates exhibited. This\npermits a new analysis of the permissible error rates and minimum overheads for\nrobust quantum computing. It is found that, under the standard noise model of\nubiquitous stochastic, uncorrelated errors, a quantum computer need be only an\norder of magnitude larger than the logical machine contained within it in order\nto be reliable. For example, a scale-up by a factor of 22, with gate error rate\nof order $10^{-5}$, is sufficient to permit large quantum algorithms such as\nfactorization of thousand-digit numbers.",
"arxiv_id": "quant-ph/9809054",
"authors": [
"Andrew M. Steane"
],
"categories": [
"quant-ph"
],
"doi": "10.1038/20127",
"title": "Efficient fault-tolerant quantum computing",
"url": "https://arxiv.org/abs/quant-ph/9809054"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "8097e507-2957-4716-9c81-d95675582151",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}