Name
Abstract | ||
|---|---|---|
In this paper we 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 is an extension of our earlier method for extraspecial groups in Ivanyos et al. (Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS), vol. 4393, pp. 586–597, 2007), but it 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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-540-78773-0_65 | Latin American Theoretical INformatics |
Keywords | Field | DocType |
powerful classical reduction,nil-2 group,efficient quantum algorithm,extraspecial group,group action,nilpotent group,nilpotency class,constant nilpotency class,higher nilpotency class,quantum part,hidden subgroup problem,quantum algorithm,quantum physics,linear equations | Discrete mathematics,Combinatorics,Central series,Nilpotent group,Hidden subgroup problem,p-group,Fitting subgroup,Solvable group,Quantum algorithm,Mathematics,Normal subgroup | Journal |
Volume | Issue | ISSN |
62 | 1-2 | 1432-0541 |
ISBN | Citations | PageRank |
3-540-78772-0 | 6 | 0.47 |
References | Authors | |
21 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Ivanyos | 1 | 257 | 28.02 |
| Luc Sanselme | 2 | 13 | 0.98 |
| Miklos Santha | 3 | 728 | 92.42 |