The hidden subgroup problem and permutation group theory

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 1118-1125

  Kempe, Julia ^a,b   Shalev, Aner ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CNRS   (France)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GROUP THEORY; PERMUTATION; QUANTUM COMPUTING; QUANTUM FOURIER SAMPLING (QFS);

COMPUTATIONAL COMPLEXITY; FOURIER TRANSFORMS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; QUANTUM THEORY; THEOREM PROVING;

PROBLEM SOLVING;

EID: 20744459565     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (28)

1. [Bab81] L. Babai. On the order of uniprimitive permutation groups. Annals of Math., 113:553-568, 1981.
2. [Bab82] L. Babai. On the order of doubly transitive permutation groups. Invent. Math., 65:473-484, 1982.
3. [Bea97] R. Beals. Quantum computation of Fourier transforms over symmetric groups. In Proc. 29th STOC, pages 48-53, 1997.
4. [Cam81] P.J. Camer on. Finite permutation groups and finite simple groups. Bull. London Math. Soc., 13(1):1-22, 1981.
5. [DM96] J.D. Dixon and B. Mortimer. Permutation groups, volume 163 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1996.
6. [EH99] M. Ettinger and P. Hoyer. On quantum algorithms for noncommutative hidden subgroups. In Proc. 16th STAGS, pages 478-487, 1999.
7. Final version in Adv. in Appl. Math.
8. [EHK99] M. Ettinger, P. Hoyer, and E. Knill. Hidden subgroup states are almost orthogonal. Technical report, lanl-arXive quant-ph/9901034, 1999.
9. [FIM+03] K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen. Hidden translation and orbit coset in quantum computing. In Proceedings of 35th ACM Symposium on Theory of Computing, pages 1-9, 2003.
10. [GSVV01] M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. In Proc. 33th STOC, pages 68-74, 2001.
11. [HRT00] S. Hallgren, A. Russell, and A. Ta-Shma. Normal subgroup reconstruction and quantum computation using group representations. In Proc. 32nd STOC, pages 627-635, 2000.
12. [IMS01] G. Ivanyos, F. Magniez, and M. Santha. Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. In Proceedings of 13th ACM Symposium on Parallelism in Algorithms and Architectures, pages 263-270, 2001. Journal version in [IMS03].
13. [IMS03] G. Ivanyos, F. Magniez, and M. Santha. Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. International Journal of Foundations of Computer Science, 2003. Journal version of [IMS01]. To appear.
14. [Jor73] C. Jordan. Sur la limite de transitivite des groupes non alternés. Bull. Soc. Math. France, 1:40-71, 1873.
15. [Jor75] C. Jordan. Sur la limite de degré des groupes primitifs qui contiennent une substitution donnée. J. reine angew Math., 79:248-258, 1875.
16. [Joz00] R. Jozsa. Quantum factoring, discrete logarithms and the hidden subgroup problem. arXiv preprint lanl quant-ph/0012084, prepared for IEEE Computing in Science and Engineering, 2000.
17. [Kit95] A. Kitaev. Quantum measurements and the abelian stabilizer problem. arXive preprint lanl quant-ph/9511026, 1995.
18. [Kup03] G. Kuperberg. A subexponential-time algorithm for the dihedral hidden subgroup problem. Technical report, lanl-arXive quant-ph/0302112, 2003.
19. [LS01] M. Liebeck and A. Shalev. Diameters of finite simple groups: sharp bounds and applications. Ann. of Math. (2), 154(2):383-406, 2001.
20. [MRR04] C. Moore, D. Rockmore, and A. Russell. Generic quantum fourier transforms. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004. lanl-arXive quant-ph/0304064.
21. [MRRS04] C. Moore, D. Rockmore, A. Russell, and L. Schulman. The value of basis selection in fourier sampling: hidden subgroup problems for affine groups. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004. lanl-arXive quant-ph/0211124.
22. [NC00] M.A. Nielsen and I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK, 2000.
23. [PRB99] M. Pueschel, M. Roetteler, and T. Beth. Fast quantum fourier transforms for a class of non-Abelian groups. In Proceedings Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-13), volume 1719 of Lecture Notes in Computer Science, pages 148-159. Springer, 1999.
24. [RB98] M. Rötteler and T. Beth. Polynomial-time solution to the hidden subgroup problem for a class of non-Abelian groups. Technical report, Quantum Physics e-Print archive, 1998. http://xxx.lanl.gov/abs/quant-ph/9812070.
25. [Reg02] O. Regev. Quantum computation and lattice problems. In Proc. 43rd Annual IEEE Symp. on Foundations of Computer Science (FOCS), pages 520-529, 2002.
26. [Reg04] O. Regev. A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space, 2004. quant-ph/0406151.
27. [Sag01] Bruce E. Sagan. The symmetric group, volume 203 of Graduate Texts in Mathematics. Springer-Verlag, New York, second edition, 2001. Representations, combinatorial algorithms, and symmetric functions.
28. [Sho94] P.W. Shor. Algorithms for quantum computation: Discrete log and factoring. In Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, pages 124-134, Los Alamitos, CA, 1994. IEEE Computer Society.