dorsal/arxiv
View SchemaShor's algorithm with fewer (pure) qubits
| Authors | Christof Zalka |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0601097 |
| URL | https://arxiv.org/abs/quant-ph/0601097 |
Abstract
In this note we consider optimised circuits for implementing Shor's quantum factoring algorithm. First I give a circuit for which none of the about 2n qubits need to be initialised (though we still have to make the usual 2n measurements later on). Then I show how the modular additions in the algorithm can be carried out with a superposition of an arithmetic sequence. This makes parallelisation of Shor's algorithm easier. Finally I show how one can factor with only about 1.5n qubits, and maybe even fewer.
{
"annotation_id": "c560f44e-7774-449c-a31b-5c43387e4d6d",
"date_created": "2026-03-02T18:02:24.084000Z",
"date_modified": "2026-03-02T18:02:24.084000Z",
"file_hash": "5f3b9a700ddabb776be717e8b2b26deafd6f2744854e6ff16539af8d2d66a631",
"private": false,
"record": {
"abstract": "In this note we consider optimised circuits for implementing Shor\u0027s quantum\nfactoring algorithm. First I give a circuit for which none of the about 2n\nqubits need to be initialised (though we still have to make the usual 2n\nmeasurements later on). Then I show how the modular additions in the algorithm\ncan be carried out with a superposition of an arithmetic sequence. This makes\nparallelisation of Shor\u0027s algorithm easier. Finally I show how one can factor\nwith only about 1.5n qubits, and maybe even fewer.",
"arxiv_id": "quant-ph/0601097",
"authors": [
"Christof Zalka"
],
"categories": [
"quant-ph"
],
"title": "Shor\u0027s algorithm with fewer (pure) qubits",
"url": "https://arxiv.org/abs/quant-ph/0601097"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7ad12168-dbe0-424b-ab93-3945313b4535",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}