A quantum circuit for shor's factoring algorithm using 2n + 2 qubits

Quantum Information and Computation

Volumn 6, Issue 2, 2006, Pages 184-192

  Takahashi, Yasuhiro ^a   Kunihiro, Noboru ^b  

^a NTT Communication Science Laboratories   (Japan)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Elementary arithmetic operations; Factoring; Quantum circuits

Indexed keywords

TIMING CIRCUITS;

ARITHMETIC OPERATIONS; FACTORING; QUANTUM CIRCUIT; SHOR'S FACTORING ALGORITHM;

QUBITS;

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

References (15)

1. P. W. Shor (1994), Algorithms for quantum computation: discrete logarithms and factoring, Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 124-134.
2. S. Beauregard (2003), Circuit for Shor's algorithm using 2n + 3 qubits, Quantum Information and Computation, Vol. 3 No. 2, pp. 175-185.
3. D. Beckman, A. N. Chari, S. Devabhaktuni, and J. Preskill (1996), Efficient networks for quantum factoring, Physical Review A, Vol. 54 No. 2, pp. 1034-1063.
4. R. Cleve and J. Watrous (2000), Fast parallel circuits for the quantum Fourier transform, Proc. 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 526-536.
5. T. G. Draper (2000), Addition on a quantum computer, quant-ph/0008033.
6. N. Kunihiro (2005), Exact analyses of computational time for factoring in quantum computers, IEICE TRANS. FUNDAMENTALS, Vol. E88-A No.1, pp. 105-111.
7. R. Van Meter (2004), Fast quantum modular exponentiation, quant-ph/0408006.
8. V. Vedral, A. Barenco, and A. Ekert (1996), Quantum networks for elementary arithmetic operations, Physical Review A, Vol. 54 No. 1, pp. 147-153.
9. C. Zalka (1998), Fast versions of Shor's quantum factoring algorithm, quant-ph/9806084.
10. D. Coppersmith (1996), An approximate Fourier transform useful in quantum factoring, quantph/0201067.
11. M. Mosca and A. Ekert (1999), The hidden subgroup problem and eigenvalue estimation on a quantum computer, Lecture Notes in Computer Science, Vol. 1509, pp. 174-188.
12. M. A. Nielsen and I. L. Chuang (2000), Quantum Computation and Quantum Information, Cambridge University Press.
13. T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore (2004), A logarithmic-depth quantum carry-lookahead adder, Proc. ERATO Conference on Quantum Information Science 2004, pp. 23-24. Also on quant-ph/0406142.
14. N. W. Panike (2000), Approximate errors, quant-ph/0008056.
15. Y. Takahashi and N. Kunihiro (2005), A linear-size quantum circuit for addition with no ancillary qubits, Quantum Information and Computation, Vol. 5 No. 6, pp. 440-448.