Quantum algorithms for fixed points and invariant subgroups
Marianna C. Bonanome, Stephen Majewicz · journal of Groups complexity cryptology · 2011
In this paper, we apply quantum algorithms to solve problems concerning fixed points and invariant subgroups of automorphisms. These efficient algorithms invoke a quantum algorithm which computes the intersection of multiple unsorted multisets whose elements originate from the same set. This intersection algorithm is an application of the Grover search procedure.