Training Saturation in Layerwise Quantum Approximate Optimisation

Abstract

Quantum Approximate Optimisation (QAOA) is the most studied gate based variational quantum algorithm today. We train QAOA one layer at a time to maximize overlap with an $n$ qubit target state. Doing so we discovered that such training always saturates -- called \textit{training saturation} -- at some depth $p^{\ast }$, meaning that past a certain depth, overlap can not be improved by adding subsequent layers. We formulate necessary conditions for saturation. Numerically, we find layerwise QAOA reaches its maximum overlap at depth $p^{\ast }=n$. The addition of coherent dephasing errors to training removes saturation, recovering robustness to layerwise training. This study sheds new light on the performance limitations and prospects of QAOA.

7 pages; RevTEX

References in corpus (5)

• A Quantum Approximate Optimization Algorithm
• Quantum approximate optimization is computationally universal
• Engineering arbitrary pure and mixed quantum states
• Comparison of QAOA with Quantum and Simulated Annealing
• Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth