ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

Variational Quantum Eigensolver×Quantum Approximate Optimization Algorithm×
FagområdeKvanteberegningKvanteberegning
FamilieMachine learningMachine learning
Oprindelsesår20142014
OphavspersonAlberto PeruzzoEdward Farhi
TypeHybrid quantum-classical algorithmHybrid quantum-classical algorithm
Oprindelig kildePeruzzo, 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 ↗
AliasserVQE, hybrid quantum-classicalQAOA, quantum alternating operator ansatz
Relaterede44
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.
ScholarGateDatasæt
  1. v1
  2. 3 Kilder
  3. PUBLISHED
  1. v1
  2. 3 Kilder
  3. PUBLISHED

Gå til søgning Hent slides

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