The quantum query complexity of the hidden subgroup problem is polynomial

Mark Ettinger, Peter Hoyer, Emanuel Knill

Published 2004-01-14Version 1

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. This is exponentially better than the best classical algorithm. However our quantum algorithm requires exponential time, as in the classical case. Our algorithm utilizes a new technique for constructing error-free algorithms for non-decision problems on quantum computers.