ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

Kvantetilnærmet optimeringsalgoritme×Variasjonskvanteegentilstandsløser×
FagfeltKvanteberegningKvanteberegning
FamilieMachine learningMachine learning
Opprinnelsesår20142014
OpphavspersonEdward FarhiAlberto Peruzzo
TypeHybrid quantum-classical algorithmHybrid quantum-classical algorithm
Opprinnelig kildeFarhi, 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 ↗
AliasQAOA, quantum alternating operator ansatzVQE, hybrid quantum-classical
Relaterte44
SammendragThe 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.
ScholarGateDatasett
  1. v1
  2. 3 Kilder
  3. PUBLISHED
  1. v1
  2. 3 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: Quantum Approximate Optimization Algorithm · Variational Quantum Eigensolver. Hentet 2026-06-15 fra https://scholargate.app/no/compare