Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Natural Gradient with Geodesic Corrections for Small Shallow Quantum Circuits

Halla, Mourad

Published Jan 1, 2025• 0 citations
Publisher

Abstract

The Quantum Natural Gradient (QNG) method enhances optimizationin variational quantum algorithms (VQAs) by incorporating geometric insights fromthe quantum state space through the Fubini-Study metric. In this work, we extendQNG by introducing higher-order integrators and geodesic corrections using theRiemannian Euler update rule and geodesic equations, deriving an updated rule for theQuantum Natural Gradient with Geodesic Correction (QNGGC). We also develop anefficient method for computing the Christoffel symbols necessary for these corrections,leveraging the parameter-shift rule to enable direct measurement from quantumcircuits. Through theoretical analysis and practical examples, we demonstrate thatQNGGC significantly improves convergence rates over standard QNG, highlightingthe benefits of integrating geodesic corrections into quantum optimization processes.Our approach paves the way for more efficient quantum algorithms, leveraging theadvantages of geometric methods.

DOI
10.3204/pubdb-2025-01396

Related papers

Quantum natural gradient with geodesic corrections for small shallow quantum circuits

Mourad Halla

Abstract The Quantum Natural Gradient (QNG) method enhances optimization in variational quantum algorithms (VQAs) by incorporating geometric insights from the quantum state space through the Fubini-Study metric. In this work, we extend QNG by introducing higher-order integrators and geodesic corrections using the Riemannian Euler update rule and geodesic equations, deriving an updated rule for the Quantum Natural Gradient with Geodesic Correction (QNGGC). We also develop an efficient method for computing the Christoffel symbols necessary for these corrections, leveraging the parameter-shift rule to enable direct measurement from quantum circuits. Through theoretical analysis and practical examples, we demonstrate that QNGGC significantly improves convergence rates over standard QNG, highlighting the benefits of integrating geodesic corrections into quantum optimization processes. Our approach paves the way for more efficient quantum algorithms, leveraging the advantages of geometric methods.

arXiv:2409.03638•Physica Scripta•Apr 24, 2025•7 citations

Modified Conjugate Quantum Natural Gradient

Mourad Halla

The efficient optimization of variational quantum algorithms (VQAs) is critical for their successful application in quantum computing. The Quantum Natural Gradient (QNG) method, which leverages the geometry of quantum state space, has demonstrated improved convergence compared to standard gradient descent [Quantum 4, 269 (2020)]. In this work, we introduce the Modified Conjugate Quantum Natural Gradient (CQNG), an optimization algorithm that integrates QNG with principles from the nonlinear conjugate gradient method. Unlike QNG, which employs a fixed learning rate, CQNG dynamically adjusts hyperparameters at each step, enhancing both efficiency and flexibility. Numerical simulations show that CQNG achieves faster convergence than QNG across various optimization scenarios, even when strict conjugacy conditions are not always satisfied -- hence the term ``Modified Conjugate.'' These results highlight CQNG as a promising optimization technique for improving the performance of VQAs.

•Jan 1, 2025•0 citations

Efficient Hamiltonian-aware Quantum Natural Gradient Descent for Variational Quantum Eigensolvers

Chenyu Shi, Hao Wang

The Variational Quantum Eigensolver (VQE) is one of the most promising algorithms for current quantum devices. It employs a classical optimizer to iteratively update the parameters of a variational quantum circuit in order to search for the ground state of a given Hamiltonian. The efficacy of VQEs largely depends on the optimizer employed. Recent studies suggest that Quantum Natural Gradient Descent (QNG) can achieve faster convergence than vanilla gradient descent (VG), but at the cost of additional quantum resources to estimate Fubini-Study metric tensor in each optimization step. The Fubini-Study metric tensor used in QNG is related to the entire quantum state space and does not incorporate information about the target Hamiltonian. To take advantage of the structure of the Hamiltonian and address the limitation of additional computational cost in QNG, we propose Hamiltonian-aware Quantum Natural Gradient Descent (H-QNG). In H-QNG, we propose to use the Riemannian pullback metric induced from the lower-dimensional subspace spanned by the Hamiltonian terms onto the parameter space. We show that H-QNG inherits the desirable features of both approaches: the low quantum computational cost of VG and the reparameterization-invariance of QNG. We also validate its performance through numerical experiments on molecular Hamiltonians, showing that H-QNG achieves faster convergence to chemical accuracy while requiring fewer quantum computational resources.

quant-pharXiv:2511.14511•Quantum Machine Intelligence•Nov 19, 2025•1 citation

Modified conjugate quantum natural gradient

Mourad Halla

