Efficient Hamiltonian-aware Quantum Natural Gradient Descent for Variational Quantum Eigensolvers
Chenyu Shi, Hao Wang
TL;DR
This work targets optimizer efficiency in Variational Quantum Eigensolvers by introducing Hamiltonian-aware Quantum Natural Gradient Descent (H-QNG), a pullback-metric optimizer defined on the subspace spanned by the Hamiltonian terms. The metric G used by H-QNG is constructed as $G_{ij}=\sum_{r=1}^v a_r^2\mathrm{tr}(\partial_i\rho_{\theta}P_r)\mathrm{tr}(\partial_j\rho_{\theta}P_r)$ with a scaling $T_{ij}=\frac{1}{2\sqrt{\sum_r a_r^2}}G_{ij}$, yielding an update $\theta^{(k+1)}=\theta^{(k)}-\eta T^{-1}\nabla f(\theta^{(k)})$. This approach reduces the quantum measurement overhead to $O(mv)$ per step—the same as vanilla gradient descent—while retaining the reparameterization-invariance of QNG and leveraging the Hamiltonian’s structure to potentially accelerate convergence. The paper provides scaling, reparameterization-invariance, and singularity analyses, and validates the method on molecular Hamiltonians (e.g., LiH and H6), where H-QNG achieves chemical accuracy faster and with fewer quantum resources than standard QNG. It also discusses robustness to shot noise and outlines avenues for extending the framework to mixed states and other variational quantum algorithms.
Abstract
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.
