2004/01/14 by Mark Ettinger, Peter Hoyer, Emanuel Knill · 1 citation
Physics and Astronomy · #quant-ph
paper · pdf · doi:10.1016/j.ipl.2004.01.024
published as Information Processing Letters, 91(1), 43-48, 16 July 2004 · To appear in Information Processing Letters (IPL)
arxiv created 2004/01/14 · arxiv updated 2016/12/30
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.