方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 量子近似优化算法× | 量子蒙特卡洛× | |
|---|---|---|
| 领域 | 量子计算 | 量子计算 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2014 | 1953 |
| 提出者≠ | Edward Farhi | Nicholas Metropolis and colleagues |
| 类型≠ | Hybrid quantum-classical algorithm | Monte Carlo simulation |
| 开创性文献≠ | Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. DOI ↗ | Metropolis, N., Rosenbluth, A. W., et al. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087–1092. DOI ↗ |
| 别名≠ | QAOA, quantum alternating operator ansatz | QMC, variational Monte Carlo, diffusion Monte Carlo |
| 相关≠ | 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 Monte Carlo (QMC) is a stochastic computational method for computing ground state properties of quantum many-body systems. Combining classical Monte Carlo sampling with quantum mechanics, QMC approaches are among the most accurate methods available for electronic structure and condensed matter physics, achieving sub-percent accuracy for many systems. |
| ScholarGate数据集 ↗ |
|
|