An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem

François Le Gall
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism testing for nonabelian groups. Le Gall has constructed an efficient classical algorithm for a class of groups corresponding to one of the most natural ways of constructing nonabelian groups from abelian groups: the groups that...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.