mlsanityData to 14 Oct 2026

Enhancing variational quantum algorithms by balancing training on classical and quantum hardware

arXiv 2503.16361 ↗First posted 20 Mar 2025quant-ph cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Quantum computers offer a promising route to tackling problems that are classically intractable such as in prime-factorization, solving large-scale linear algebra and simulating complex quantum systems, but potentially require fault-tolerant quantum hardware. On the other hand, variational quantum algorithms (VQAs) are a promising approach for leveraging near-term quantum computers to solve complex problems. However, there remain major challenges in their trainability and resource costs on quantum hardware. Here we address these challenges by adopting Hardware Efficient and dynamical LIe algebra supported Ansatz (HELIA), and propose two training methods that combine an existing classical-enhanced g-sim method and the quantum-based Parameter-Shift Rule (PSR). Our improvement comes from distributing the resources required for gradient estimation and training to both classical and quantum hardware. We numerically evaluate our approach for ground-state estimation of 6 to 18-qubit Hamiltonians using the Variational Quantum Eigensolver (VQE) and quantum phase classification for up to 12-qubit Hamiltonians using quantum neural networks. For VQE, our method achieves higher accuracy and success rates, with an average reduction in quantum hardware calls of up to 60% compared to purely quantum-based PSR. For classification, we observe test accuracy improvements of up to 2.8%. We also numerically demonstrate the capability of HELIA in mitigating barren plateaus, paving the way for training large-scale quantum models.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 24 of its 118 references that are in the map. First posted on arXiv 20 Mar 2025.

Builds on

24 of 118 references.

References · 24

  1. 2020Variational Quantum Algorithmscited by 692
  2. 2018Supervised learning with quantum enhanced feature spacescited by 665
  3. 2018Barren plateaus in quantum neural network training landscapescited by 630
  4. 2020Noise-Induced Barren Plateaus in Variational Quantum Algorithmscited by 193
  5. 2024Barren Plateaus in Variational Quantum Computingcited by 133
  6. 2020Entanglement Induced Barren Plateauscited by 101
  7. 2023Does provable absence of barren plateaus imply classical simulability?cited by 80
  8. 2019Learning to learn with quantum neural networks via classical neural networkscited by 56
  9. 2022Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networkscited by 52
  10. 2022Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimizationcited by 43
  11. 2023Challenges and Opportunities in Quantum Optimizationcited by 42
  12. 2022Representation Theory for Geometric Quantum Machine Learningcited by 40
12 more
  1. 2023On quantum backpropagation, information reuse, and cheating measurement collapsecited by 32
  2. 2020Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuitscited by 26
  3. 2021Optimal training of variational quantum algorithms without barren plateauscited by 16
  4. 2022Avoiding Barren Plateaus with Classical Deep Neural Networkscited by 13
  5. 2024A Unified Theory of Quantum Neural Network Loss Landscapescited by 12
  6. 2023Splitting and Parallelizing of Quantum Convolutional Neural Networks for Learning Translationally Symmetric Datacited by 10
  7. 2024Investigating and Mitigating Barren Plateaus in Variational Quantum Circuits: A Surveycited by 10
  8. 2022Randomized gradient-free methods in convex optimizationcited by 7
  9. 2025A unifying account of warm start guarantees for patches of quantum landscapescited by 5
  10. 2024Efficient quantum-enhanced classical simulation for patches of quantum landscapescited by 4
  11. 2023The Quantum Alternating Operator Ansatz for Satisfiability Problemscited by 2
  12. 2023Quantum Shadow Gradient Descent for Variational Quantum Algorithmscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.