End-to-End Protocol for High-Quality QAOA Parameters with Few Shots
Preprint
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 tuning on a trapped-ion processor.
Keywords
All Related Versions
This publication has 47 references indexed in Scilit:
- PDFO: a cross-platform package for Powell’s derivative-free optimization solversMathematical Programming Computation, 2024
- A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free OptimizationFoundations of Computational Mathematics, 2021
- Deterministic Preparation of Dicke States2019
- 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
- The NEWUOA software for unconstrained optimization without derivatives2006
- UOBYQA: unconstrained optimization by quadratic approximationMathematical Programming, 2002
- A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation1994