An Analysis of the Quantum Approximation Optimisation Algorithm

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.

References in corpus (6)

• A Quantum Approximate Optimization Algorithm
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• $XY$-mixers: analytical and numerical results for QAOA
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
• Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search