ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Квантов приблизителен оптимизационен алгоритъм×Вариационен квантов алгоритъм за собствени стойности×
ОбластКвантови изчисленияКвантови изчисления
СемействоMachine learningMachine learning
Година на възникване20142014
СъздателEdward FarhiAlberto Peruzzo
ТипHybrid quantum-classical algorithmHybrid quantum-classical algorithm
Основополагащ източникFarhi, 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 ↗
Други названияQAOA, quantum alternating operator ansatzVQE, hybrid quantum-classical
Свързани44
Резюме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.
ScholarGateНабор от данни
  1. v1
  2. 3 Източници
  3. PUBLISHED
  1. v1
  2. 3 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Quantum Approximate Optimization Algorithm · Variational Quantum Eigensolver. Извлечено на 2026-06-15 от https://scholargate.app/bg/compare