Compară metode

	Algoritmul cu Aproximare Cuantică pentru Optimizare	Variational Quantum Eigensolver
Domeniu	Calcul cuantic	Calcul cuantic
Familie	Machine learning	Machine learning
Anul apariției	2014	2014
Autorul original	Edward Farhi	Alberto Peruzzo
Tip	Hybrid quantum-classical algorithm	Hybrid quantum-classical algorithm
Sursa seminală	Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028.	Peruzzo, A., McClean, J., Shadbolt, P., et al. (2014). A variational eigenvalue solver on a photonic quantum processor. Nature Communications, 5, 4213.
Denumiri alternative	QAOA, quantum alternating operator ansatz	VQE, hybrid quantum-classical
Înrudite	4	4
Rezumat	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.	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.