Circuit for Shor's algorithm using 2n+3 qubits

Quantum Information and Computation

Volumn 3, Issue 2, 2003, Pages 175-185

  Beauregard, Stephane ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Factorization; Modular arithmetics; Quantum circuits

Indexed keywords

FACTORIZATION; POLYNOMIAL APPROXIMATION; TIMING CIRCUITS;

FACTORIZATION ALGORITHMS; MODULAR ARITHMETIC; POLYNOMIAL-TIME; QUANTUM CIRCUIT; QUANTUM GATES; SHOR'S ALGORITHMS;

QUBITS;

EID: 0141642064     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. P. Shor (1997), Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comp., 26, pp. 1484-1509. Also on quant-ph/9508027.
2. R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca (1998), Quantum algorithms revisited, Proc. R. Soc. London A, 454, pp. 339-354. Also on quant-ph/9708016.
3. Michael A. Nielsen and Isaac L. Chuang (2000), Quantum Computation and Quantum Information. Cambridge University Press (Cambridge).
4. R. Cleve and J. Watrous (2000), Fast parallel circuits for the quantum Fourier transform, Proceedings 41st Annual Symposium on Foundations of Computer Science (FOCS'00), pp. 526-536. Also on quant-ph/0006004.
5. V. Vedral, A. Barenco, and A. Ekert (1996), Quantum networks for elementary arithmetic operations, Phys. Rev. A, 54, pp. 147-153. Also on quant-ph/9511018.
6. T. Draper (2000), Addition on a quantum computer, quant-ph/0008033.
7. M. Mosca and A. Ekert (1999), The hidden subgroup problem and eigenvalue estimation on a quantum computer, Lecture Notes in Computer Science, 1509, pp. 174-188. Also on quant-ph/9903071.
8. C. Zalka (1998), Fast versions of Shor's quantum factoring algorithm, quant-ph/9806084.
9. S. Parker and M.B. Plenio (2000), Efficient factorization with a single pure qubit and logN mixed qubits, Phys. Rev. Lett., 85, pp. 3049-3052. Also on quant-ph/0001066.
10. D. Coppersmith (1996), An approximate Fourier transform useful in quantum factoring, IBM Research Report No. RC19642. Also on quant-ph/0201067.
11. C. Moore and M. Nilsson (2002), Parallel quantum computation and quantum codes, SIAM J. Comp., 31, pp. 799-815. Also on quant-ph/9808027.
12. A. Barenco, C. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J.A. Smolin, and H. Weifurter (1995), Elementary gates for quantum computation, Phys. Rev. A, 52, pp. 3457-3467. Also on quant-ph/9503016.
13. D. Beckman, A.N. Chari, S. Devabhaktuni, and J. Preskill (1996), Efficient networks for quantum factoring, Phys. Rev. A, 54, pp. 1034-1063. Also on quant-ph/9602016.
14. L.M.K. Vandersypen, M. Steffen, G. Breyta, C.S. Yannoni, M.H. Sherwood, and I.L. Chuang (2001), Experimental realization of Shor's quantum factoring algorithm using magnetic resonance, Nature, 414, pp. 883-887.