We are concerned with the Hidden Subgroup Problem for finite groups. We present a simplified analysis of a quantum algorithm proposed by Hallgren, Russell and Ta-Shma as well as a detailed proof of a lower bound on the probability of success of the algorithm.
The quantum query complexity of the hidden subgroup problem is polynomial
Quantum Algorithm for Commutativity Testing of a Matrix Set
Quantum Algorithms for Simon's Problem Over General Groups
