Multilevel Leapfrogging Initialization Strategy for Quantum Approximate Optimization Algorithm
- 29 March 2024
- journal article
- research article
- Published by Wiley in Advanced Quantum Technologies
- Vol. 7 (5)
Abstract
Recently, Zhou et al. have proposed an Interpolation‐based (INTERP) strategy to generate the initial parameters for Quantum Approximate Optimization Algorithm (QAOA). INTERP guesses the initial parameters at level by applying interpolation to the optimized parameters at level , achieving better performance than random initialization (RI). Nevertheless, INTERP consumes extensive costs for deep QAOA because it necessitates optimization at each level depth. To address it, a Multilevel Leapfrogging Interpolation (MLI) strategy is proposed. MLI produces initial parameters from level to () at level , omitting the optimization rounds from level to . MLI executes optimization at few levels rather than each level, and this operation is called Multilevel Leapfrogging optimization (M‐Leap). The performance of MLI is investigated on the Maxcut problem. The simulation results demonstrate MLI achieves the same quasi‐optima as INTERP while consuming 1/2 of costs required by INTERP. Besides, for MLI, where there is no RI except for level 1, the greedy‐MLI strategy is presented. The simulation results suggest greedy‐MLI has better stability than INTERP and MLI beyond obtaining the quasi‐optima. 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.Keywords
All Related Versions
Funding Information
- Natural Science Foundation of Beijing Municipality (4222031)
- National Natural Science Foundation of China (62371069, 62272056, 62372048)
- Beijing University of Posts and Telecommunications (CX2023123)
This publication has 47 references indexed in Scilit:
- Adaptive, problem-tailored variational quantum eigensolver mitigates rough parameter landscapes and barren plateausnpj Quantum Information, 2023
- Benchmarking the performance of portfolio optimization with QAOAQuantum Information Processing, 2022
- Quantum circuit architecture search for variational quantum algorithmsnpj Quantum Information, 2022
- Applying the quantum approximate optimization algorithm to the minimum vertex cover problemApplied Soft Computing, 2022
- Identifying optimal cycles in quantum thermal machines with reinforcement-learningnpj Quantum Information, 2022
- Benchmarking the quantum approximate optimization algorithmQuantum Information Processing, 2020
- An adaptive variational algorithm for exact molecular simulations on a quantum computerNature Communications, 2019
- Variational quantum state diagonalizationnpj Quantum Information, 2019
- Any quantum network is structurally controllable by a single driving signalQuantum Information Processing, 2018
- Quantum principal component analysisNature Physics, 2014