Efficient Online Quantum Circuit Learning with No Upfront Training
arXiv:2501.04636 · doi:10.1038/s42005-025-02423-4
Abstract
We propose a surrogate-based method for optimizing parameterized quantum circuits which is designed to operate with few calls to a quantum computer. We employ a computationally inexpensive classical surrogate to approximate the cost function of a variational quantum algorithm. An initial surrogate is fit to data obtained by sparse sampling of the true cost function using noisy quantum computers. The surrogate is iteratively refined by querying the true cost at the surrogate optima, then using radial basis function interpolation with existing and new true cost data. The use of radial basis function interpolation enables surrogate construction without hyperparameters to pre-train. Additionally, using the surrogate as an acquisition function focuses hardware queries in the vicinity of the true optima. For 16-qubit random 3-regular Max-Cut problems solved using the QAOA ansatz, we find that our method outperforms the prior state of the art. Furthermore, we demonstrate successful optimization of QAOA circuits for 127-qubit random Ising models on an IBM quantum processor using measurement counts of the order of . The strong empirical performance of this approach is an important step towards the large-scale practical application of variational quantum algorithms and a clear demonstration of the effectiveness of classical-surrogate-based learning approaches.
16 pages, 10 figures, 3 tables
References in corpus (51)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Quantum Error Mitigation
- Toward the first quantum simulation with quantum speedup
- Training variational quantum algorithms is NP-hard
- Warm-starting quantum optimization
- The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- Topological and subsystem codes on low-degree graphs with flag qubits
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Parameter Concentration in Quantum Approximate Optimization
- MAXCUT QAOA performance guarantees for p >1
- Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
- Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
- Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
- Does provable absence of barren plateaus imply classical simulability?
- A polynomial-time classical algorithm for noisy random circuit sampling
- Barren plateaus in quantum tensor network optimization
- Hamiltonian variational ansatz without barren plateaus
- Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
- Using models to improve optimizers for variational quantum algorithms
- Efficient tensor network simulation of IBM's largest quantum processors
- Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
- Quantum approximate optimization via learning-based adaptive optimization
- Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
- Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
- Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
- Absence of barren plateaus in finite local-depth circuits with long-range entanglement
- Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
- Efficient classical algorithms for simulating symmetric quantum systems
- Fourier expansion in variational quantum algorithms
- Designing Quantum Annealing Schedules using Bayesian Optimization
- Variational quantum simulation: a case study for understanding warm starts
- Surrogate-based optimization for variational quantum algorithms
- Provable bounds for noise-free expectation values computed from noisy samples
- Efficient Learning of Accurate Surrogates for Simulations of Complex Systems
- Lie-algebraic classical simulations for quantum computing
- Squeezing and quantum approximate optimization
- Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
- Trainability Barriers in Low-Depth QAOA Landscapes
- A polynomial-time classical algorithm for noisy quantum circuits
- Efficient quantum-enhanced classical simulation for patches of quantum landscapes
- Improving the efficiency of learning-based error mitigation
- Surrogate optimization of variational quantum circuits