Quantum algorithms for Simon's problem over nonabelian groups

ACM Transactions on Algorithms

Volumn 6, Issue 1, 2009, Pages

  Alagic, Gorjan ^a   Moore, Cristopher ^b   Russell, Alexander ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF NEW MEXICO   (United States)

^c University of Connecticut   (United States)

Author keywords

Hidden subgroup problem; Quantum algorithms

Indexed keywords

CLASSICAL COUNTERPART; COSET STATE; DIHEDRAL GROUPS; FINITE GROUPS; FOURIER SAMPLING; GRAPH ISOMORPHISM; HARMONIC APPROACH; HIDDEN SUBGROUP PROBLEM; NON-ABELIAN GROUPS; PRODUCT STRUCTURE; QUANTUM ALGORITHMS; SIMON'S PROBLEM; STANDARD METHOD; SYMMETRIC GROUPS; TENSOR PRODUCTS; TIME COMPLEXITY;

ALGORITHMS; COMBINATORIAL CIRCUITS; QUANTUM COMPUTERS; QUANTUM OPTICS; QUANTUM THEORY; SET THEORY; TENSORS;

GROUP TECHNOLOGY;

EID: 74049084945     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1644015.1644034     Document Type: Article

References (22)

1. ALAGIC, G., MOORE, C., AND RUSSELL, A. 2005. Strong Fourier sampling fails over Gn . Tech. Rep. quant-ph/0511054, arXiv.org.
2. BACON, D., CHILDS, A., AND VAN DAM, W. 2005. From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In Proceedings of the 46th Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
3. 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 ACM Symposium on Theory of Computing. ACM, New York.
4. FULTON, W., AND HARRIS, J. 1991. Representation Theory: A First Course. Number 129 in Graduate Texts in Mathematics. Springer-Verlag, Berlin, Germany.
5. HALLGREN, S., MOORE, C., RÖTTELER, M., RUSSELL, A., AND SEN, P. 2006. Limitations of quantum coset states for graph isomorphism. In Proceedings of the 38th ACMSymposium on Theory of Computing. ACM, New York.
6. HALLGREN, S., RUSSELL, A., AND TA-SHMA, A. 2000. Normal subgroup reconstruction and quantum computation using group representations. In Proceedings of the 32nd ACM Symposium on Theory of Computing. ACM, New York, 627-635.
7. HOEFFDING, W. 1963. Probability inequalities for sums of bounded random variables. J. Amer. Stat. Soc. 58, 301, 13-30.
8. INUI, Y., AND GALL, F. L. 2004. An efficient algorithm for the hidden subgroup problem over a class of semi-direct product groups. In Proceedings of EQIS.
9. IVANYOS, G., MAGNIEZ, F., AND SANTHA, . M. 2003. Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. Int. J. Found. Comput. Sci. 14, 5, 723-740.
10. KITAEV, A., SHEN, A., AND VYALYI, M. 2002. Classical and Quantum Computation. Graduate Studies in Mathematics, vol.47. AMS.
11. KUPERBERG, G. 2005. A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35, 1, 170-188.
12. MOORE, C., ROCKMORE, D., AND RUSSELL, A. 2004a. Generic quantum fourier transforms. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 778-787.
13. MOORE, C., ROCKMORE, D., RUSSELL, A. , AND SCHULMAN, L. 2004b. The value of basis selection in Fourier sampling: Hidden subgroup problems for affine groups. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 1113-1122.
14. MOORE, C., AND RUSSELL,A. 2005. Explicit multiregister measurements for hidden subgroup problems; or, fourier sampling strikes back. Tech. Rep. quant-ph/0504067, arXiv.org.
15. MOORE, C., RUSSELL, A., ANDSCHULMAN, L. 2005. The symmetric group defies strong Fourier sampling. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 479-488.
16. REGEV, O. 2002. Quantum computation and lattice problems. In Proceedings of the 43rd Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 520-530.
17. RÖTTELER, M., AND BETH, T. 1998. Polynomial-time solution to the hidden subgroup problem for a class of non-abelian groups. Tech. Rep. quant-ph/9812070, arXiv.org.
18. SAGAN, B. 1991. The Symmetric Group. Number 203 in Graduate Texts in Mathematics. Springer-Verlag, Berlin, Germany.
19. SERRE, J.-P. 1977. Linear Representations of Finite Groups. Number 42 in Graduate Texts in Mathematics. Springer-Verlag, Berlin, Germany.
20. SHOR, P. 1994. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 5, 1484-1509.
21. SIMON, D. 1997. On the power of quantum computation. SIAM J. Comput. 26, 5.
22. VAN LINT, J. H. 1992. Introduction to Coding Theory. Number 86 in Graduate Texts in Mathematics. Springer-Verlag, New York.