ScholarGate
Msaidizi

Linganisha mbinu

Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.

Ukadiriaji wa Awamu ya Kiasi×Algorithm ya Quantum Approximate Optimization×
NyanjaUkokotoaji wa KwantamuUkokotoaji wa Kwantamu
FamiliaMachine learningMachine learning
Mwaka wa asili19952014
MwanzilishiAlexei KitaevEdward Farhi
AinaSubroutine algorithmHybrid quantum-classical algorithm
Chanzo asiliaKitaev, 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 ↗
Majina mbadalaQPE, phase kickbackQAOA, quantum alternating operator ansatz
Zinazohusiana34
MuhtasariQuantum 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.
ScholarGateSeti ya data
  1. v1
  2. 3 Vyanzo
  3. PUBLISHED
  1. v1
  2. 3 Vyanzo
  3. PUBLISHED

Nenda kwenye utafutaji Pakua slaidi

ScholarGateLinganisha mbinu: Quantum Phase Estimation · Quantum Approximate Optimization Algorithm. Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/compare