An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4393 LNCS, Issue , 2007, Pages 586-597

  Ivanyos, Gábor ^a   Sanselme, Luc ^b   Santha, Miklos ^b,c  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION THEORY; PROBLEM SOLVING; QUANTUM THEORY;

AUTOMORPHISMS; HIDDEN SUBGROUP PROBLEM; QUANTUM ALGORITHM;

HIDDEN MARKOV MODELS;

EID: 38049170875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_50     Document Type: Conference Paper

References (21)

1. M. Aschbacher. Finite Group Theory. Cambridge University Press, 2000.
2. D. Bacon, A. Childs, and W. van Dam. From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In Proc. 46th IEEE FOCS, pages 469-478, 2005.
3. A. Calderbank, E. Rains, P. Shor and N. Sloane. Quantum error correction and orthogonal geometry. Phys. Rev. Lett., 78:405-408, 1997.
4. A. Calderbank, E. Rains, P. Shor and N. Sloane. Quantum error correction via codes over GF(4). IEEE Transactions on Information Theory, 44(4):1369-1387, 1998.
5. K. Friedl, G. Ivanyos, F. Magniez , M. Santha and P. Sen. Hidden translation and orbit coset in quantum computing. In Proc. 35th ACM STOC, pages 1-9, 2003.
6. D. Gottesman. Stabilizer Codes and Quantum Error Correction. PhD Thesis, Caltech, 1997.
7. M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani. Quantum mechanical algorithms for the nonabelian Hidden Subgroup Problem. In Proc. 33rd ACM STOC, pages 68-74, 2001.
8. S. Hallgren, A. Russell, and A. Ta-Shma. Normal subgroup reconstruction and quantum computation using group representations. SIAM J. Comp., 32(4):916-934, 2003.
9. B. Huppert. Endliche Gruppen. Vol. 1, Springer Verlag, 1983.
10. G. Ivanyos, F. Magniez, and M. Santha. Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. Int. J. of Foundations of Computer Science, 14(5):723-739, 2003.
11. A. Kitaev. Quantum measurements and the Abelian Stabilizer Problem. Technical report, Quantum Physics e-Print archive, 1995. http://xxx.lanl.gov/ abs/quant-ph/9511026.
12. A. Klappenecker, P. K. Sarvepalli. Clifford Code Constructions of Operator Quantum Error Correcting Codes Technical report, Quantum Physics e-Print archive, 2006. http://-xxx.lanl.gov/abs/quant-ph/0604161.
13. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
14. C Moore, D. Rockmore, A. Russell, and L. Schulman. The power of basis selection in Fourier sampling: Hidden subgroup problems in affine groups. In Proc 15th ACM-SIAM SODA, pages 1106-1115, 2004.
15. M. Mosca. Quantum Computer Algorithms. PhD Thesis, University of Oxford, 1999.
16. M. Püschel, M. Rötteler, and T. Beth. Fast quantum Fourier transforms for a class of non-Abelian groups. In Proc. 13th AAECC, volume 1719, pages 148-159. LNCS, 1999.
17. J. Radhakrishnan, M. Rötteler and P. Sen. On the power of random bases in Fourier sampling: hidden subgroup problem in the Heisenberg group. In Proc. 32nd ICALP, LNCS vol. 3580, pages 1399-1411, 2005.
18. 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.
19. P. Shor. Algorithms for quantum computation: Discrete logarithm and factoring. SIAM J. Comp., 26(5):1484-1509, 1997.
20. V. Shoup. A Computational Introduction to Number Theory and Algebra. Cambridge University Press, 2005.
21. D. Simon. On the power of quantum computation. SIAM J. Comp., 26(5):1474-1483, 1997.