The quantum query complexity of the hidden subgroup problem is polynomial

Mark Ettinger, Peter Hoyer, Emanuel Knill

We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. Thi…