Algorithm ya Quantum Approximate Optimization
Algorithm ya Quantum Approximate Optimization (QAOA) ni algorithm ya mseto ya quantum-classical iliyoundwa kutatua matatizo ya optimization ya combinatorial kwenye vifaa vya quantum vya karibu. Imeanzishwa na Farhi, Goldstone, na Gutmann mnamo 2014, QAOA huweka matatizo ya optimization kwenye nyaya za quantum na hutumia optimization ya classical kurekebisha vigezo vya mzunguko, ikilenga kupata suluhisho za karibu na bora kwa matatizo kama MaxCut, kuchorea grafu, na ratiba.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- 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. link ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Quantum Approximate Optimization Algorithm (QAOA). ScholarGate. https://scholargate.app/sw/quantum-computing/quantum-approximate-optimization-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Algoriti ya GroverUkokotoaji wa Kwantamu↔ compare
- Quantum Monte CarloUkokotoaji wa Kwantamu↔ compare
- Ukadiriaji wa Awamu ya KiasiUkokotoaji wa Kwantamu↔ compare
- Mtafiti wa Kiasi wa Quantum (Variational Quantum Eigensolver)Ukokotoaji wa Kwantamu↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →