End-to-end protocol for high-quality quantum approximate optimization algorithm parameters with few shots
Open Access
- 21 August 2025
- journal article
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Abstract
The quantum approximate optimization algorithm (QAOA) is a quantum heuristic for combinatorial optimization that has been demonstrated to scale better than state-of-the-art classical solvers for some problems. For a given problem instance, QAOA performance depends crucially on the choice of the parameters. While average-case optimal parameters are available in many cases, meaningful performance gains can be obtained by fine-tuning these parameters for a given instance. This task is especially challenging, however, when the number of circuit executions (shots) is limited. In this work, we develop an end-to-end protocol that combines multiple parameter settings and fine-tuning techniques. We use large-scale numerical experiments to optimize the protocol for the shot-limited setting and observe that optimizers with the simplest internal model (linear) perform best. We implement the optimized pipeline on a trapped-ion processor using up to 32 qubits and 5 QAOA layers, and we demonstrate that the pipeline is robust to small amounts of hardware noise. To the best of our knowledge, these are the largest demonstrations of QAOA parameter fine-tuning on a trapped-ion processor in terms of two-qubit gate count.Keywords
All Related Versions
Funding Information
- U.S. Department of Energy (DE-AC02-06CH11357)
This publication has 42 references indexed in Scilit:
- Optimizing Shot Assignment in Variational Quantum Eigensolver MeasurementJournal of Chemical Theory and Computation, 2024
- A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free OptimizationFoundations of Computational Mathematics, 2021
- Derivative-free optimization methodsActa Numerica, 2019
- Stochastic optimization using a trust-region method and random modelsMathematical Programming, 2017
- Stochastic derivative-free optimization using a trust region frameworkComputational Optimization and Applications, 2016
- On fast trust region methods for quadratic models with linear constraintsMathematical Programming Computation, 2015
- Some Variants of the Controlled Random Search Algorithm for Global OptimizationJournal of Optimization Theory and Applications, 2006
- UOBYQA: unconstrained optimization by quadratic approximationMathematical Programming, 2002
- A Locally-Biased form of the DIRECT AlgorithmJournal of Global Optimization, 2001
- Quantum optimizationInformation Sciences, 2000