Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

Journal of the ACM

Volumn 54, Issue 1, 2007, Pages

  Hallgren, Sean ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

Quantum algorithms; Quantum computation

Indexed keywords

BUCHMANN - WILLIAMS KEY EXCHANGE; QUADRATIC NUMBER FIELD; QUANTUM ALGORITHMS; RIEMANN HYPOTHESIS;

ALGEBRA; DIFFERENTIAL EQUATIONS; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

QUANTUM COMPUTERS;

EID: 33947288591     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1206035.1206039     Document Type: Article

References (27)

1. BERNSTEIN, E., AND VAZIRANI, U. 1997. Quantum complexity theory. SIAM J. Comput. 26, 5 (Oct.), 1411-1473.
2. BUCHMANN, J. 1989. A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. In Séminaire de théorie des nombres (Paris, France), 28-41.
3. BUCHMANN, J., THIEL, C., AND WILLIAMS, H. C. 1995. Short representation of quadratic integers. In Computational Algebra and Number Theory, Sydney 1992, W. Bosma and A. J. van der Poorten, Eds. Mathematics and its Applications, vol. 325. Kluwer Academic Publishers, 159-185.
4. BUCHMANN, J., AND WILLIAMS, H. C. 1989a. On the existence of a short proof for the value of the class number and regulator of a real quadratic field. In Number Theory and Applications (Banff, AB, 1988). Kluwer Acad. Publ., Dordrecht, 327-345.
5. BUCHMANN, J., AND WILLIAMS, H. C. 1991. Some remarks concerning the complexity of computing class groups of quadratic fields. J. Complex. 7, 3, 311-315.
6. BUCHMANN, J. A., AND WILLIAMS, H. C. 1989b. A key exchange system based on real quadratic fields (extended abstract). In Advances in Cryptology - CRYPTO '89, G. Brassard, Ed. Lecture Notes in Computer Science, vol. 435. Springer-Verlag, New York, 335-343.
7. COHEN, H. 1993. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol. 138. Springer-Verlag, New York.
8. ETTINGER, M., HøYER, P., AND KNILL, E. 1999. Hidden subgroup states are almost orthogonal. Tech. rep., quant-ph/9901034.
9. FRIEDL, K., IVANYOS, G., MAGNIEZ, F., SANTHA, M., AND SEN, P. 2003. Hidden translation and orbit coset in quantum computing. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (San Diego, CA). ACM, New York.
10. GRIGNI, M., SCHULMAN, L., VAZIRANI, M., AND VAZIRANI, U. 2001. Quantum mechanical algorithms for the non-Abelian hidden subgroup problem. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (Crete, Greece). ACM, New York.
11. HALLGREN, S., RUSSELL, A., AND TA-SHMA, A. 2000. Normal subgroup reconstruction and quantum computation using group representations. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (Portland, OR) ACM, New York, 627-635.
12. IVANYOS, G., MAGNIEZ, F., AND SANTHA, M. 2001. Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (Heraklion, Crete Island, Greece). ACM, New York, 263-270.
13. JOZSA, R. 2003. Notes on Hallgren's efficient quantum algorithm for solving Pell's equation. Tech. rep., quant-ph/0302134.
14. KUPERBERG, G. 2003. A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. Tech. rep., quant-ph/0302134.
15. LENSTRA, A., AND LENSTRA, H., EDS. 1993. The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol. 1544. Springer-Verlag, New York.
16. LENSTRA, JR., H. W. 1982. On the calculation of regulators and class numbers of quadratic fields. In Journees Arithmetiques, Exeter 1980, J. V. Armitage, Ed. London Mathematical Society Lecture Notes Series, vol. 56. Cambridge University Press, Cambridge, MA, 123-150.
17. LENSTRA, JR., H. W. 2002. Solving the Pell equation. Notices Amer. Math. Soc. 49, 2 (Feb.), 182-192.
18. MOORE, C., ROCKMORE, D., RUSSELL, A., AND SCHULMAN, L. 2004. The hidden subgroup problem in affine groups: Basis selection in fourier sampling. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA). ACM, New York.
19. NIVEN, L., ZUCKERMAN, H. S., AND MONTGOMERY, H. L. 1991. An Introduction to the Theory of Numbers, Fifth ed. Wiley, New York.
20. SCHRIJVER, A. 1986. Karmarkar's polynomial-time algorithm for linear programming. In Theory of Linear and Integer Programming. Wiley, New York, 190-194 (Chap. 15.1).
21. SHOR, P. W. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Compta. 26, 5 (Oct.), 1484-1509.
22. SHOR, P. W. 2003. Why haven't more quantum algorithms been found? J. ACM 50, 1 (Jan.), 87-90.
23. SIMON, D. R. 1997. On the power of quantum computation. SIAM J. Comput. 26, 5 (Oct.), 1474-1483.
24. VAN DAM, W., HALLGREN, S., AND IP, L. 2003. Quantum algorithms for some hidden shift problems. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (Baltimore, MD). ACM, New York.
25. VOLLMER, U. 2000. Asymptotically fast discrete logarithms in quadratic number fields. In Algorithmic Number Theory Symposium IV. Vol. 1838. 581-594.
26. WATROUS, J. 2001. Quantum algorithms for solvable groups. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (Crete, Greece). ACM, New York, 60-67.
27. WILLIAMS, H. C. 2000. Solving the Pell equation. In Proceedings of the Millennial Conference on Number Theory. Vol. 3. 397-435.