An Analysis of the Quantum Approximation Optimisation Algorithm
Behzad Mansouri
TL;DR
This paper provides an overview of the Quantum Approximation Optimization Algorithm (QAOA), detailing its mathematical structure, properties, and implementation on various combinatorial optimization problems.
Contribution
It offers a comprehensive analysis of QAOA's structure and explores its application to MaxCut, QUBOs, and Ising Hamiltonians, highlighting its potential and challenges.
Findings
QAOA has a well-defined mathematical structure.
Implementation details for MaxCut, QUBOs, and Ising problems are provided.
The paper discusses the basic properties and potential of QAOA.
Abstract
This article consists of a short introduction to the quantum approximation optimisation algorithm (QAOA). The mathematical structure of the QAOA, as well as its basic properties, are described. The implementation of the QAOA on MaxCut problems, quadratic unconstrained binary optimisation problems (QUBOs), and Ising-type Hamiltonians is considered in detail.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Computability, Logic, AI Algorithms