Compara mètodes
Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.
| Resolvent Variacional Quàntic d'Autovals× | Algorisme Aproximat Quàntic per a l'Optimització× | |
|---|---|---|
| Camp | Computació quàntica | Computació quàntica |
| Família | Machine learning | Machine learning |
| Any d'origen | 2014 | 2014 |
| Autor original≠ | Alberto Peruzzo | Edward Farhi |
| Tipus | Hybrid quantum-classical algorithm | Hybrid quantum-classical algorithm |
| Font seminal≠ | Peruzzo, A., McClean, J., Shadbolt, P., et al. (2014). A variational eigenvalue solver on a photonic quantum processor. Nature Communications, 5, 4213. DOI ↗ | Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. DOI ↗ |
| Àlies | VQE, hybrid quantum-classical | QAOA, quantum alternating operator ansatz |
| Relacionats | 4 | 4 |
| Resum≠ | 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. | 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. |
| ScholarGateConjunt de dades ↗ |
|
|