Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent
Zeguan Wu, Mingze Li, Muqing Zheng, Meng Wang, Junyu Liu, Samuel Stein, Ang Li, Yousu Chen, Chenxu Liu

TL;DR
This paper evaluates AL-QHD, a hybrid quantum-classical optimization framework combining Quantum Hamiltonian Descent with Augmented Lagrangian Method, analyzing its performance and resource requirements for constrained nonconvex problems.
Contribution
It introduces AL-QHD for constrained optimization, benchmarks its performance on test functions, and estimates quantum resource needs for practical power system applications.
Findings
AL-QHD effectively solves nonconvex constrained problems in tests.
Iterative refinement improves solution accuracy at fixed qubit cost.
Resource analysis indicates large-scale fault-tolerant quantum hardware is needed for practical ACOPF applications.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
