ScholarGate
Assistent

Methoden vergelijken

Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.

Kwantumalgoritme voor benadering van optimalisatie×Variationele Kwantum-Eigensolver×
VakgebiedKwantumcomputingKwantumcomputing
FamilieMachine learningMachine learning
Jaar van ontstaan20142014
GrondleggerEdward FarhiAlberto Peruzzo
TypeHybrid quantum-classical algorithmHybrid quantum-classical algorithm
Oorspronkelijke bronFarhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. DOI ↗Peruzzo, A., McClean, J., Shadbolt, P., et al. (2014). A variational eigenvalue solver on a photonic quantum processor. Nature Communications, 5, 4213. DOI ↗
AliassenQAOA, quantum alternating operator ansatzVQE, hybrid quantum-classical
Verwant44
SamenvattingThe 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.
ScholarGateGegevensset
  1. v1
  2. 3 Bronnen
  3. PUBLISHED
  1. v1
  2. 3 Bronnen
  3. PUBLISHED

Naar zoeken Download slides

ScholarGateMethoden vergelijken: Quantum Approximate Optimization Algorithm · Variational Quantum Eigensolver. Geraadpleegd op 2026-06-15 via https://scholargate.app/nl/compare