ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

Variationskvanteigensolver×Kvantalgoritm för approximativ optimering×
ÄmnesområdeKvantdatorteknikKvantdatorteknik
FamiljMachine learningMachine learning
Ursprungsår20142014
UpphovspersonAlberto PeruzzoEdward Farhi
TypHybrid quantum-classical algorithmHybrid quantum-classical algorithm
UrsprungskällaPeruzzo, 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 ↗
AliasVQE, hybrid quantum-classicalQAOA, quantum alternating operator ansatz
Närliggande44
SammanfattningThe 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.
ScholarGateDatamängd
  1. v1
  2. 3 Källor
  3. PUBLISHED
  1. v1
  2. 3 Källor
  3. PUBLISHED

Gå till sökningen Download slides

ScholarGateJämför metoder: Variational Quantum Eigensolver · Quantum Approximate Optimization Algorithm. Hämtad 2026-06-15 från https://scholargate.app/sv/compare