Quantum counting

Gilles Brassard, Peter F. Høyer, Alain Tapp · 1998 · Classical and Quantum Computation (AMS)

| 编号 QRES008 | 主题 资源账本与工具 | 链接 arXiv:quant-ph/9805082 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

We study some extensions of Grover’s quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist. Finally, as our main result, we combine ideas from Grover’s and Shor’s quantum algorithms to perform approximate counting, which can be seen as an amplitude estimation process.

本站词条在引用该文献时，会以 wikilink（sources/QRES008）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。