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.

arXiv comment7 pages; RevTEX

References in corpus (33)

• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Layerwise learning for quantum neural networks
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
• Obstacles to State Preparation and Variational Optimization from Symmetry Protection
• Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
• The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
• $XY$-mixers: analytical and numerical results for QAOA
• Noise Resilience of Variational Quantum Compiling
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Reachability Deficits in Quantum Approximate Optimization
• Near-optimal quantum circuit for Grover's unstructured search using a transverse field
• Correcting coherent errors with surface codes
• Optimal Protocols in Quantum Annealing and QAOA Problems
• Parameter Concentration in Quantum Approximate Optimization
• Machine learning of noise-resilient quantum circuits
• On the Universality of the Quantum Approximate Optimization Algorithm
• Quantum approximate optimization is computationally universal
• Reconstruction of a Photonic Qubit State with Reinforcement Learning
• Engineering arbitrary pure and mixed quantum states
• Noise-Assisted Quantum Autoencoder
• Noise-Resilient Variational Hybrid Quantum-Classical Optimization
• Abrupt Transitions in Variational Quantum Circuit Training
• Classical and Quantum Bounded Depth Approximation Algorithms
• Exploiting Symmetry Reduces the Cost of Training QAOA
• Comparison of QAOA with Quantum and Simulated Annealing
• Understanding Quantum Control Processor Capabilities and Limitations through Circuit Characterization
• Variational Simulation of Schwinger's Hamiltonian with Polarisation Qubits
• Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth
• Polynomial scaling of QAOA for ground-state preparation of the fully-connected p-spin ferromagnet

Cited by in corpus (26)

• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Barren Plateaus in Variational Quantum Computing
• Theory of overparametrization in quantum neural networks
• Generative quantum machine learning via denoising diffusion probabilistic models
• Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
• Quantum approximate optimization via learning-based adaptive optimization
• Comparative study of variations in quantum approximate optimization algorithms for the Traveling Salesman Problem
• Lyapunov control-inspired strategies for quantum combinatorial optimization
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
• Analysis of The Vehicle Routing Problem Solved via Hybrid Quantum Algorithms in Presence of Noisy Channels
• On Circuit Depth Scaling For Quantum Approximate Optimization
• Efficient variational synthesis of quantum circuits with coherent multi-start optimization
• Calibrating the role of entanglement in variational quantum circuits
• Iterative Layerwise Training for Quantum Approximate Optimization Algorithm
• Randomized adaptive quantum state preparation
• Automatic Depth Optimization for Quantum Approximate Optimization Algorithm
• Robustness of Variational Quantum Algorithms against stochastic parameter perturbation
• Progress towards analytically optimal angles in quantum approximate optimisation
• Barren plateaus are swamped with traps
• Ion native variational ansatz for quantum approximate optimization
• Information flow in parameterized quantum circuits
• Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation
• Depth scaling of unstructured search via quantum approximate optimization
• Hybrid Quantum Classical Graph Neural Networks for Particle Track Reconstruction
• Regularizing quantum loss landscapes by noise injection
• Role of overparametrization in quantum approximate optimization