Multilevel leapfrogging initialization for quantum approximate optimization algorithm
Preprint
Abstract
Recently, Zhou et al. have proposed a novel Interpolation-based (INTERP) strategy to generate the initial parameters for the Parameterized Quantum Circuit (PQC) in Quantum Approximate Optimization Algorithm (QAOA). INTERP produces the guess of the initial parameters at level $i+1$ by applying linear interpolation to the optimized parameters at level $i$, achieving better performance than random initialization (RI). Nevertheless, INTERP consumes extensive running costs for deep QAOA because it necessitates optimization at each level of the PQC. To address this problem, a Multilevel Leapfrogging Interpolation (MLI) strategy is proposed. MLI can produce the guess of the initial parameters from level $i+1$ to $i+l$ ($l>1$) at level $i$, omitting the optimization rounds from level $i+1$ to $(i+l-1)$. The final result is that MLI executes optimization at few levels rather than each level, and this operation is referred to as Multilevel Leapfrogging optimization (M-Leap). The performance of MLI is investigated on the Maxcut problem. Compared with INTERP, MLI reduces most optimization rounds. Remarkably, the simulation results demonstrate that MLI can achieve the same quasi-optima as INTERP while consuming only 1/2 of the running costs required by INTERP. In addition, for MLI, where there is no RI except for level $1$, the greedy-MLI strategy is presented. The simulation results suggest that greedy-MLI has better stability (i.e., a higher average approximation ratio) than INTERP and MLI beyond obtaining the same quasi-optima as INTERP. According to the efficiency of finding the quasi-optima, the idea of M-Leap might be extended to other training tasks, especially those requiring numerous optimizations, such as training adaptive quantum circuits.
Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Applying the quantum approximate optimization algorithm to the minimum vertex cover problemApplied Soft Computing, 2022
- Near-term quantum algorithms for linear systems of equations with regression loss functionsNew Journal of Physics, 2021
- Variational quantum algorithmsNature Reviews Physics, 2021
- Quantum autoencoders with enhanced data encodingMachine Learning: Science and Technology, 2021
- Improved quantum algorithm for A-optimal projectionPhysical Review A, 2020
- Benchmarking the quantum approximate optimization algorithmQuantum Information Processing, 2020
- Training the quantum approximate optimization algorithm without access to a quantum processing unitQuantum Science and Technology, 2020
- Variational quantum algorithms for nonlinear problemsPhysical Review A, 2020
- Variational quantum state diagonalizationnpj Quantum Information, 2019
- Quantum principal component analysisNature Physics, 2014