Guided-SPSA: Simultaneous Perturbation Stochastic Approximation assisted by the Parameter Shift Rule

Abstract

The study of variational quantum algorithms (VQCs) has received significant attention from the quantum computing community in recent years. These hybrid algorithms, utilizing both classical and quantum components, are well-suited for noisy intermediate-scale quantum devices. Though estimating exact gradients using the parameter-shift rule to optimize the VQCs is realizable in NISQ devices, they do not scale well for larger problem sizes. The computational complexity, in terms of the number of circuit evaluations required for gradient estimation by the parameter-shift rule, scales linearly with the number of parameters in VQCs. On the other hand, techniques that approximate the gradients of the VQCs, such as the simultaneous perturbation stochastic approximation (SPSA), do not scale with the number of parameters but struggle with instability and often attain suboptimal solutions. In this work, we introduce a novel gradient estimation approach called Guided-SPSA, which meaningfully combines the parameter-shift rule and SPSA-based gradient approximation. The Guided-SPSA results in a 15% to 25% reduction in the number of circuit evaluations required during training for a similar or better optimality of the solution found compared to the parameter-shift rule. The Guided-SPSA outperforms standard SPSA in all scenarios and outperforms the parameter-shift rule in scenarios such as suboptimal initialization of the parameters. We demonstrate numerically the performance of Guided-SPSA on different paradigms of quantum machine learning, such as regression, classification, and reinforcement learning.

This paper has been accepted for publication in the proceedings of the 2024 IEEE International Conference on Quantum Computing and Engineering (QCE)

References in corpus (19)

• Quantum Computing in the NISQ era and beyond
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• Quantum support vector machine for big data classification
• Error mitigation for short-depth quantum circuits
• Evaluating analytic gradients on quantum hardware
• Data re-uploading for a universal quantum classifier
• Quantum Error Mitigation
• A rigorous and robust quantum speed-up in supervised machine learning
• Generalization in quantum machine learning from few training data
• Quantum Natural Gradient
• Quantum agents in the Gym: a variational quantum algorithm for deep Q-learning
• Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
• Neutral Atom Quantum Computing Hardware: Performance and End-User Perspective
• Quantum Annealing-Based Software Components: An Experimental Case Study with SAT Solving
• An Empirical Comparison of Optimizers for Quantum Machine Learning with SPSA-based Gradients
• Quantum Natural Policy Gradients: Towards Sample-Efficient Reinforcement Learning
• Quantum gradient evaluation through quantum non-demolition measurements
• BCQQ: Batch-Constraint Quantum Q-Learning with Cyclic Data Re-uploading

Cited by in corpus (4)

• Quantum Generative Learning for High-Resolution Medical Image Generation
• Hype or Heuristic? Quantum Reinforcement Learning for Join Order Optimisation
• Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation
• CutReg: A loss regularizer for enhancing the scalability of QML via adaptive circuit cutting