Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem

International Journal of Foundations of Computer Science

Volumn 14, Issue 5, 2003, Pages 723-739

  Ivanyos, Gábor ^a   Magniez, Frédéric ^b   Santha, Miklos ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b CNRS   (France)

Author keywords

Black box groups; Hidden subgroup problem; Quantum computing

Indexed keywords

EID: 20744439021     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001996     Document Type: Article

References (31)

1. L. Babai and R. Beals, A polynomial-time theory of black-box groups I., Groups St. Andrews 1997 in Bath, I, London Math. Soc. Lecture Notes Ser., vol.260, Cambridge Univ. Press, 1999, 30-64
2. L. Babai, G. Cooperman, L. Finkelstein, E. M. Luks and A. Seress, Fast MonteCarlo algorithms for permutation groups, J. Computer and System Sciences, vol.50, 1995, 263-307
3. L. Babai and E. Szemeredi, On the complexity of matrix group problems I., Proc. 25th IEEE Foundations of Computer Science, 1984, 229-240
4. R. Beals, Towards polynomial time algorithms for matrix groups, Groups and ComputationProc. 1991 DIMACS Workshop, L. Finkelstein, W. M. Kantor (eds.), DIMACS Ser. in Discr. Math, and Theor. Comp. Sci., vol. 11, AMS, 1993, 31-54
5. R. Beals and L. Babai, Las Vegas algorithms for matrix groups, Proc. 34th IEEEFoundations of Computer Science, 1993, 427-436
6. R. Beals and A. Seress, Structure forest and composition factors for small basegroups in nearly linear time, Proc. 24th ACM Symposium on Theory of Computing, 1992, 116-125
7. D. Boneh and R. Lipton, Quantum cryptanalysis of hidden linear functions, Proc. Crypto'95, LNCS vol. 963, 1995, 427-437
8. G. Brassard and P. H0yer, An exact quantum polynomial-time algorithm for Simon'sproblem, Proc. 5th Israeli Symposium on Theory of Computing Systems, 1997, 12-23
9. K. Cheung and M. Mosca, Decomposing finite abelian groups, J. Quantum Inf.Comp., 1(3), 2001, 26-32
10. M. Ettinger and P. H0yer, On quantum algorithms for noncommutative hiddensubgroups, Proc. 16th Symposium on Theoretical Aspects of Computer Science, LNCS vol. 1563, 1999, 478-487
11. M. Ettinger, P. H0yer, and E. Knill, Hidden subgroup states are almost orthogonal, preprint available at http://xxx.leml.gov/abs/qu2uit-ph/9901034
12. W. Feit and J. Tits, Projective representations of minimum degree of group extensions, Canadian J. Math., vol. 30, 1978, 1092-1102
13. K. Friedl, G. Ivanyos, F. Magniez, M. Santha and P. Sen, Hidden translationand orbit coset in quantum computing, to appear in Proc. 35thACM Symposium on Theory of Computing, 2003. Preprint available athttp://xxx.lanl. gov/abs/quant-ph/0211091
14. M. Grigni, L. Schulman, M. Vazirani and U. Vazirani, Quantum mechanical algorithmsfor the nonabelian hidden subgroup problem, Proc. 33rd ACM Symposiumon Theory of Computing, 2001, 68-74
15. J. Gruska, Quantum Computing, McGraw Hill, 1999
16. S. Hallgren, A. Russell and A. Ta-Shma, Normal subgroup reconstruction and quantumcomputation using group representations, Proc. 32nd ACM Symposium onTheory of Computing, 2000, 627-635
17. R. Jozsa, Quantum algorithms and the Fourier transform, preprint available athttp://xxx.lanl.gov/abs/quant-ph/9707033
18. R. Jozsa, Quantum factoring, discrete logarithms and the hidden subgroup problem, preprint available at http://xxx.lanl.gov/abs/quant-ph/0012084
19. W. M. Kantor and A. Seress, Black box classical groups, Manuscript
20. A. Kitaev, Quantum measurements and the Abelian Stabilizer Problem, preprintavailable at http://xxx.lanl.gov/abs/quant-ph/9511026
21. V. Landazuri and G. M. Seitz, On the minimal degrees of projective representationsof the finite Chevalley groups, J. Algebra vol. 32, 1974, 418-443
22. E. M. Luks, Computing in solvable matrix groups, Proc. 33th IEEE Foundations ofComputer Science, 1992, 111-120
23. C. Moore, D. Rockemore, A. Russell and L. Schulman, The hidden subgroup problemin afRne groups: basis selection in Fourier sampling, preprint available athttp://xxx.lanl.gov/abs/quant-ph/0211124
24. M. Mosca, Quantum Computer Algorithms, PhD thesis, University of Oxford, 1999
25. M. Mosca and A. Ekert, The hidden subgroup problem and eigenvalue estimationon a quantum computer, Proc. 1st NASA International Conference on QuantumComputing and Quantum Communication, LNCS vol. 1509, 1999
26. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, CambridgeUniversity Press, 2000
27. J. Rotman, An Introduction to the Theory of Groups, Springer-Verlag, Series: GraduateTexts in Mathematics, vol. 148, 4th ed. 1995 (corr. 2nd printing 1999)
28. M. Rotteler and T. Beth, Polynomial-time solution to the hidden subgroupproblem for a class of non-abelian groups, preprint available athttp://xxx.lanl.gov/abs/quant-ph/9812070
29. P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithmson a quantum computer, SIAM J. on Computing, vol. 26(5), 1997, 1484-1509
30. D. Simon, On the power of quantum computation, SIAM J. on Computing, vol.26(5), 1997, 1474-1483
31. J. Watrous, Quantum algorithms for solvable groups, Proc. 33rd ACM Symposiumon Theory of Computing, 2001, 60-67.