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:2610.31170

Quantum Constrained Hamiltonian Descent

Yoshihiko Abe, Ryo Nagai

quant-phhep-thSubmitted Oct 22, 2026• Announced Oct 23, 2026• 0 citations
arXivHTMLPDF

Abstract

We propose Quantum Constrained Hamiltonian Descent (QCHD), a continuous-time quantum framework for optimization under smooth equality constraints. The unconstrained counterpart, Quantum Hamiltonian Descent (QHD), minimizes a cost function by simulating the Schrödinger dynamics of a particle in the potential given by the cost function. Applying Dirac's formalism to the classical dynamics with constraints, we construct an intrinsic quantum Hamiltonian with a Laplace--Beltrami operator on the constraint manifold in a kinetic term. Its evolution preserves the constraints exactly without penalty terms and is expected to solve quantum-dynamically the constrained optimization problem. We analyze its relation to Quantum Hamiltonian Descent supplemented by a strong penalty term. For a squared-distance penalty, the effective tangential dynamics acquires an extrinsic-curvature potential and, in nontrivial normal-rotation sectors, a coupling to the normal-bundle connection. These embedding-dependent terms remain in the strong-penalty limit, generally yielding quantum dynamics different from QCHD. Numerical comparisons for circular, elliptical, and two simultaneous constraints show faster optimization and improved concentration near global minima for the initial states and finite penalty strengths considered.

AI Summary

The paper asks how Quantum Hamiltonian Descent (QHD) can handle smooth equality constraints without penalty terms, and whether strong-penalty QHD reproduces intrinsic constrained dynamics. Using Dirac’s constrained-mechanics formalism and an explicit quantization choice, it defines Quantum Constrained Hamiltonian Descent (QCHD) on the feasible manifold $\mathcal M$, with Hamiltonian $H(t)=-\Delta_{\mathcal M}/[2ma(t)]+a(t)V|_{\mathcal M}$. Constraints hold exactly for states initially defined on $\mathcal M$. In local coordinates, this is the previously introduced Quantum Riemannian Hamiltonian Descent. A tubular-coordinate expansion of QHD with a squared-distance penalty gives an effective tangential Hamiltonian containing an extrinsic-curvature potential and, in nontrivial normal-rotation sectors, a normal-bundle connection. These terms survive as $\kappa\to\infty$; the stated remainder is $O(\kappa^{-1/2})$ in fixed-level matrix elements under confinement and adiabatic-normal-motion assumptions. For penalties $\kappa\sum_A(f^A)^2$, position-dependent normal zero-point energies can additionally generate potentials growing as $\sqrt\kappa$, making dynamics depend on the constraint representation. Classical Schrödinger-equation simulations compare four low-dimensional examples at $\kappa=1,2,5,10$. QCHD reaches selected projected-cost thresholds 1.9–4.6 times sooner; in a circular Ackley example, failure probability at $t=8$ is $0.002$, versus $0.56$–$0.84$ for penalty QHD. These comparisons use specified initial states and schedules outside the thin-confinement regime of the effective analysis. No general convergence or quantum-speedup guarantee is established. Efficient feasible-state preparation, circuit implementation and resource estimates remain open; broader numerical tests and comparisons with classical Riemannian optimization are deferred.

Little sign of AI-generated textIncrementalMissing comparisonStrong assumptions

Error found: The general-penalty effective Hamiltonian in Eq. (H_eff-f2) omits generally nonzero O(κ^0) Born–Huang and anharmonic corrections while claiming an O(κ^−1/2) remainder. The Conclusions incorrectly assert that gradient normalization leaves the position-dependent O(√κ) normal-energy potential intact, although normalization removes that variation and can leave distinct O(κ^0) corrections.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
52 pages, 8 figures, 4 tables

Related papers

Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent

Zeguan Wu, Mingze Li, Muqing Zheng +6 more

Quantum Hamiltonian Descent (QHD) is a continuous optimization algorithm based on simulating a time-dependent quantum Hamiltonian whose potential energy encodes the objective function and whose kinetic energy promotes exploration through quantum interference and tunneling. While QHD is formulated for unconstrained optimization, many real-world optimization problems are constrained and highly nonconvex. In this paper, we benchmark AL-QHD, a hybrid framework that embeds QHD within the Augmented Lagrangian Method (ALM), thereby solving a sequence of unconstrained subproblems while using ALM to enforce constraints. We evaluate AL-QHD on standard nonconvex test functions and use iterative refinement to improve solution accuracy at fixed per-run qubit cost. We also perform a gate-based resource analysis on ACOPF-derived power system subproblems constructed from power-network data to estimate the quantum-computer scale required for practical applications. Resource estimates on Texas7k-derived ACOPF instances show steep hard-gate scaling, reaching $\sim 4.46 \times 10^7$ entangling gates in a NISQ-oriented model and $\sim 9.42 \times 10^8$ T gates in a fault-tolerant model at $\sim 5.3 \times 10^2$ active variables. These results suggest that AL-QHD is a useful framework for studying constrained nonconvex optimization with QHD, but that practical ACOPF-scale applications would likely require large-scale fault-tolerant quantum hardware.

