Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Kvantalgoritm för approximativ optimering× | Grovers algoritm× | |
|---|---|---|
| Ämnesområde | Kvantdatorteknik | Kvantdatorteknik |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2014 | 1996 |
| Upphovsperson≠ | Edward Farhi | Lov Grover |
| Typ≠ | Hybrid quantum-classical algorithm | Quantum algorithm |
| Ursprungskälla≠ | Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. DOI ↗ | Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), 212–219. DOI ↗ |
| Alias | QAOA, quantum alternating operator ansatz | quantum search, amplitude amplification |
| Närliggande≠ | 4 | 3 |
| Sammanfattning≠ | 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. | Grover's Algorithm is a quantum algorithm for searching an unsorted database, offering a quadratic speedup over classical linear search. Proposed by Lov Grover in 1996, it exploits quantum superposition and amplitude amplification to find a target item among N items in O(√N) queries, compared to the classical O(N) requirement. |
| ScholarGateDatamängd ↗ |
|
|