Deterministic Algorithms for the Hidden Subgroup Problem

04/29/2021
by   Ashwin Nayak, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset