Quantum Approximate Optimization Algorithm
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.
Rekod sumber
Petikan disalin secara verbatim daripada rekod sumber kaedah. Tiada pengesahan peringkat tuntutan disimpulkan daripadanya.
- Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. · DOI 10.48550/arXiv.1411.4028
- Zhou, L., Wang, S. T., Choi, S., et al. (2020). Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. Physical Review X, 10, 021067. · DOI 10.1103/PhysRevX.10.021067
- Hadfield, S., Wang, Z., O'Gorman, B., et al. (2019). From the Ising model to QAOA: A quantum optimization algorithm from the physicist's perspective. Algorithms, 12, 34. · URL
Tuntutan yang dikurasi
Tuntutan disimpan dalam lejar bukti, setiap satu dengan penilaiannya sendiri.
Pandangan ini tidak mencipta penilaian tuntutan apabila lejar tiada.
Kaedah berkaitan
Dijana daripada graf kaedah dan ditunjukkan sebagai perhubungan yang dicadangkan mesin — tiada tuntutan bukti disimpulkan.