Faster variational quantum algorithms with quantum kernel-based surrogate models
arXiv:2211.01134 · doi:10.1088/2058-9565/aceb87
Abstract
We present a new optimization method for small-to-intermediate scale variational algorithms on noisy near-term quantum processors which uses a Gaussian process surrogate model equipped with a classically-evaluated quantum kernel. Variational algorithms are typically optimized using gradient-based approaches however these are difficult to implement on current noisy devices, requiring large numbers of objective function evaluations. Our scheme shifts this computational burden onto the classical optimizer component of these hybrid algorithms, greatly reducing the number of queries to the quantum processor. We focus on the variational quantum eigensolver (VQE) algorithm and demonstrate numerically that such surrogate models are particularly well suited to the algorithm's objective function. Next, we apply these models to both noiseless and noisy VQE simulations and show that they exhibit better performance than widely-used classical kernels in terms of final accuracy and convergence speed. Compared to the typically-used stochastic gradient-descent approach for VQAs, our quantum kernel-based approach is found to consistently achieve significantly higher accuracy while requiring less than an order of magnitude fewer quantum circuit evaluations. We analyse the performance of the quantum kernel-based models in terms of the kernels' induced feature spaces and explicitly construct their feature maps. Finally, we describe a scheme for approximating the best-performing quantum kernel using a classically-efficient tensor network representation of its input state and so provide a pathway for scaling these methods to larger systems.
References in corpus (62)
- Scikit-learn: Machine Learning in Python
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Practical Bayesian Optimization of Machine Learning Algorithms
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Elementary gates for quantum computation
- The density-matrix renormalization group in the age of matrix product states
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Efficient classical simulation of slightly entangled quantum computations
- Quantum computational advantage using photons
- Barren plateaus in quantum neural network training landscapes
- A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Quantum support vector machine for big data classification
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Noisy intermediate-scale quantum (NISQ) algorithms
- Kernel methods in machine learning
- Improved Simulation of Stabilizer Circuits
- Error mitigation for short-depth quantum circuits
- Strong quantum computational advantage using a superconducting quantum processor
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Extending the computational reach of a noisy superconducting quantum processor
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- Time-evolution methods for matrix-product states
- A rigorous and robust quantum speed-up in supervised machine learning
- Computing with spin qubits at the surface code error threshold
- Fast universal quantum control above the fault-tolerance threshold in silicon
- Quantum Natural Gradient
- Quantum Process Tomography: Resource Analysis of Different Strategies
- Training variational quantum algorithms is NP-hard
- Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
- qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
- Layerwise learning for quantum neural networks
- QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
- Demonstration of fault-tolerant universal quantum gate operations
- Subspace-search variational quantum eigensolver for excited states
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
- Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
- General parameter-shift rules for quantum gradients
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Learning the quantum algorithm for state overlap
- Fault-tolerant operation of a logical qubit in a diamond quantum processor
- Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
- Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
- Training of Quantum Circuits on a Hybrid Quantum Computer
- Stochastic gradient descent for hybrid quantum-classical optimization
- Hyper-optimized tensor network contraction
- Average fidelity between random quantum states
- Simultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information
- The Boundary for Quantum Advantage in Gaussian Boson Sampling
- Evaluating the noise resilience of variational quantum algorithms
- Measurement Error Mitigation in Quantum Computers Through Classical Bit-Flip Correction
- Using models to improve optimizers for variational quantum algorithms
- The theory of the quantum kernel-based binary classifier
- Measurement Error Mitigation for Variational Quantum Algorithms
- Variational quantum algorithm with information sharing
- Surrogate-based optimization for variational quantum algorithms
- Forecasting timelines of quantum computing
- Efficient Inner-product Algorithm for Stabilizer States
- Quantum Machine Learning using Gaussian Processes with Performant Quantum Kernels