The quantum query complexity of the hidden subgroup problem is polynomial

Mark Ettinger, Peter Høyer, Emanuel Knill. The quantum query complexity of the hidden subgroup problem is polynomial. Inf. Process. Lett., 91(1):43-48, 2004. [doi]

Abstract

Abstract is missing.