quant-pharXiv:2605.12066•May 13, 2026•2 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

Quantum Hamiltonian Descent

Leng, Jiaqi, Ethan Hickman, Joseph Li +1 more

Gradient descent is a fundamental algorithm in both theory and practice for continuous optimization. Identifying its quantum counterpart would be appealing to both theoretical and practical quantum applications. A conventional approach to quantum speedups in optimization relies on the quantum acceleration of intermediate steps of classical algorithms, while keeping the overall algorithmic trajectory and solution quality unchanged. We propose Quantum Hamiltonian Descent (QHD), which is derived from the path integral of dynamical systems referring to the continuous-time limit of classical gradient descent algorithms, as a truly quantum counterpart of classical gradient methods where the contribution from classically-prohibited trajectories can significantly boost QHD's performance for non-convex optimization. Moreover, QHD is described as a Hamiltonian evolution efficiently simulatable on both digital and analog quantum computers. By embedding the dynamics of QHD into the evolution of the so-called Quantum Ising Machine (including D-Wave and others), we empirically observe that the D-Wave-implemented QHD outperforms a selection of state-of-the-art gradient-based classical solvers and the standard quantum adiabatic algorithm, based on the time-to-solution metric, on non-convex constrained quadratic programming instances up to 75 dimensions. Finally, we propose a "three-phase picture" to explain the behavior of QHD, especially its difference from the quantum adiabatic algorithm.

arXiv:2303.01471•Mar 2, 2023•66 citations

Quantum Hamiltonian Descent for Non-smooth Optimization

Jiaqi Leng, Yufan Zheng, Jia, Zhiyuan +4 more

Non-smooth optimization models play a fundamental role in various disciplines, including engineering, science, management, and finance. However, classical algorithms for solving such models often struggle with convergence speed, scalability, and parameter tuning, particularly in high-dimensional and non-convex settings. In this paper, we explore how quantum mechanics can be leveraged to overcome these limitations. Specifically, we investigate the theoretical properties of the Quantum Hamiltonian Descent (QHD) algorithm for non-smooth optimization in both continuous and discrete time. First, we propose continuous-time variants of the general QHD algorithm and establish their global convergence and convergence rate for non-smooth convex and strongly convex problems through a novel Lyapunov function design. Furthermore, we prove the finite-time global convergence of continuous-time QHD for non-smooth non-convex problems under mild conditions (i.e., locally Lipschitz). In addition, we propose discrete-time QHD, a fully digitized implementation of QHD via operator splitting (i.e., product formula). We find that discrete-time QHD exhibits similar convergence properties even with large time steps. Finally, numerical experiments validate our theoretical findings and demonstrate the computational advantages of QHD over classical non-smooth non-convex optimization algorithms.

arXiv:2503.15878•Mar 20, 2025•13 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

On Speedups for Convex Optimization via Quantum Dynamics

Shouvanik Chakrabarti, Dylan Herman, Watkins, Jacob +4 more

This work investigates the possibility of quantum speedups for continuous optimization through quantum Hamiltonian simulation. We establish the first rigorous query complexity bounds for unconstrained convex optimization via digital quantum annealing, based on the non-adiabatic Quantum Hamiltonian Descent (QHD) framework. In the process, we derive rigorous resource estimates for digital quantum simulation of Schrödinger operators depending only on input simulation parameters, given black-box evaluation access to separable, Lipschitz continuous potential b(t) f(x). We apply these simulation bounds to assess the complexity of high-dimensional convex optimization. Our annealing schedule achieves arbitrarily fast convergence rates in the evolution time, with computational time determined solely by the cost of discretization. We show that a G-Lipschitz convex function can be optimized to an error of ε with 𝒪̃(d^{1.5} G² R²/ε²) queries, given a starting point that is Euclidean distance R from optimal. Under reasonable assumptions such as the complexity of simulating Schrödinger operators, we show that Ω̃(d/ε²) queries are necessary. This suggests QHD does not offer improvements over classical methods in the noiseless zeroth order setting. However, we show that the QHD algorithm can tolerate 𝒪̃(ε³ /d^{1.5} G² R²) noise in function evaluation, and as a result, provides a super-quadratic query advantage over the best existing noise-tolerant classical algorithms in the high-dimensional setting. We leverage this to design a quantum algorithm for stochastic convex optimization that offers a super-quadratic speedup over all known classical and quantum algorithms in this regime. To our knowledge, these results represent the first rigorous quantum speedups for convex optimization obtained through a dynamical algorithm.

