Evaluation of QAOA based on the approximation ratio of individual samples

Abstract

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm to solve binary-variable optimization problems. Due to its expected robustness to systematic errors and the short circuit depth, it is one of the promising candidates likely to run on near-term quantum devices. We project the performance of QAOA applied to the Max-Cut problem and compare it with some of the best classical alternatives, both for exact or approximate solution. When comparing approximate solvers, their performance is characterized by the computational time taken to achieve a given quality of solution. Since QAOA is based on sampling, we introduce performance metrics based on the probability of observing a sample above a certain quality. In addition, we show that the QAOA performance varies significantly with the graph type. By selecting a suitable optimizer for the variational parameters and reducing the number of function evaluations, QAOA performance improves by up to 2 orders of magnitude compared to previous estimates. Especially for 3-regular random graphs, this setting decreases the performance gap with classical alternatives.

ORQVIZ: Visualizing High-Dimensional Landscapes in Variational Quantum Algorithms

“…Our visualization results confirm the quantitative studies of [7], as well as more recent work utilizing this phenomenon [23][24][25][26]. In fact, the degree of parameter concentration could be quantified using similarity metrics between visualization scans.…”

Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms

“…akmaxsat is a state-ofthe-art solver of the Max-SAT problem to which both QUBO and PUBO can be reduced. It has been previously used to benchmark both quantum annealers [14] and QAOA algorithms [27,33].…”

“…The figure of merit of the parameters' optimization is usually chosen to be the expectation value of the energy over the distribution P ( s), namely ψ( γ, β)| Ĥpubo |ψ( γ, β) . Other choices are possible [32,33]. When the exact solution is known, results are typically reported in term of the approximation ratio:…”

Warm-starting quantum optimization

“…8. Since the energy landscape is non-convex and contains many local minima it is challenging to find globally optimal parameters starting from random guesses of β and γ [32,[88][89][90] at depth-one with random initial guesses for β 1 and γ 1 COBYLA does not always find the optimal β 1 = π/2 and γ 1 = 0, see Fig. 7 and Fig.…”