dorsal/arxiv
View SchemaQuantum accuracy threshold for concatenated distance-3 codes
| Authors | Panos Aliferis, Daniel Gottesman, John Preskill |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0504218 |
| URL | https://arxiv.org/abs/quant-ph/0504218 |
| Journal | Quant. Inf. Comput. 6 (2006) 97-165 |
Abstract
We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criteria for assessing the accuracy of fault-tolerant circuits, which are particularly conducive to the inductive analysis of recursive simulations. Our lower bound on the threshold, epsilon_0 > 2.73 \times 10^{-5} for an adversarial independent stochastic noise model, is derived from a computer-assisted combinatorial analysis; it is the best lower bound that has been rigorously proven so far.
{
"annotation_id": "ac9d1d71-c391-4ff0-8fc4-e7ce55d06c93",
"date_created": "2026-03-02T18:02:17.252000Z",
"date_modified": "2026-03-02T18:02:17.252000Z",
"file_hash": "052667c554671eb902b55bc772fbd4d8d8f113fda9ea23f33f78b8b9fe326481",
"private": false,
"record": {
"abstract": "We prove a new version of the quantum threshold theorem that applies to\nconcatenation of a quantum code that corrects only one error, and we use this\ntheorem to derive a rigorous lower bound on the quantum accuracy threshold\nepsilon_0. Our proof also applies to concatenation of higher-distance codes,\nand to noise models that allow faults to be correlated in space and in time.\nThe proof uses new criteria for assessing the accuracy of fault-tolerant\ncircuits, which are particularly conducive to the inductive analysis of\nrecursive simulations. Our lower bound on the threshold, epsilon_0 \u003e 2.73\n\\times 10^{-5} for an adversarial independent stochastic noise model, is\nderived from a computer-assisted combinatorial analysis; it is the best lower\nbound that has been rigorously proven so far.",
"arxiv_id": "quant-ph/0504218",
"authors": [
"Panos Aliferis",
"Daniel Gottesman",
"John Preskill"
],
"categories": [
"quant-ph"
],
"journal_ref": "Quant. Inf. Comput. 6 (2006) 97-165",
"title": "Quantum accuracy threshold for concatenated distance-3 codes",
"url": "https://arxiv.org/abs/quant-ph/0504218"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f57b6570-26c3-4d68-bc4b-02ecd694adac",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}