Exact analyses of computational time for factoring in quantum computers

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E88-A, Issue 1, 2005, Pages 105-111

  Kunihiro, Noboru ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Practical running time; Quantum circuit; Shor's factoring algorithm

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; QUANTUM THEORY;

PRACTICAL RUNNING TIME; QUANTUM CIRCUIT; SHOR'S FACTORING ALGORITHM;

ALGORITHMS;

EID: 27544463858     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/E88-A.1.105     Document Type: Conference Paper

References (13)

1. R. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Commun. ACM, vol.21, no.2, pp. 120-126, 1978.
2. RSA Laboratories, http://www.rsasecurity.com/rsalabs/
3. P.W. Shor, "Algorithms for quantum computation: Discrete log and factoring," Proc. 35th FOCS, pp. 124-134, 1994.
4. L.M. K. Vandersypen, M. Steffen, G. Breyta, C.S. Yannoni, M.H. Sherwood, and I.L. Chuang, "Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance," quant-ph/0112176, or Nature, vol.414, pp.883-887, 2001.
5. D.P. DiVincenzo, "The physical implementation of quantum computation," quant-ph/0002077, 2000.
6. M. Nielsen and I.L Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.
7. D. Beckman, A.N. Chari, S. Davebhaktuni, and J. Preskill, "Efficient networks for quantum factoring," quant-ph/9602016v1, 1996.
8. V. Vedral, A. Barenco, and A. Ekert, "Quantum networks for elementary arithmetic operations," Phys. Rev. A, vol.54, no.1, pp. 147-153, 1996.
9. S. Beauregard, "Circuit for Shor's algorithm using 2n + 3 qubits," quant-ph/0205095v2, 2002.
10. A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, "Elementary gates for quantum computation," Phys. Rev. A, vol.52, pp.3457-3467, 1995.
11. T.G. Draper, "Addition on a quantum computer," quant-ph/0008033v1, 2000.
12. A. Schönhage and V. Strassen, "Schnelle Multiplikation grosser Zahlen," Computing, vol.7, pp.281-292, 1971.
13. R. Cleve, A. Ekert, C. Macchivello, and M. Mosca, "Quantum algorithms revisited," Proc. R. Soc. London A, no.454, pp.339-354, 1998.