方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 量子近似优化算法× | Grover算法× | |
|---|---|---|
| 领域 | 量子计算 | 量子计算 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2014 | 1996 |
| 提出者≠ | Edward Farhi | Lov Grover |
| 类型≠ | Hybrid quantum-classical algorithm | Quantum algorithm |
| 开创性文献≠ | Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. DOI ↗ | 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 ↗ |
| 别名 | QAOA, quantum alternating operator ansatz | quantum search, amplitude amplification |
| 相关≠ | 4 | 3 |
| 摘要≠ | The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm designed to solve combinatorial optimization problems on near-term quantum devices. Introduced by Farhi, Goldstone, and Gutmann in 2014, QAOA encodes optimization problems into quantum circuits and uses classical optimization to tune circuit parameters, aiming to find approximately optimal solutions for problems like MaxCut, graph coloring, and scheduling. | Grover's Algorithm is a quantum algorithm for searching an unsorted database, offering a quadratic speedup over classical linear search. Proposed by Lov Grover in 1996, it exploits quantum superposition and amplitude amplification to find a target item among N items in O(√N) queries, compared to the classical O(N) requirement. |
| ScholarGate数据集 ↗ |
|
|