ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Estimarea Fazelor Cuantice×Algoritmul cu Aproximare Cuantică pentru Optimizare×
DomeniuCalcul cuanticCalcul cuantic
FamilieMachine learningMachine learning
Anul apariției19952014
Autorul originalAlexei KitaevEdward Farhi
TipSubroutine algorithmHybrid quantum-classical algorithm
Sursa seminalăKitaev, 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 ↗
Denumiri alternativeQPE, phase kickbackQAOA, quantum alternating operator ansatz
Înrudite34
RezumatQuantum 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.
ScholarGateSet de date
  1. v1
  2. 3 Surse
  3. PUBLISHED
  1. v1
  2. 3 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Quantum Phase Estimation · Quantum Approximate Optimization Algorithm. Preluat la 2026-06-15 de pe https://scholargate.app/ro/compare