Shor's algorithm with fewer (pure) qubits
| dc.creator | Zalka, Christof | |
| dc.date | 2006-01-15 | |
| dc.date.accessioned | 2026-07-07T07:00:26Z | |
| dc.date.available | 2026-07-07T07:00:26Z | |
| dc.description | 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. | |
| dc.description | 12 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0601097 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0601097 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/108028 | |
| dc.subject | Quantum Physics | |
| dc.title | Shor's algorithm with fewer (pure) qubits | |
| dc.type | text |