{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/quantum-hamiltonian-descent","title":"Quantum Hamiltonian Descent","arxiv_id":"2303.01471","date":"2023-03-02","proceeding":null,"authors":["Jiaqi Leng","Ethan Hickman","Joseph Li","Xiaodi Wu"],"abstract":"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.","url_abs":"https://arxiv.org/abs/2303.01471v1","url_pdf":"https://arxiv.org/pdf/2303.01471v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"quantum-hamiltonian-descent","repo_url":"https://github.com/jiaqileng/quantum-hamiltonian-descent","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2303.01471","atlas_url":"https://app.syntology.ai/?focus=2303.01471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.01471"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jiaqileng/quantum-hamiltonian-descent","reach":null}],"summary":{"ran_fixture":1,"unverified":1},"by_repo_kind":{"official":{"samples":2,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"samples":[{"code_sha256_prefix":"4ebbb94bdcce2731","entry":"get_sample","repo":"jiaqileng/quantum-hamiltonian-descent","repo_kind":"official","path":"plot/fig2/NonCVX2d_evolution.py","file_url":"https://github.com/jiaqileng/quantum-hamiltonian-descent/blob/HEAD/plot/fig2/NonCVX2d_evolution.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"4ebbb94bdcce2731"}},{"code_sha256_prefix":"ca5eb80adfeec93f","entry":"post_processing_qhd","repo":"jiaqileng/quantum-hamiltonian-descent","repo_kind":"official","path":"QP/experiments/quantum/qhd_post_processing.py","file_url":"https://github.com/jiaqileng/quantum-hamiltonian-descent/blob/HEAD/QP/experiments/quantum/qhd_post_processing.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"ca5eb80adfeec93f"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}