The quantum query complexity of the hidden subgroup problem is polynomial
量子物理
2016-12-30 v1
摘要
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.
引用
@article{arxiv.quant-ph/0401083,
title = {The quantum query complexity of the hidden subgroup problem is polynomial},
author = {Mark Ettinger and Peter Hoyer and Emanuel Knill},
journal= {arXiv preprint arXiv:quant-ph/0401083},
year = {2016}
}
备注
To appear in Information Processing Letters (IPL)