Quantum arithmetic circuits: A survey

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E92-A, Issue 5, 2009, Pages 1276-1283

  Takahashi, Yasuhiro ^a  

^a Nippon Telegraph and Telephone Corporation   (Japan)

Author keywords

Elementary arithmetic operations; Quantum circuits; Shor's factoring algorithm

Indexed keywords

QUANTUM COMPUTERS; TIMING CIRCUITS;

ARITHMETIC CIRCUIT; ARITHMETIC OPERATIONS; COMPUTATIONAL POWER; PAPER SURVEYS; QUANTUM CIRCUIT; QUANTUM FOURIER TRANSFORMS; SHOR'S FACTORING ALGORITHM;

SURVEYS;

EID: 77956032251     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1587/transfun.E92.A.1276     Document Type: Article

References (25)

1. P.W. Shor, "Algorithms for quantum computation: Discrete logarithms and factoring," Proc. 35th IEEE Symposium on Foundations of Computer Science, pp.124-134, 1994.
2. A.G. Fowler, S.J. Devitt, and L.C.L. Hollenberg, "Implementation of Shor's algorithm on a linear nearest neighbour qubit array," Quantum Information and Computation, vol.4, no.4, pp.237-251, 2004.
3. Y. Takahashi, N. Kunihiro, and K. Ohta, "The quantum Fourier transform on a linear nearest neighbor architecture," Quantum Information and Computation, vol.7, no.4, pp.383-391, 2007.
4. J. Proos and C. Zalka, "Shor's discrete logarithm quantum algorithm for elliptic curves," Quantum Information and Computation, vol.3, no.4, pp.317-344, 2003.
5. P. Kaye, "Optimized quantum implementation of elliptic curve arithmetic over binary fields," Quantum Information and Computation, vol.5, no.6, pp.474-491, 2005.
6. N. Kunihiro, "Exact analyses of computational time for factoring in quantum computers," IEICE Trans. Fundamentals, vol.E88-A, no.1, pp.105-111, Jan. 2005.
7. D. Cheung, D. Maslov, J. Mathew, and D.K. Pradhan, "On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography," Theory of Quantum Computation, Communication, and Cryptography, Lecture Notes in Computer Science, vol.5106, pp.96-104, 2008.
8. R. Cleve and J. Watrous, "Fast parallel circuits for the quantum Fourier transform," Proc. 41st IEEE Symposium on Foundations of Computer Science, pp.526-536, 2000.
9. D. Bera, F. Green, and S. Homer, "Small depth quantum circuits," ACM SIGACT News, vol.38, no.2, pp.35-50, 2007.
10. T.G. Draper, "Addition on a quantum computer," quant-ph/0008033, 2000.
11. J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, vol.A: Algorithms and Complexity, Elsevier, 1990.
12. M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.
13. D. Coppersmith, "An approximate Fourier transform useful in quantum factoring," quant-ph/0201067, 1994.
14. C. Moore and M. Nilsson, "Parallel quantum computation and quantum codes," SIAM J. Comput., vol.31, no.3, pp.799-815, 2002.
15. M. Mosca and A. Ekert, "The hidden subgroup problem and eigenvalue estimation on a quantum computer," Quantum Computing and Quantum Communications: First NASA International Conference, Lecture Notes in Computer Science, vol.1509, pp.174-188, 1999.
16. S. Beauregard, "Circuit for Shor's algorithm using 2n + 3 qubits," Quantum Information and Computation, vol.3, no.2, pp.175-185, 2003.
17. V. Vedral, A. Barenco, and A. Ekert, "Quantum networks for elementary arithmetic operations," Phys. Rev. A, vol.54, no.1, pp.147-153, 1996.
18. S.A. Cuccaro, T.G. Draper, S.A. Kutin, and D.P. Moulton, "A new quantum ripple-carry addition circuit," quant-ph/0410184, 2004.
19. Y. Takahashi and N. Kunihiro, "A linear-size quantum circuit for addition with no ancillary qubits," Quantum Information and Computation, vol.5, no.6, pp.440-448, 2005.
20. Y. Takahashi and N. Kunihiro, "A quantum circuit for Shor's factoring algorithm using 2n + 2 qubits," Quantum Information and Computation, vol.6, no.2, pp.184-192, 2006.
21. G. Ahokas, R. Cleve, and L. Hales, "The complexity of quantum Fourier transforms and integer multiplication," Proc. ERATO Conference on Quantum Information Science 2003, pp.39-40, 2003.
22. T.G. Draper, S.A. Kutin, E.M. Rains, and K.M. Svore, "A logarithmic-depth quantum carry-lookahead adder," Quantum Information and Computation, vol.6, no.4&5, pp.351-369, 2006.
23. Y. Takahashi and N. Kunihiro, "A fast quantum circuit for addition with few qubits," Quantum Information and Computation, vol.8, no.6&7, pp.636-649, 2008.
24. C. Zalka, "Shor's algorithm with fewer (pure) qubits," quantph/ 0601097, 2006.
25. M. Fürer, "Faster integer multiplication," Proc. 39th ACM Symposium on Theory of Computing, pp.57-66, 2007.