Quantum Computing
量子近似优化算法
Quantum Approximate Optimization AlgorithmA hybrid quantum-classical algorithm designed to solve combinatorial optimization problems by approximating the ground state of a cost Hamiltonian. / 一种混合量子经典算法，旨在通过近似成本哈密顿量的基态来解决组合优化问题。
- Knowledge type
- 数学理论
- First proposed or discovered
- 2014
- Proposer
- Edward Farhi, Jeffrey Goldstone, Sam Gutmann
- Creator
- 农场主
- Last updated
- 2026-11-04 19:06:01
Sub-knowledge points
QAOA circuitCost HamiltonianMixing HamiltonianVariational ansatz
Higher-order knowledge points
Variational Quantum EigensolverQuantum AnnealingGrover's Search
Main parameters and performance indicators
depth: Circuit depth determining the approximation qualityshots: Number of measurement samples
Open problems
Scaling efficiencyError mitigationProblem instance selection
Related literature
ranked by community starsImproving feasibility in the quantum approximate optimization algorithm for vehicle routing via constraint-aware initialization and hybrid XY–X mixingOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Quantum Approximate Optimization Algorithm.
Node update feedback
review required