The power of strong Fourier sampling: Quantum algorithms for affine groups and hidden shifts

SIAM Journal on Computing

Volumn 37, Issue 3, 2007, Pages 938-958

  Moore, Cristopher ^a,b   Rockmore, Daniel ^c   Russell, Alexander ^d   Schulman, Leonard J ^e  

^a UNIVERSITY OF NEW MEXICO   (United States)

^b SANTA FE INSTITUTE   (United States)

^c DARTMOUTH COLLEGE   (United States)

^d UNIVERSITY OF CONNECTICUT   (United States)

^e CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Fourier analysis; Group representations; Hidden subgroup problem; Quantum computation

Indexed keywords

AFFINE GROUPS; FOURIER SAMPLING; HIDDEN SUBGROUP PROBLEM (HSP); LOG ALGORITHMS; QUANTUM ALGORITHMS; QUANTUM FOURIER TRANSFORM (QFT); QUANTUM STATES; STANDARD METHODS;

MATHEMATICAL TRANSFORMATIONS; QUANTUM THEORY; SAMPLING; STANDARDS;

FOURIER TRANSFORMS;

EID: 46449095796     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705447177     Document Type: Article

References (26)

1. D. BACON, A. CHILDS, AND W. VAN DAM, Prom optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 469-478.
2. R. BEALS, Quantum computation of Fourier transforms over symmetric groups, in Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, 1997, pp. 48-53.
3. E. BERNSTEIN AND U. VAZIRANI, Quantum complexity theory (preliminary abstract), in Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993, pp. 11 -20.
4. W. VAN DAM, S. HALLGREN, AND L. IP, Quantum algorithms for some hidden shift problems, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 489-498.
5. I. B. DAMGÅRD, On the randomness of Legendre and Jacobi sequences, in Advances in Cryptology - CRYPTO '88, Lecture Notes in Comput. Sci. 403, Springer-Verlag, Berlin, 1990, pp. 163-172.
6. M. ETTINGER AND P. HØYER, On quantum algorithms for noncommutative hidden subgroups, Adv. in Appl. Math., 25 (2000), pp. 239-251.
7. M. ETTINGER, P. HØYER, AND E. KNILL, The quantum query complexity of the hidden subgroup problem is polynomial, Inform. Process. Lett. 91 (2004), pp. 43-48.
8. K. FRIEDL, G. IVANYOS, F. MAGNIEZ, M. SANTHA, AND P. SEN, Hidden translation and orbit coset in quantum computing, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 1-9.
9. W. FULTON AND J. HARRIS, Representation Theory: A First Course, Grad. Texts in Math. 129, Springer-Verlag, London, 1991.
10. M. GRIGNI, L. J. SCHULMAN, M. VAZIRANI, AND U. VAZIRANI, Quantum mechanical algorithms for the nonabelian hidden subgroup problem, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 68-74.
11. L. HALES AND S. HALLGREN, Quantum Fourier sampling simplified, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 330-338.
12. L. HALES AND S. HALLGREN, An improved quantum Fourier transform algorithm and applications, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 515-525.
13. S. HALLGREN, A. RUSSELL, AND A. TA-S HMA, Normal subgroup reconstruction and quantum computation using group representations, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 627-635.
14. P. HØYER, Efficient Quantum Transforms, http://arxiv.org/abs/quant-ph/9702028 (1997).
15. G. IVANYOS, F. MAGNIEZ, AND M. SANTHA, Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem, Internal. J. Found. Comput. Sci., 14 (2003), pp. 723-740.
16. R. JOZSA, Quantum Factoring, Discrete Logarithms and the Hidden Subgroup Problem, http://arxiv.org/quant-ph/0012084 (2000).
17. S. V. KONYAGIN AND I. E. SHPARLINSKI, Character Sums with Exponential Functions and Their Applications, Cambridge Tracts in Math. 136, Cambridge University Press, Cambridge, UK, 1999.
18. G. KUPERBERG, A subexponential-time quantum algorithm for the dihedral hidden subgroup problem, SIAM J. Comput., 35 (2005), pp. 170-188.
19. R. LIDL AND H. NIEDERREITER, Finite Fields, Encyclopedia Math. Appl. 20, Cambridge University Press, Cambridge, UK, 1997.
20. C. MOORE, D. ROCKMORE, AND A. RUSSELL, Generic quantum Fourier transforms, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 771 780.
21. C. MOORE AND A. RUSSELL, For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets, Quantum Inf. Comput., to appear.
22. M. ROETTELER AND T. BETH, Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of Non-Abelian Groups, http://arxiv.org/abs/quant-ph/9812070 (1998).
23. J. ROTMAN, An Introduction to the Theory of Groups, Grad. Texts in Math. 148, Springer-Verlag, London, 1994.
24. J.-P. SERRE, Linear Representations of Finite Groups, Grad. Texts in Math. 42, Springer-Verlag, London, 1977.
25. P. W. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), pp. 1484-1509.
26. D. R. SIMON, On the power of quantum computation, SIAM J. Comput., 26 (1997), pp. 1474-1483.