Deterministic Algorithms for the Hidden Subgroup Problem

In this note, we present deterministic algorithms for the Hidden Subgroup Problem. The algorithm for abelian groups achieves the same asymptotic query complexity as the optimal randomized algorithm. The algorithm for non-abelian groups comes within a polylogarithmic factor of the optimal randomized query complexity.