Primality test via quantum factorization

International Journal of Modern Physics C

Volumn 8, Issue 2, 1997, Pages 131-138

  Chau, H F ^a,b   Lo, H K ^a,c  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c HEWLETT PACKARD LABORATORIES   (United Kingdom)

Author keywords

Computational Complexity; Pocklington Lehmer N 1 Primality Test; Quantum Computation; Quantum Factorization; Shor's Algorithm

Indexed keywords

EID: 0031531029     PISSN: 01291831     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129183197000138     Document Type: Article

References (29)

1. See for example, N. Koblitz, A Course in Number Theory and Cryptography, 2nd ed. (Springer-Verlag, New York, 1994), Chaps. 2-3.
2. P. Benioff, Phys. Rev. Lett. 48, 1581 (1982).
3. R. P. Feynman, Int. J. Theo. Phys. 21, 467 (1982).
4. R. P. Feynman, Found. Phys. 16, 507 (1986).
5. D. Deutsch, Proc. Roy. Soc. Lond. A400, 97 (1985).
6. D. Deutsch, Proc. Roy. Soc. Lond. A425, 73 (1989).
7. P. Shor, in Proceedings of the 35th Annual Symposium on the Foundation of Computer Science (IEEE Computer Society, Los Alamitos, CA, 1994), p. 124.
8. See also A. Ekert, and R. Jozsa, Rev. Mod. Phys. 68, 733 (1996).
9. C. H. Bennett, Phys. Rev. Lett. 68, 3121 (1992).
10. R. Jozsa and B. Schumacher, J. Mod. Optics 41, 2343 (1994).
11. B. Schumacher, Phys. Rev. A51, 2738 (1995).
12. A. Barenco, Proc. Roy. Soc. Lond. A449, 679 (1995).
13. L. Adleman, C. Pomerance, and R. Rumely, Ann. Math. 117, 173 (1983).
14. H. Cohen, A Course in Computational Algebraic Number Theory (Springer-Verlag, New York, 1993), Chaps. 1, 8-9.
15. S. Goldwasser and J. Kilian, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing (ACM, New York, 1986), p. 316.
16. A. O. L. Atkin and F. Morain, Math. Comp. 60, 399 (1993).
17. L. M. Adleman and M.-D. A. Huang, Primality Testing And Abelian Varieties Over Finite Fields (Springer-Verlag, New York, 1992).
18. G. L. Miller, J. Comp. & Sys. Sci. 13, 300 (1976).
19. E. Bach and L. Huelsbergen, Math. Comp. 61, 69 (1993).
20. H. Riesel, Prime Numbers and Computer Methods for Factorization, 2nd ed. (Birkhäuser, Boston, 1994), Chaps. 4-7.
21. A. K. Lenstra and H. W. Lenstra, Jr. (eds.), The Development of the Number Field Sieve (Springer-Verlag, New York, 1993).
22. C. H. Bennett, IBM J. Res. Dev. 17, 525 (1973).
23. T. Sleator and H. Weinfurter, Phys. Rev. Lett. 74, 4087 (1995).
24. H. F. Chau and F. Wilczek, Phys. Rev. Lett. 75, 748 (1995).
25. D. E. Knuth, The Art of Computer Programming, Vol. 2, 2nd ed. (Addison-Wesley, Reading, Massachusetts, 1981), Chap. 4.
26. A. Schönhagen and V. Strassen, Computing 7, 281 (1971).
27. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers (Oxford, London, 1938), pp. 265, 348.
28. J. Brillhart, D. H. Lehmer, and J. Selfridge, Math. Comp. 29, 620 (1975).
29. K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory (Springer-Verlag, New York, 1982), Theorem 2 of Chap. 4 on p. 43.