ScholarGate
Assistent

Compara mètodes

Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.

Estimació de Fase Quàntica×Algorisme Aproximat Quàntic per a l'Optimització×
CampComputació quànticaComputació quàntica
FamíliaMachine learningMachine learning
Any d'origen19952014
Autor originalAlexei KitaevEdward Farhi
TipusSubroutine algorithmHybrid quantum-classical algorithm
Font seminalKitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. DOI ↗
ÀliesQPE, phase kickbackQAOA, quantum alternating operator ansatz
Relacionats34
ResumQuantum Phase Estimation (QPE) is a fundamental quantum subroutine that estimates the eigenvalues of a unitary operator. Developed by Alexei Kitaev in 1995, QPE combines controlled unitary evolution with the quantum Fourier transform to extract eigenvalues from quantum states with exponential precision scaling.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.
ScholarGateConjunt de dades
  1. v1
  2. 3 Fonts
  3. PUBLISHED
  1. v1
  2. 3 Fonts
  3. PUBLISHED

Ves a la cerca Baixa les diapositives

ScholarGateCompara mètodes: Quantum Phase Estimation · Quantum Approximate Optimization Algorithm. Recuperat el 2026-06-15 de https://scholargate.app/ca/compare