dorsal/arxiv
View SchemaFault-tolerance threshold for a distance-three quantum code
| Authors | Ben W. Reichardt |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0509203 |
| URL | https://arxiv.org/abs/quant-ph/0509203 |
Abstract
The quantum error threshold is the highest (model-dependent) noise rate which we can tolerate and still quantum-compute to arbitrary accuracy. Although noise thresholds are frequently estimated for the Steane seven-qubit, distance-three quantum code, there has been no proof that a constant threshold even exists for distance-three codes. We prove the existence of a constant threshold. The proven threshold is well below estimates, based on simulations and analytic models, of the true threshold, but at least it is now known to be positive.
{
"annotation_id": "53faeee2-e6ff-4701-85ff-4a581c9fc3c6",
"date_created": "2026-03-02T18:02:20.482000Z",
"date_modified": "2026-03-02T18:02:20.482000Z",
"file_hash": "a0c275b0bd965e8da82452c2df95969c3872cbd8acd37ccfbf2ef3685d35986e",
"private": false,
"record": {
"abstract": "The quantum error threshold is the highest (model-dependent) noise rate which\nwe can tolerate and still quantum-compute to arbitrary accuracy. Although noise\nthresholds are frequently estimated for the Steane seven-qubit, distance-three\nquantum code, there has been no proof that a constant threshold even exists for\ndistance-three codes. We prove the existence of a constant threshold. The\nproven threshold is well below estimates, based on simulations and analytic\nmodels, of the true threshold, but at least it is now known to be positive.",
"arxiv_id": "quant-ph/0509203",
"authors": [
"Ben W. Reichardt"
],
"categories": [
"quant-ph"
],
"title": "Fault-tolerance threshold for a distance-three quantum code",
"url": "https://arxiv.org/abs/quant-ph/0509203"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "712b9a4e-8818-4b67-a3cb-922b74c8a15c",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}