Abstract The efficient optimization of variational quantum algorithms (VQAs) is critical for their successful application in quantum computing. The Quantum Natural Gradient (QNG) method, which leverages the geometry of quantum state space, has demonstrated improved convergence compared to standard gradient descent (Stokes et al. in Quantum 4:269, 2020). In this work, we introduce the Modified Conjugate Quantum Natural Gradient (CQNG), an optimization algorithm that integrates QNG with principles from the nonlinear conjugate-gradient method. Unlike QNG, which employs a fixed learning rate, CQNG dynamically adjusts its hyperparameters at each step, enhancing both efficiency and flexibility. Numerical simulations show that CQNG achieves faster convergence and reduces quantum-resource requirements compared to QNG across various optimization scenarios, even when strict conjugacy conditions are not fully satisfied—hence the term “Modified Conjugate.” These results highlight CQNG as a promising optimization technique for improving the performance of VQAs.

arXiv:2501.05847•EPJ Quantum Technology•Oct 29, 2025•7 citations

Experimental quantum natural gradient optimization in photonics

Yizhi Wang, Shichuan Xue, Yaxuan Wang +10 more

Variational quantum algorithms (VQAs) combining the advantages of parameterized quantum circuits and classical optimizers, promise practical quantum applications in the noisy intermediate-scale quantum era. The performance of VQAs heavily depends on the optimization method. Compared with gradient-free and ordinary gradient descent methods, the quantum natural gradient (QNG), which mirrors the geometric structure of the parameter space, can achieve faster convergence and avoid local minima more easily, thereby reducing the cost of circuit executions. We utilized a fully programmable photonic chip to experimentally estimate the QNG in photonics for the first time, to the best of our knowledge. We obtained the dissociation curve of the He-H + cation and achieved chemical accuracy, verifying the outperformance of QNG optimization on a photonic device. Our work opens up a vista of utilizing QNG in photonics to implement practical near-term quantum applications.

arXiv:2310.07371•Optics Letters•Jun 15, 2023•8 citations

Loss-aware state space geometry for quantum variational algorithms

Ankit Gill, Kunal Pal

The natural gradient descent optimisation technique is an efficient optimising protocol for broad classes of classical and quantum systems that takes the underlying geometry of the parameter manifold into account by means of using either the Fisher information metric of the classical probability distribution function or the Fubini-Study tensor of the associated parametrised quantum states in the consequent update rules. Even though the natural gradient descent procedure utilises the geometry of the space of probability or states, it is, however, insensitive to the measure of parametrised distance on the space of possible outcomes when the corresponding optimising problem is considered for the expectation value of a classical or quantum observable with respect to the probability distribution or the quantum state. In this work, we introduce a generic optimising principle, where the intrinsic geometry of the space of outcomes has been taken into account suitably, either by using an ambient space construction with a base statistical manifold with the usual Fisher information metric (or the Fubini-Study tensor), where the loss hypersurface is embedded to, or by means of a first-principle construction from the overlap of nearby quantum states on the projective Hilbert space. This construction as well as a family of conformal variants yields a form of loss-aware natural gradient updates that rescale the effective step size while preserving the descent direction. We benchmark the resulting optimisers on variational quantum circuit examples and on a classical neural network task, finding that, while the standard natural gradient remains the most robust on average, the proposed conformal schemes can improve best-case convergence in favourable regimes.

