An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups

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

Volumn 4957 LNCS, Issue , 2008, Pages 759-771

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

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c CNRS   (France)

^d NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM THEORY; ALGORITHMS; THEOREM PROVING;

AUTOMORPHISMS; EXISTENCE OF A SOLUTIONS; GROUP ACTIONS; HIDDEN SUBGROUP PROBLEM; NILPOTENCY; NILPOTENT GROUPS; P-GROUP; QUANTUM ALGORITHMS; SUBGROUP PROBLEM;

QUANTUM EFFICIENCY; PROBLEM SOLVING;

EID: 43049097863     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78773-0_65     Document Type: Conference Paper

References (25)

1. Bacon, D., Childs, A., van Dam, W.: From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In: Proc. 46th IEEE FOCS, pp. 469-478 (2005)
2. Beals, R., Babai, L.: Las Vegas algorithms for matrix groups. In: Proc. 34th IEEE FOCS, pp. 427-436 (1993)
3. Chevalley, C.: Démonstration d'une hypothèse de M. Artin. Abhand. Math. Sem. Univ. Hamburg 11, 73-75 (1936)
4. Eick, B.: Orbit-stabilizer problems and computing normalizers for polycyclic groups. J. Symbolic Comput. 34, 1-19 (2002)
5. Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and orbit coset in quantum computing. In: Proc. 35th ACM STOC, pp. 1-9 (2003)
6. Grigni, M., Schulman, L., Vazirani, M., Vazirani, U.: Quantum mechanical algorithms for the nonabelian Hidden Subgroup Problem. In: Proc. 33rd ACM STOC, pp. 68-74 (2001)
7. Hall, M.: Theory of groups. AMS Chelsea Publishing (1999)
8. Hallgren, S., Russell, A., Ta-Shma, A.: Normal subgroup reconstruction and quantum computation using group representations. SIAM J. Comp. 32(4), 916-934 (2003)
9. Holt, D.F., Eick, B., O'Brien, E.: Handbook of computational group theory. Chapman & Hall/CRC Press (2005)
10. Hoefling. Efficient multiplication algorithms for finite polycyclic groups (preprint, 2004)
11. Ivanyos, G., Magniez, F., Santha, M.: 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)
12. Ivanyos, G., Sanselme, L., Santha, M.: An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 586-597. Springer, Heidelberg (2007)
13. Kitaev, A.: Quantum measurements and the Abelian Stabilizer Problem. Technical report, Quantum Physics e-Print archive (1995), http://xxx.lanl.gov/ abs/quant-ph/9511026
14. Luks, E.M.: Computing in solvable matrix groups. In: Proc. 33rd IEEE FOCS, pp. 111-120 (1992)
15. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
16. Meggido, N., Papadimitriou, C.: On total functions, existence theorems, and computational complexity. Theor. Comp. Sci. 81, 317-324 (1991)
17. Moore, C., Rockmore, D., Russell, A., Schulman, L.: The power of basis selection in Fourier sampling: Hidden subgroup problems in affine groups. In: Proc. 15th ACM-SIAM SODA, pp. 1106-1115 (2004)
18. Moore, C., Russell, A., Sniady, P.: On the impossibility of a quantum sieve algorithm for graph isomorphism. In: Proc. 39th ACM STOC, pp. 536-545 (2007)
19. Mosca, M.: Quantum Computer Algorithms. PhD Thesis, University of Oxford (1999)
20. Regev, O.: Quantum Computation and Lattice Problems. SIAM J. Comp. 33(3), 738-760 (2004)
21. Rötteler, M., Beth, T.: 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
22. Shanks, D.: Five number-theoretic algorithms. In: Proc. 2nd Manitoba Conference on Numerical Mathematics, pp. 51-70 (1972)
23. Shor, P.: Algorithms for quantum computation: Discrete logarithm and factoring. SIAM J. Comp. 26(5), 1484-1509 (1997)
24. Warning, E.: Bemerkung zur vorstehenden Arbeit von Herr Chevalley. Abhand. Math. Sem. Univ. Hamburg 11, 76-83 (1936)
25. van de Woestijne, C.: Deterministic equation solving over finite fields. PhD thesis, Universiteit Leiden (2006)