Quantum Natural Gradient with Efficient Backtracking Line Search
Touheed Anwar Atif, Uchenna Chukwu, Jesse Berwald, Raouf Dridi

TL;DR
This paper introduces an adaptive Quantum Natural Gradient Descent algorithm with backtracking line search, improving training efficiency of variational quantum algorithms by dynamically adjusting step sizes and outperforming fixed-step methods.
Contribution
The paper presents an adaptive QNGD method using Armijo's rule, which is more efficient and does not require prior knowledge of optimal step size, with minimal added complexity.
Findings
Adaptive QNGD outperforms original QNGD in noisy simulations.
The adaptive scheme achieves similar performance to optimally tuned Euclidean SGD.
Minimal additional computational complexity is involved in the line search.
Abstract
We consider the Quantum Natural Gradient Descent (QNGD) scheme which was recently proposed to train variational quantum algorithms. QNGD is Steepest Gradient Descent (SGD) operating on the complex projective space equipped with the Fubini-Study metric. Here we present an adaptive implementation of QNGD based on Armijo's rule, which is an efficient backtracking line search that enjoys a proven convergence. The proposed algorithm is tested using noisy simulators on three different models with various initializations. Our results show that Adaptive QNGD dynamically adapts the step size and consistently outperforms the original QNGD, which requires knowledge of optimal step size to {perform competitively}. In addition, we show that the additional complexity involved in performing the line search in Adaptive QNGD is minimal, ensuring the gains provided by the proposed adaptive strategy…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Advanced Bandit Algorithms Research · Stochastic Gradient Optimization Techniques
