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]

Authors

Mark Ettinger

This author has not been identified. Look up 'Mark Ettinger' in Google

Peter Høyer

This author has not been identified. Look up 'Peter Høyer' in Google

Emanuel Knill

This author has not been identified. Look up 'Emanuel Knill' in Google