Abstract
AbstractWe propose a method for solving the hidden subgroup problem in nilpotent groups. The main idea is iteratively transforming the hidden subgroup to its images in the quotient groups by the members of a central series, eventually to its image in the commutative quotient of the original group, and then using an abelian hidden subgroup algorithm to determine this image. Knowing this image allows one to descend to a proper subgroup unless the hidden subgroup is the full group. The transformation relies on finding zero sum subsequences of sufficiently large sequences of vectors over finite prime fields. We present a new deterministic polynomial time algorithm for the latter problem in the case when the size of the field is constant. The consequence is a polynomial time exact quantum algorithm for the hidden subgroup problem in nilpotent groups having constant nilpotency class and whose order only have prime factors also bounded by a constant.
Funder
Budapest University of Technology and Economics
Publisher
Springer Science and Business Media LLC
Reference31 articles.
1. Ettinger, M., Høyer, P., Knill, E.: The quantum query complexity of the hidden subgroup problem is polynomial. Inf. Process. Lett. 91, 43–48 (2004). arXiv:quant-ph/0401083
2. Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35(1), 170–188 (2005). arXiv:quant-ph/0302112
3. Alagic, G., Moore, C., Russell, A.: Quantum algorithms for Simon’s problem over general groups. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1217–1224 (2007). arXiv:quant-ph/0603251
4. Lomont, C.: The hidden subgroup problem-review and open problems. Technical report (2004). arXiv:quant-ph/0603251
5. Wang, F.: The hidden subgroup problem. Technical report (2010). arXiv:1101.1053