Machine learningSearch Algorithm
Grover算法
Grover算法是一种用于搜索无序数据库的量子算法，与经典线性搜索相比，它提供了二次方的加速。该算法由Lov Grover于1996年提出，利用量子叠加和幅度放大技术，在N个项目中以O(√N)次查询找到目标项，而经典方法需要O(N)次查询。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), 212–219. DOI: 10.1145/237814.237866 ↗
- Grover, L. K. (1997). Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 79, 325–328. DOI: 10.1103/PhysRevLett.79.325 ↗
- Brassard, G., Hoyer, P., Tapp, A. (2002). Quantum amplitude amplification and estimation. arXiv preprint quant-ph/0005055. link ↗
如何引用本页
ScholarGate. (2026, June 3). Grover's Algorithm for Quantum Search. ScholarGate. https://scholargate.app/zh/quantum-computing/grovers-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →