The symmetric group defies strong Fourier sampling

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 479-488

  Moore, Cristopher ^a   Russell, Alexander ^b   Schulman, Leonard J ^c  

^a UNIVERSITY OF NEW MEXICO   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FOURIER SAMPLING; GRAPH ISOMORPHISM PROBLEM; HIDDEN SUBGROUPS; SYMMETRIC GROUP;

COMPUTATIONAL METHODS; COMPUTER SCIENCE; GRAPH THEORY; INFORMATION RETRIEVAL; INFORMATION SCIENCE;

PROBLEM SOLVING;

EID: 33748118934     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.73     Document Type: Conference Paper

References (34)

1. G.E. Andrews. The Theory of Partitions. Cambridge University Press, 1984.
2. David Bacon, Andrew Childs, and Wim van Dam. Optimal measurements for the dihedral hidden subgroup problem. Preprint, quant-ph/0501044 (2005).
3. Robert Beals. Quantum computation of Fourier transforms over symmetric groups. P roc. 29th Annual ACM Symposium on the Theory of Computing, pages 48-53, 1997.
4. Ethan Bernstein and Umesh Vazirani. Quantum complexity theory (preliminary abstract). Proc. 25th Annual ACM Symposium on the Theory of Computing, pages 11-20, 1993.
5. Wim van Dam, Sean Hallgren, and Lawrence Ip. Quantum algorithms for some hidden shift problems. Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, pages 489-98, 2003.
6. Mark Ettinger and Peter Høyer. On quantum algorithms for noncommutative hidden subgroups. Preprint, quant-ph/9807029 (1998).
7. Mark Ettinger and Peter Høyer and Emmanuel Knill. The quantum query complexity of the hidden sub-group problem is polynomial. Information Processing Letters, to appear.
8. Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, and Pranab Sen. Hidden translation and orbit coset in quantum computing. Proc. 35th ACM Symposium on Theory of Computing, 2003.
9. William Fulton and Joe Harris. Representation Theory: A First Course. Number 129 in Graduate Texts in Mathematics. Springer-Verlag, 1991.
10. Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, and Umesh Vazirani. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. Proc. 33rd ACM Symposium on Theory of Computing, pages 68-74, 2001.
11. Lisa Hales and Sean Hallgren. Quantum Fourier sampling simplified. P roc. 31st Annual ACM Symposium on Theory of Computing, 1999.
12. Lisa Hales and Sean Hallgren. An improved quantum Fourier transform algorithm and applications. Proc. 41st Annual Symposium on Foundations of Computer Science, 2000.
13. Sean Hallgren, Alexander Russell, and Amnon Ta-Shma. Normal subgroup reconstruction and quantum computation using group representations. Proc. 32nd ACM Symposium on Theory of Computing, pages 627-635, 2000.
14. Peter H́yer. Efficient quantum transforms. Preprint, quant-ph/9702028 (1997).
15. Yoshifumi Inui and François Le Gall. An efficient algorithm for the hidden subgroup problem over a class of semi-direct product groups. Proc. EQIS 2004.
16. Lawrence Ip. Shor's algorithm is optimal. Preprint, 2004.
17. Gábor Ivanyos, Frédéric Magniez, and Miklos Santha. Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. Int. J. Found. Comput. Sci. 14(5): 723-740, 2003.
18. Richard Jozsa. Quantum factoring, discrete logarithms and the hidden subgroup problem. Preprint, quantph/0012084 (2000).
19. S. V. Kerov. Asymptotic representation theory of the symmetric group and its applications in analysis. Translated by N. V. Tsilevich. Volume 219 in Translations of Mathematical Monographs. American Mathematical Society, 2003.
20. Greg Kuperberg. A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. Preprint, quant-ph/0302112 (2003).
21. Cristopher Moore, Daniel Rockmore, and Alexander Russell. Generic quantum Fourier transforms. Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 778-787, 2004.
22. Cristopher Moore, Daniel Rockmore, Alexander Russell, and Leonard J. Schulman. The value of basis selection in Fourier sampling: hidden subgroup problems for affine groups. P roc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1113-1122, 2004.
23. Cristopher Moore and Alexander Russell. The symmetric group defies strong Fourier sampling: part II. Preprint, quant-ph/0501066 (2005).
24. Cristopher Moore and Alexander Russell. For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets. Preprint, quant-ph/0501177 (2005).
25. Cristopher Moore and Alexander Russell. Explicit multiregister measurements for hidden subgroup problems; or, Fourier sampling strikes back. Preprint, quant-ph/0504067 (2005).
26. Oded Regev. Quantum computation and lattice problems. Proc. 43rd Symposium on Foundations of Computer Science, pages 520-530, 2002.
27. Martin Roetteler and Thomas Beth. Polynomial-time solution to the hidden subgroup problem for a class of non-abelian groups. Preprint, quant-ph/9812070 (1998).
28. Yuval Roichman. Upper bound on the characters of the symmetric groups. Inventiones Mathematicae, 125:451-485, 1996.
29. Steven Roman. Advanced Linear Algebra. Number 135 in Graduate Texts in Mathematics. Springer, 1992.
30. Jean-Pierre Serre. Linear Representations of Finite Groups. Number 42 in Graduate Texts in Mathematics. Springer-Verlag, 1977.
31. Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5): 1484-1509, 1997.
32. Daniel R. Simon. On the power of quantum computation. SIAM Journal on Computing, 26(5): 1474-1483, 1997.
33. A. M. Vershik and S. V. Kerov. Asymptotic behavior of the maximum and generic dimensions of irreducible representations of the symmetric group. Funk. Anal, i Prolizhen, 19(1):25-36, 1985;
34. English translation, Funct. Anal. Appl, 19:21-31, 1989.