dorsal/arxiv
View SchemaFast fault-tolerant filtering of quantum codewords
| Authors | Andrew M. Steane |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0202036 |
| URL | https://arxiv.org/abs/quant-ph/0202036 |
Abstract
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of symmetry. The required accuracy can be achieved by measuring parity checks, using imperfect apparatus, and rejecting states which fail them. This filtering process is considered for t-error-correcting codes with t>1. It is shown how to exploit the structure of the codeword and the check matrix, so that the filter is reduced to a minimal form where each parity check need only be measured once, not > t times by the (noisy) verification apparatus. This both raises the noise threshold and also reduces the physical size of the computer. A method based on latin rectangles is proposed, which enables the most parallel version of a logic gate network to be found, for a class of networks including those used in verification. These insights allowed the noise threshold to be increased by an order of magnitude.
{
"annotation_id": "c3d0e80f-74e2-4020-a44c-d3ce8762406b",
"date_created": "2026-03-02T18:01:49.436000Z",
"date_modified": "2026-03-02T18:01:49.436000Z",
"file_hash": "ed6d65d183b3ba7262ba27161ab9f11d1bc0493c327d1c492bde33b0f0dfa9bf",
"private": false,
"record": {
"abstract": "The stabilization of a quantum computer by repeated error correction can be\nreduced almost entirely to repeated preparation of blocks of qubits in quantum\ncodeword states. These are multi-particle entangled states with a high degree\nof symmetry. The required accuracy can be achieved by measuring parity checks,\nusing imperfect apparatus, and rejecting states which fail them. This filtering\nprocess is considered for t-error-correcting codes with t\u003e1. It is shown how to\nexploit the structure of the codeword and the check matrix, so that the filter\nis reduced to a minimal form where each parity check need only be measured\nonce, not \u003e t times by the (noisy) verification apparatus. This both raises the\nnoise threshold and also reduces the physical size of the computer. A method\nbased on latin rectangles is proposed, which enables the most parallel version\nof a logic gate network to be found, for a class of networks including those\nused in verification. These insights allowed the noise threshold to be\nincreased by an order of magnitude.",
"arxiv_id": "quant-ph/0202036",
"authors": [
"Andrew M. Steane"
],
"categories": [
"quant-ph"
],
"title": "Fast fault-tolerant filtering of quantum codewords",
"url": "https://arxiv.org/abs/quant-ph/0202036"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "32dea031-4a58-49de-8af9-2142669f6a77",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}