dorsal/arxiv
View SchemaFault-Tolerant Postselected Quantum Computation: Schemes
| Authors | E. Knill |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0402171 |
| URL | https://arxiv.org/abs/quant-ph/0402171 |
Abstract
Postselected quantum computation is distinguished from regular quantum computation by accepting the output only if measurement outcomes satisfy predetermined conditions. The output must be accepted with nonzero probability. Methods for implementing postselected quantum computation with noisy gates are proposed. These methods are based on error-detecting codes. Conditionally on detecting no errors, it is expected that the encoded computation can be made to be arbitrarily accurate. Although the probability of success of the encoded computation decreases dramatically with accuracy, it is possible to apply the proposed methods to the problem of preparing arbitrary stabilizer states in large error-correcting codes with local residual errors. Together with teleported error-correction, this may improve the error tolerance of non-postselected quantum computation.
{
"annotation_id": "6b1068ff-7b44-413c-84b5-716c2bedc9e8",
"date_created": "2026-03-02T18:02:06.875000Z",
"date_modified": "2026-03-02T18:02:06.875000Z",
"file_hash": "460eaa98fb09053692bd37f8355b7c8d5fbd50b1abced39950a768b61162a04b",
"private": false,
"record": {
"abstract": "Postselected quantum computation is distinguished from regular quantum\ncomputation by accepting the output only if measurement outcomes satisfy\npredetermined conditions. The output must be accepted with nonzero probability.\nMethods for implementing postselected quantum computation with noisy gates are\nproposed. These methods are based on error-detecting codes. Conditionally on\ndetecting no errors, it is expected that the encoded computation can be made to\nbe arbitrarily accurate. Although the probability of success of the encoded\ncomputation decreases dramatically with accuracy, it is possible to apply the\nproposed methods to the problem of preparing arbitrary stabilizer states in\nlarge error-correcting codes with local residual errors. Together with\nteleported error-correction, this may improve the error tolerance of\nnon-postselected quantum computation.",
"arxiv_id": "quant-ph/0402171",
"authors": [
"E. Knill"
],
"categories": [
"quant-ph"
],
"title": "Fault-Tolerant Postselected Quantum Computation: Schemes",
"url": "https://arxiv.org/abs/quant-ph/0402171"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "ff3ade8f-f850-4dd6-bd8d-2746c878cee9",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}