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

arXiv:2505.14670 · Communications in computer and information science

Quantum Optimization via Gradient-Based Hamiltonian Descent

Jiaqi Leng, Bin Shi

Published Jan 1, 2026• 1 citation
arXivHTMLPDF
DOI
10.1007/978-981-95-7829-0_14

Related papers

Stochastic Gradient Descent for Hybrid Quantum-Classical Optimization

Frederik Wilde, Ryan Sweke, Johannes Jakob Meyer +4 more

Bulletin of the American Physical Society•Mar 2, 2020•7 citations

Code and Data Repository for QHDOPT: A Software for Nonlinear Optimization with Quantum Hamiltonian Descent

Samuel Kushnir, Jiaqi Leng, Yuxiang Peng +2 more

QHDOPT implements a quantum optimization algorithm named Quantum Hamiltonian Descent (QHD) on available quantum computers (such as the D-Wave systems). QHD is a quantum-upgraded version of gradient descent (GD). Unlike the classical GD, QHD demonstrates a significant advantage in solving nonconvex and nonlinear optimization problems.

INFORMS journal on computing•Nov 25, 2024•1 citation

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•Nov 19, 2025•0 citations

Towards practical quantum optimization

András Czégel

•Sep 18, 2026•0 citations

First Steps towards Hybrid Quantum-Classical Optimization

Dapeng Wang

•Jan 1, 2020•0 citations

Weighted approximate quantum natural gradient for variational quantum eigensolver

Chenyu Shi, Vedran Dunjko, Hao Wang

Abstract The variational quantum eigensolver (VQE) is one of the most prominent algorithms using near-term quantum devices, designed to find the ground state of a Hamiltonian. In VQE, a classical optimizer iteratively updates the parameters in the quantum circuit. Among various optimization methods, the quantum natural gradient descent (QNG) stands out as a promising optimization approach for VQE. However, standard QNG only leverages the quantum Fisher information of the entire system and treats each subsystem equally in the optimization process, without accounting for the different weights and contributions of each subsystem corresponding to each local term in the Hamiltonian. To address this limitation, we propose a Weighted Approximate QNG (WA-QNG) method tailored for k -local Hamiltonians. In this paper, we theoretically analyze the potential advantages of WA-QNG compared to QNG from three distinct perspectives and reveal its connection with the Gauss–Newton method. We also show it outperforms the standard QNG descent in the numerical simulations for seeking the ground state of the Hamiltonian.

arXiv:2504.04932•Quantum Science and Technology•Jan 30, 2026•1 citation
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 variational quantum eigensolver (VQE) is one of the most prominent algorithms using near-term quantum devices, designed to find the ground state of a Hamiltonian. In VQE, a classical optimizer iteratively updates the parameters in the quantum circuit. Among various optimization methods, the quantum natural gradient descent (QNG) stands out as a promising optimization approach for VQE. However, standard QNG only leverages the quantum Fisher information of the entire system and treats each subsystem equally in the optimization process, without accounting for the different weights and contributions of each subsystem corresponding to each local term in the Hamiltonian. To address this limitation, we propose a Weighted Approximate QNG (WA-QNG) method tailored for k -local Hamiltonians. In this paper, we theoretically analyze the potential advantages of WA-QNG compared to QNG from three distinct perspectives and reveal its connection with the Gauss–Newton method. We also show it outperforms the standard QNG descent in the numerical simulations for seeking the ground state of the Hamiltonian.