方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 量子近似优化算法× | 变分量子本征求解器× | |
|---|---|---|
| 领域 | 量子计算 | 量子计算 |
| 方法族 | Machine learning | Machine learning |
| 起源年份 | 2014 | 2014 |
| 提出者≠ | Edward Farhi | Alberto Peruzzo |
| 类型 | Hybrid quantum-classical algorithm | Hybrid quantum-classical algorithm |
| 开创性文献≠ | Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. DOI ↗ | Peruzzo, A., McClean, J., Shadbolt, P., et al. (2014). A variational eigenvalue solver on a photonic quantum processor. Nature Communications, 5, 4213. DOI ↗ |
| 别名 | QAOA, quantum alternating operator ansatz | VQE, hybrid quantum-classical |
| 相关 | 4 | 4 |
| 摘要≠ | 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. | The Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm designed to find the lowest eigenvalue (ground state energy) of a quantum Hamiltonian. Introduced by Peruzzo et al. in 2014, it exploits the variational principle to combine the power of quantum circuits with classical optimization to solve chemistry and materials science problems on near-term quantum devices. |
| ScholarGate数据集 ↗ |
|
|