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

Lecture notes in computer science

Quantum Hamiltonian Descent for Rigid Image Registration

Johannes David Voigts, Natacha Kuete Meli, Jan Lellmann

Published Aug 2, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-31452-9_10

Related papers

Quantum implementation of image registration

Kehan Chen, Zhe Ren, Fei Yan +1 more

Quantum Information Processing•Jan 31, 2023•4 citations

Quantum Optimization via Gradient-Based Hamiltonian Descent

Jiaqi Leng, Bin Shi

arXiv:2505.14670•Communications in computer and information science•Jan 1, 2026•7 citations

Hybrid Quantum-Classical Optimization Framework for Satellite Image Registration

Indranil Misra, S. Manthira Moorthi, Debajyoti Dhar

Remote Sensing Applications Society and Environment•Nov 1, 2026•0 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•2 citations

Quantum Hamiltonian Descent Based Augmented Lagrangian Method for Constrained Nonconvex Nonlinear Optimization

Mingze Li, Lei Fan, Zhu Han

Nonlinear programming (NLP) plays a critical role in domains such as power energy systems, chemical engineering, communication networks, and financial engineering. However, solving large-scale, nonconvex NLP problems remains a significant challenge due to the complexity of the solution landscape and the presence of nonlinear nonconvex constraints. In this paper, we develop a Quantum Hamiltonian Descent based Augmented Lagrange Method (QHD-ALM) framework to address largescale, constrained nonconvex NLP problems. The augmented Lagrange method (ALM) can convert a constrained NLP to an unconstrained NLP, which can be solved by using Quantum Hamiltonian Descent (QHD). To run the QHD on a classical machine, we propose to use the Simulated Bifurcation algorithm as the engine to simulate the dynamic process. We apply our algorithm to a Power-to-Hydrogen System, and the simulation results verify the effectiveness of our algorithm.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Quantum Riemannian Hamiltonian Descent

Yoshihiko Abe, Ryo Nagai

We propose Quantum Riemannian Hamiltonian Descent (QRHD), a quantum algorithm for continuous optimization on Riemannian manifolds that extends Quantum Hamiltonian Descent (QHD) by incorporating geometric structure of the parameter space via a position-dependent metric in the kinetic term. We formulate QRHD in both operator and path integral formalisms and derive the corresponding quantum equations of motion, showing that quantum corrections appear in the action integral but they are suppressed at late times by the time-dependent dissipation factor. This implies that convergence near optimal points is controlled by the classical potential while quantum effects influence early-time dynamics. By analyzing the semiclassical equation, we estimate a lower bound on the convergence time and numerically demonstrate whether QRHD works as a quantum optimization algorithm in some examples. A quantum circuit implementation based on time-dependent Hamiltonian simulation is also discussed and the query complexity is estimated.

quant-pharXiv:2603.28624•Physical Review A•Mar 31, 2026•1 citation
Nonlinear programming (NLP) plays a critical role in domains such as power energy systems, chemical engineering, communication networks, and financial engineering. However, solving large-scale, nonconvex NLP problems remains a significant challenge due to the complexity of the solution landscape and the presence of nonlinear nonconvex constraints. In this paper, we develop a Quantum Hamiltonian Descent based Augmented Lagrange Method (QHD-ALM) framework to address largescale, constrained nonconvex NLP problems. The augmented Lagrange method (ALM) can convert a constrained NLP to an unconstrained NLP, which can be solved by using Quantum Hamiltonian Descent (QHD). To run the QHD on a classical machine, we propose to use the Simulated Bifurcation algorithm as the engine to simulate the dynamic process. We apply our algorithm to a Power-to-Hydrogen System, and the simulation results verify the effectiveness of our algorithm.
We propose Quantum Riemannian Hamiltonian Descent (QRHD), a quantum algorithm for continuous optimization on Riemannian manifolds that extends Quantum Hamiltonian Descent (QHD) by incorporating geometric structure of the parameter space via a position-dependent metric in the kinetic term. We formulate QRHD in both operator and path integral formalisms and derive the corresponding quantum equations of motion, showing that quantum corrections appear in the action integral but they are suppressed at late times by the time-dependent dissipation factor. This implies that convergence near optimal points is controlled by the classical potential while quantum effects influence early-time dynamics. By analyzing the semiclassical equation, we estimate a lower bound on the convergence time and numerically demonstrate whether QRHD works as a quantum optimization algorithm in some examples. A quantum circuit implementation based on time-dependent Hamiltonian simulation is also discussed and the query complexity is estimated.