方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 量子近似优化算法× | 量子相位估计× | |
|---|---|---|
| 领域 | 量子计算 | 量子计算 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2014 | 1995 |
| 提出者≠ | Edward Farhi | Alexei Kitaev |
| 类型≠ | Hybrid quantum-classical algorithm | Subroutine algorithm |
| 开创性文献≠ | Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. DOI ↗ | Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗ |
| 别名 | QAOA, quantum alternating operator ansatz | QPE, phase kickback |
| 相关≠ | 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. | Quantum Phase Estimation (QPE) is a fundamental quantum subroutine that estimates the eigenvalues of a unitary operator. Developed by Alexei Kitaev in 1995, QPE combines controlled unitary evolution with the quantum Fourier transform to extract eigenvalues from quantum states with exponential precision scaling. |
| ScholarGate数据集 ↗ |
|
|