arXiv:2503.24332•Leibniz international proceedings in informatics•Mar 31, 2025•14 citations
We propose Quantum Constrained Hamiltonian Descent (QCHD), a continuous-time quantum framework for optimization under smooth equality constraints. The unconstrained counterpart, Quantum Hamiltonian Descent (QHD), minimizes a cost function by simulating the Schrödinger dynamics of a particle in the potential given by the cost function. Applying Dirac's formalism to the classical dynamics with constraints, we construct an intrinsic quantum Hamiltonian with a Laplace--Beltrami operator on the constraint manifold in a kinetic term. Its evolution preserves the constraints exactly without penalty terms and is expected to solve quantum-dynamically the constrained optimization problem. We analyze its relation to Quantum Hamiltonian Descent supplemented by a strong penalty term. For a squared-distance penalty, the effective tangential dynamics acquires an extrinsic-curvature potential and, in nontrivial normal-rotation sectors, a coupling to the normal-bundle connection. These embedding-dependent terms remain in the strong-penalty limit, generally yielding quantum dynamics different from QCHD. Numerical comparisons for circular, elliptical, and two simultaneous constraints show faster optimization and improved concentration near global minima for the initial states and finite penalty strengths considered.
The paper asks how Quantum Hamiltonian Descent (QHD) can handle smooth equality constraints without penalty terms, and whether strong-penalty QHD reproduces intrinsic constrained dynamics. Using Dirac’s constrained-mechanics formalism and an explicit quantization choice, it defines Quantum Constrained Hamiltonian Descent (QCHD) on the feasible manifold M\mathcal MM, with Hamiltonian H(t)=−ΔM/[2ma(t)]+a(t)V∣MH(t)=-\Delta_{\mathcal M}/[2ma(t)]+a(t)V|_{\mathcal M}H(t)=−ΔM​/[2ma(t)]+a(t)V∣M​. Constraints hold exactly for states initially defined on M\mathcal MM. In local coordinates, this is the previously introduced Quantum Riemannian Hamiltonian Descent.
A tubular-coordinate expansion of QHD with a squared-distance penalty gives an effective tangential Hamiltonian containing an extrinsic-curvature potential and, in nontrivial normal-rotation sectors, a normal-bundle connection. These terms survive as κ→∞\kappa\to\inftyκ→∞; the stated remainder is O(κ−1/2)O(\kappa^{-1/2})O(κ−1/2) in fixed-level matrix elements under confinement and adiabatic-normal-motion assumptions. For penalties κ∑A(fA)2\kappa\sum_A(f^A)^2κ∑A​(fA)2, position-dependent normal zero-point energies can additionally generate potentials growing as κ\sqrt\kappaκ​, making dynamics depend on the constraint representation.
Classical Schrödinger-equation simulations compare four low-dimensional examples at κ=1,2,5,10\kappa=1,2,5,10κ=1,2,5,10. QCHD reaches selected projected-cost thresholds 1.9–4.6 times sooner; in a circular Ackley example, failure probability at t=8t=8t=8 is 0.0020.0020.002, versus 0.560.560.56–0.840.840.84 for penalty QHD. These comparisons use specified initial states and schedules outside the thin-confinement regime of the effective analysis. No general convergence or quantum-speedup guarantee is established. Efficient feasible-state preparation, circuit implementation and resource estimates remain open; broader numerical tests and comparisons with classical Riemannian optimization are deferred.
Quantum Hamiltonian Descent (QHD) is a continuous optimization algorithm based on simulating a time-dependent quantum Hamiltonian whose potential energy encodes the objective function and whose kinetic energy promotes exploration through quantum interference and tunneling. While QHD is formulated for unconstrained optimization, many real-world optimization problems are constrained and highly nonconvex. In this paper, we benchmark AL-QHD, a hybrid framework that embeds QHD within the Augmented Lagrangian Method (ALM), thereby solving a sequence of unconstrained subproblems while using ALM to enforce constraints. We evaluate AL-QHD on standard nonconvex test functions and use iterative refinement to improve solution accuracy at fixed per-run qubit cost. We also perform a gate-based resource analysis on ACOPF-derived power system subproblems constructed from power-network data to estimate the quantum-computer scale required for practical applications. Resource estimates on Texas7k-derived ACOPF instances show steep hard-gate scaling, reaching ∼4.46×107\sim 4.46 \times 10^7∼4.46×107 entangling gates in a NISQ-oriented model and ∼9.42×108\sim 9.42 \times 10^8∼9.42×108 T gates in a fault-tolerant model at ∼5.3×102\sim 5.3 \times 10^2∼5.3×102 active variables. These results suggest that AL-QHD is a useful framework for studying constrained nonconvex optimization with QHD, but that practical ACOPF-scale applications would likely require large-scale fault-tolerant quantum hardware.
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.
Gradient descent is a fundamental algorithm in both theory and practice for continuous optimization. Identifying its quantum counterpart would be appealing to both theoretical and practical quantum applications. A conventional approach to quantum speedups in optimization relies on the quantum acceleration of intermediate steps of classical algorithms, while keeping the overall algorithmic trajectory and solution quality unchanged. We propose Quantum Hamiltonian Descent (QHD), which is derived from the path integral of dynamical systems referring to the continuous-time limit of classical gradient descent algorithms, as a truly quantum counterpart of classical gradient methods where the contribution from classically-prohibited trajectories can significantly boost QHD's performance for non-convex optimization. Moreover, QHD is described as a Hamiltonian evolution efficiently simulatable on both digital and analog quantum computers. By embedding the dynamics of QHD into the evolution of the so-called Quantum Ising Machine (including D-Wave and others), we empirically observe that the D-Wave-implemented QHD outperforms a selection of state-of-the-art gradient-based classical solvers and the standard quantum adiabatic algorithm, based on the time-to-solution metric, on non-convex constrained quadratic programming instances up to 75 dimensions. Finally, we propose a "three-phase picture" to explain the behavior of QHD, especially its difference from the quantum adiabatic algorithm.
Non-smooth optimization models play a fundamental role in various disciplines, including engineering, science, management, and finance. However, classical algorithms for solving such models often struggle with convergence speed, scalability, and parameter tuning, particularly in high-dimensional and non-convex settings. In this paper, we explore how quantum mechanics can be leveraged to overcome these limitations. Specifically, we investigate the theoretical properties of the Quantum Hamiltonian Descent (QHD) algorithm for non-smooth optimization in both continuous and discrete time. First, we propose continuous-time variants of the general QHD algorithm and establish their global convergence and convergence rate for non-smooth convex and strongly convex problems through a novel Lyapunov function design. Furthermore, we prove the finite-time global convergence of continuous-time QHD for non-smooth non-convex problems under mild conditions (i.e., locally Lipschitz). In addition, we propose discrete-time QHD, a fully digitized implementation of QHD via operator splitting (i.e., product formula). We find that discrete-time QHD exhibits similar convergence properties even with large time steps. Finally, numerical experiments validate our theoretical findings and demonstrate the computational advantages of QHD over classical non-smooth non-convex optimization algorithms.
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.
This work investigates the possibility of quantum speedups for continuous optimization through quantum Hamiltonian simulation. We establish the first rigorous query complexity bounds for unconstrained convex optimization via digital quantum annealing, based on the non-adiabatic Quantum Hamiltonian Descent (QHD) framework. In the process, we derive rigorous resource estimates for digital quantum simulation of Schrödinger operators depending only on input simulation parameters, given black-box evaluation access to separable, Lipschitz continuous potential b(t) f(x). We apply these simulation bounds to assess the complexity of high-dimensional convex optimization. Our annealing schedule achieves arbitrarily fast convergence rates in the evolution time, with computational time determined solely by the cost of discretization. We show that a G-Lipschitz convex function can be optimized to an error of ε with 𝒪̃(d^{1.5} G² R²/ε²) queries, given a starting point that is Euclidean distance R from optimal. Under reasonable assumptions such as the complexity of simulating Schrödinger operators, we show that Ω̃(d/ε²) queries are necessary. This suggests QHD does not offer improvements over classical methods in the noiseless zeroth order setting. However, we show that the QHD algorithm can tolerate 𝒪̃(ε³ /d^{1.5} G² R²) noise in function evaluation, and as a result, provides a super-quadratic query advantage over the best existing noise-tolerant classical algorithms in the high-dimensional setting. We leverage this to design a quantum algorithm for stochastic convex optimization that offers a super-quadratic speedup over all known classical and quantum algorithms in this regime. To our knowledge, these results represent the first rigorous quantum speedups for convex optimization obtained through a dynamical algorithm.