Abstract
In this paper we extend the algorithm for extraspecial groups in [12], and show that the hidden subgroup problem in nil-2 groups, that is in groups of nilpotency class at most 2, can be solved efficiently by a quantum procedure. The algorithm presented here has several additional features. It contains a powerful classical reduction for the hidden subgroup problem in nilpotent groups of constant nilpotency class to the specific case where the group is a p-group of exponent p and the subgroup is either trivial or cyclic. This reduction might also be useful for dealing with groups of higher nilpotency class. The quantum part of the algorithm uses well chosen group actions based on some automorphisms of nil-2 groups. The right choice of the actions requires the solution of a system of quadratic and linear equations. The existence of a solution is guaranteed by the Chevalley-Warning theorem, and we prove that it can also be found efficiently.
Keywords
- Polynomial Time
- Normal Subgroup
- Nontrivial Solution
- Nilpotent Group
- Quantum Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Research supported by the European Commission IST Integrated Project Qubit Applications (QAP) 015848, the OTKA grants T42559 and T46234, the NWO visitor’s grant Algebraic Aspects of Quantum Computing, and the ANR Blanc AlgoQP grant of the French Research Ministry.
This is a preview of subscription content, access via your institution.
Buying options
Preview
Unable to display preview. Download preview PDF.
References
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)
Beals, R., Babai, L.: Las Vegas algorithms for matrix groups. In: Proc. 34th IEEE FOCS, pp. 427–436 (1993)
Chevalley, C.: Démonstration d’une hypothèse de M. Artin. Abhand. Math. Sem. Univ. Hamburg 11, 73–75 (1936)
Eick, B.: Orbit-stabilizer problems and computing normalizers for polycyclic groups. J. Symbolic Comput. 34, 1–19 (2002)
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)
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)
Hall, M.: Theory of groups. AMS Chelsea Publishing (1999)
Hallgren, S., Russell, A., Ta-Shma, A.: Normal subgroup reconstruction and quantum computation using group representations. SIAM J. Comp. 32(4), 916–934 (2003)
Holt, D.F., Eick, B., O’Brien, E.: Handbook of computational group theory. Chapman & Hall/CRC Press (2005)
Hoefling. Efficient multiplication algorithms for finite polycyclic groups (preprint, 2004)
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)
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)
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
Luks, E.M.: Computing in solvable matrix groups. In: Proc. 33rd IEEE FOCS, pp. 111–120 (1992)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Meggido, N., Papadimitriou, C.: On total functions, existence theorems, and computational complexity. Theor. Comp. Sci. 81, 317–324 (1991)
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)
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)
Mosca, M.: Quantum Computer Algorithms. PhD Thesis, University of Oxford (1999)
Regev, O.: Quantum Computation and Lattice Problems. SIAM J. Comp. 33(3), 738–760 (2004)
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
Shanks, D.: Five number-theoretic algorithms. In: Proc. 2nd Manitoba Conference on Numerical Mathematics, pp. 51–70 (1972)
Shor, P.: Algorithms for quantum computation: Discrete logarithm and factoring. SIAM J. Comp. 26(5), 1484–1509 (1997)
Warning, E.: Bemerkung zur vorstehenden Arbeit von Herr Chevalley. Abhand. Math. Sem. Univ. Hamburg 11, 76–83 (1936)
van de Woestijne, C.: Deterministic equation solving over finite fields. PhD thesis, Universiteit Leiden (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ivanyos, G., Sanselme, L., Santha, M. (2008). An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds) LATIN 2008: Theoretical Informatics. LATIN 2008. Lecture Notes in Computer Science, vol 4957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78773-0_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-78773-0_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78772-3
Online ISBN: 978-3-540-78773-0
eBook Packages: Computer ScienceComputer Science (R0)