arXiv:1909.02108 · Quantum

Quantum Natural Gradient

JAMES M. STOKES, Josh Izaac, Nathan Killoran, Giuseppe Carleo

Published May 25, 2020• 473 citations

Abstract

A quantum generalization of Natural Gradient Descent is presented as part of a general-purpose optimization framework for variational quantum circuits. The optimization dynamics is interpreted as moving in the steepest descent direction with respect to the Quantum Information Geometry, corresponding to the real part of the Quantum Geometric Tensor (QGT), also known as the Fubini-Study metric tensor. An efficient algorithm is presented for computing a block-diagonal approximation to the Fubini-Study metric tensor for parametrized quantum circuits, which may be of independent interest.

DOI: 10.22331/q-2020-05-25-269

Related papers

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.14511Nov 19, 20250 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.05627Journal of Physics A Mathematical and TheoreticalApr 8, 20260 citations

Quantum natural gradient generalized to noisy and nonunitary circuits

Bálint Koczor, Simon C. Benjamin

Variational quantum algorithms are promising tools whose efficacy depends on their optimization method. For noise-free unitary circuits, the quantum generalization of natural gradient descent has been introduced and shown to be equivalent to imaginary time evolution: the approach is effective due to a metric tensor reconciling the classical parameter space to the device's Hilbert space. Here we generalize quantum natural gradient to consider arbitrary quantum states (both mixed and pure) via completely positive maps; thus our circuits can incorporate both imperfect unitary gates and fundamentally nonunitary operations such as measurements. We employ the quantum Fisher information (QFI) as the core metric in the space of density operators. A modification of the error suppression by derangements (ESD) and virtual distillation (VD) techniques enables an accurate and experimentally efficient approximation of the QFI via the Hilbert-Schmidt metric tensor using prior results on the dominant eigenvector of noisy quantum states. Our rigorous proof also establishes the fundamental observation that the geometry of typical noisy quantum states is (approximately) identical in either the Hilbert-Schmidt metric or as characterized by the QFI. In numerical simulations of noisy quantum circuits we demonstrate the practicality of our approach and confirm it can significantly outperform other variational techniques.

arXiv:1912.08660Physical Review ADec 14, 202250 citations

Quantum Natural Gradient with Geodesic Corrections for Small Shallow Quantum Circuits

Mourad Halla

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.03638Sep 5, 20240 citations

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.

Physica ScriptaApr 24, 20254 citations

Quantum Natural Gradient with Geodesic Corrections for Small Shallow Quantum Circuits

Halla, Mourad

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.

Jan 1, 20250 citations