dorsal/arxiv
View SchemaRobustness of Shor's algorithm
| Authors | Simon J. Devitt, Austin G. Fowler, Lloyd C. L. Hollenberg |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0408081 |
| URL | https://arxiv.org/abs/quant-ph/0408081 |
| Journal | Quant. Inf. Comp. 6, 616-629 (2006) |
Abstract
Shor's factorisation algorithm is a combination of classical pre- and post-processing and a quantum period finding (QPF) subroutine which allows an exponential speed up over classical factoring algorithms. We consider the stability of this subroutine when exposed to a discrete error model that acts to perturb the computational trajectory of a quantum computer. Through detailed state vector simulations of an appropriate quantum circuit, we show that the error locations within the circuit itself heavily influences the probability of success of the QPF subroutine. The results also indicate that the naive estimate of required component precision is too conservative.
{
"annotation_id": "cb02f361-a3d0-4436-9fc5-8c782ee6c93e",
"date_created": "2026-03-02T18:02:10.324000Z",
"date_modified": "2026-03-02T18:02:10.324000Z",
"file_hash": "0d22bedfe0f1541ec7fb9a9ac6f9868cfcdf4f4b2f3d47dfa91fa8d27b9672c5",
"private": false,
"record": {
"abstract": "Shor\u0027s factorisation algorithm is a combination of classical pre- and\npost-processing and a quantum period finding (QPF) subroutine which allows an\nexponential speed up over classical factoring algorithms. We consider the\nstability of this subroutine when exposed to a discrete error model that acts\nto perturb the computational trajectory of a quantum computer. Through detailed\nstate vector simulations of an appropriate quantum circuit, we show that the\nerror locations within the circuit itself heavily influences the probability of\nsuccess of the QPF subroutine. The results also indicate that the naive\nestimate of required component precision is too conservative.",
"arxiv_id": "quant-ph/0408081",
"authors": [
"Simon J. Devitt",
"Austin G. Fowler",
"Lloyd C. L. Hollenberg"
],
"categories": [
"quant-ph"
],
"journal_ref": "Quant. Inf. Comp. 6, 616-629 (2006)",
"title": "Robustness of Shor\u0027s algorithm",
"url": "https://arxiv.org/abs/quant-ph/0408081"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "8687165f-65b8-4cbf-ad0b-02ff9df80b04",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}