quant-pharXiv:2604.05627•Journal of Physics A Mathematical and Theoretical•Apr 8, 2026•0 citations
The Quantum Natural Gradient (QNG) method enhances optimizationin variational quantum algorithms (VQAs) by incorporating geometric insights fromthe quantum state space through the Fubini-Study metric. In this work, we extendQNG by introducing higher-order integrators and geodesic corrections using theRiemannian Euler update rule and geodesic equations, deriving an updated rule for theQuantum Natural Gradient with Geodesic Correction (QNGGC). We also develop anefficient method for computing the Christoffel symbols necessary for these corrections,leveraging the parameter-shift rule to enable direct measurement from quantumcircuits. Through theoretical analysis and practical examples, we demonstrate thatQNGGC significantly improves convergence rates over standard QNG, highlightingthe benefits of integrating geodesic corrections into quantum optimization processes.Our approach paves the way for more efficient quantum algorithms, leveraging theadvantages of geometric methods.
Abstract The Quantum Natural Gradient (QNG) method enhances optimization in variational quantum algorithms (VQAs) by incorporating geometric insights from the quantum state space through the Fubini-Study metric. In this work, we extend QNG by introducing higher-order integrators and geodesic corrections using the Riemannian Euler update rule and geodesic equations, deriving an updated rule for the Quantum Natural Gradient with Geodesic Correction (QNGGC). We also develop an efficient method for computing the Christoffel symbols necessary for these corrections, leveraging the parameter-shift rule to enable direct measurement from quantum circuits. Through theoretical analysis and practical examples, we demonstrate that QNGGC significantly improves convergence rates over standard QNG, highlighting the benefits of integrating geodesic corrections into quantum optimization processes. Our approach paves the way for more efficient quantum algorithms, leveraging the advantages of geometric methods.
The efficient optimization of variational quantum algorithms (VQAs) is critical for their successful application in quantum computing. The Quantum Natural Gradient (QNG) method, which leverages the geometry of quantum state space, has demonstrated improved convergence compared to standard gradient descent [Quantum 4, 269 (2020)]. In this work, we introduce the Modified Conjugate Quantum Natural Gradient (CQNG), an optimization algorithm that integrates QNG with principles from the nonlinear conjugate gradient method. Unlike QNG, which employs a fixed learning rate, CQNG dynamically adjusts hyperparameters at each step, enhancing both efficiency and flexibility. Numerical simulations show that CQNG achieves faster convergence than QNG across various optimization scenarios, even when strict conjugacy conditions are not always satisfied -- hence the term ``Modified Conjugate.'' These results highlight CQNG as a promising optimization technique for improving the performance of VQAs.
The Variational Quantum Eigensolver (VQE) is one of the most promising algorithms for current quantum devices. It employs a classical optimizer to iteratively update the parameters of a variational quantum circuit in order to search for the ground state of a given Hamiltonian. The efficacy of VQEs largely depends on the optimizer employed. Recent studies suggest that Quantum Natural Gradient Descent (QNG) can achieve faster convergence than vanilla gradient descent (VG), but at the cost of additional quantum resources to estimate Fubini-Study metric tensor in each optimization step. The Fubini-Study metric tensor used in QNG is related to the entire quantum state space and does not incorporate information about the target Hamiltonian. To take advantage of the structure of the Hamiltonian and address the limitation of additional computational cost in QNG, we propose Hamiltonian-aware Quantum Natural Gradient Descent (H-QNG). In H-QNG, we propose to use the Riemannian pullback metric induced from the lower-dimensional subspace spanned by the Hamiltonian terms onto the parameter space. We show that H-QNG inherits the desirable features of both approaches: the low quantum computational cost of VG and the reparameterization-invariance of QNG. We also validate its performance through numerical experiments on molecular Hamiltonians, showing that H-QNG achieves faster convergence to chemical accuracy while requiring fewer quantum computational resources.
Abstract The efficient optimization of variational quantum algorithms (VQAs) is critical for their successful application in quantum computing. The Quantum Natural Gradient (QNG) method, which leverages the geometry of quantum state space, has demonstrated improved convergence compared to standard gradient descent (Stokes et al. in Quantum 4:269, 2020). In this work, we introduce the Modified Conjugate Quantum Natural Gradient (CQNG), an optimization algorithm that integrates QNG with principles from the nonlinear conjugate-gradient method. Unlike QNG, which employs a fixed learning rate, CQNG dynamically adjusts its hyperparameters at each step, enhancing both efficiency and flexibility. Numerical simulations show that CQNG achieves faster convergence and reduces quantum-resource requirements compared to QNG across various optimization scenarios, even when strict conjugacy conditions are not fully satisfied—hence the term “Modified Conjugate.” These results highlight CQNG as a promising optimization technique for improving the performance of VQAs.
Variational quantum algorithms (VQAs) combining the advantages of parameterized quantum circuits and classical optimizers, promise practical quantum applications in the noisy intermediate-scale quantum era. The performance of VQAs heavily depends on the optimization method. Compared with gradient-free and ordinary gradient descent methods, the quantum natural gradient (QNG), which mirrors the geometric structure of the parameter space, can achieve faster convergence and avoid local minima more easily, thereby reducing the cost of circuit executions. We utilized a fully programmable photonic chip to experimentally estimate the QNG in photonics for the first time, to the best of our knowledge. We obtained the dissociation curve of the He-H + cation and achieved chemical accuracy, verifying the outperformance of QNG optimization on a photonic device. Our work opens up a vista of utilizing QNG in photonics to implement practical near-term quantum applications.
The natural gradient descent optimisation technique is an efficient optimising protocol for broad classes of classical and quantum systems that takes the underlying geometry of the parameter manifold into account by means of using either the Fisher information metric of the classical probability distribution function or the Fubini-Study tensor of the associated parametrised quantum states in the consequent update rules. Even though the natural gradient descent procedure utilises the geometry of the space of probability or states, it is, however, insensitive to the measure of parametrised distance on the space of possible outcomes when the corresponding optimising problem is considered for the expectation value of a classical or quantum observable with respect to the probability distribution or the quantum state. In this work, we introduce a generic optimising principle, where the intrinsic geometry of the space of outcomes has been taken into account suitably, either by using an ambient space construction with a base statistical manifold with the usual Fisher information metric (or the Fubini-Study tensor), where the loss hypersurface is embedded to, or by means of a first-principle construction from the overlap of nearby quantum states on the projective Hilbert space. This construction as well as a family of conformal variants yields a form of loss-aware natural gradient updates that rescale the effective step size while preserving the descent direction. We benchmark the resulting optimisers on variational quantum circuit examples and on a classical neural network task, finding that, while the standard natural gradient remains the most robust on average, the proposed conformal schemes can improve best-case convergence in favourable regimes.