{"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-optimization-via-gradient-based","title":"Quantum Optimization via Gradient-Based Hamiltonian Descent","arxiv_id":"2505.14670","date":"2025-05-20","proceeding":null,"authors":["Jiaqi Leng","Bin Shi"],"abstract":"With rapid advancements in machine learning, first-order algorithms have emerged as the backbone of modern optimization techniques, owing to their computational efficiency and low memory requirements. Recently, the connection between accelerated gradient methods and damped heavy-ball motion, particularly within the framework of Hamiltonian dynamics, has inspired the development of innovative quantum algorithms for continuous optimization. One such algorithm, Quantum Hamiltonian Descent (QHD), leverages quantum tunneling to escape saddle points and local minima, facilitating the discovery of global solutions in complex optimization landscapes. However, QHD faces several challenges, including slower convergence rates compared to classical gradient methods and limited robustness in highly non-convex problems due to the non-local nature of quantum states. Furthermore, the original QHD formulation primarily relies on function value information, which limits its effectiveness. Inspired by insights from high-resolution differential equations that have elucidated the acceleration mechanisms in classical methods, we propose an enhancement to QHD by incorporating gradient information, leading to what we call gradient-based QHD. Gradient-based QHD achieves faster convergence and significantly increases the likelihood of identifying global solutions. Numerical simulations on challenging problem instances demonstrate that gradient-based QHD outperforms existing quantum and classical methods by at least an order of magnitude.","url_abs":"https://arxiv.org/abs/2505.14670v1","url_pdf":"https://arxiv.org/pdf/2505.14670v1.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-optimization-via-gradient-based","repo_url":"https://github.com/jiaqileng/gradient-based-qhd","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2505.14670","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.14670"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+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/gradient-based-qhd","reach":null}],"summary":{"ran":1,"ran_honours":9},"by_repo_kind":{"official":{"samples":10,"ran":10,"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":10,"samples":[{"code_sha256_prefix":"514f76f755de301c","entry":"GradBasedQHD","repo":"jiaqileng/gradient-based-qhd","repo_kind":"official","path":"GradBasedQHD.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/GradBasedQHD.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"514f76f755de301c"}},{"code_sha256_prefix":"e0fae74ccb4f4247","entry":"df_dx","repo":"jiaqileng/gradient-based-qhd","repo_kind":"official","path":"styblinski_tang.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/styblinski_tang.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"e0fae74ccb4f4247"}},{"code_sha256_prefix":"b18386e2682fe4e3","entry":"df_dy","repo":"jiaqileng/gradient-based-qhd","repo_kind":"official","path":"styblinski_tang.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/styblinski_tang.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"b18386e2682fe4e3"}},{"code_sha256_prefix":"b2d3c712638ccc70","entry":"du_dx","repo":"jiaqileng/gradient-based-qhd","repo_kind":"official","path":"convex_optim.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/convex_optim.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"b2d3c712638ccc70"}},{"code_sha256_prefix":"7355dae320db2d0e","entry":"du_dx","repo":"jiaqileng/gradient-based-qhd","repo_kind":"official","path":"nonconvex_optim.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/nonconvex_optim.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7355dae320db2d0e"}},{"code_sha256_prefix":"cee40acf917efacb","entry":"du_dy","repo":"jiaqileng/gradient-based-qhd","repo_kind":"official","path":"nonconvex_optim.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/nonconvex_optim.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"cee40acf917efacb"}},{"code_sha256_prefix":"023285e9cc65d37e","entry":"du_dy","repo":"jiaqileng/gradient-based-qhd","repo_kind":"official","path":"convex_optim.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/convex_optim.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"023285e9cc65d37e"}},{"code_sha256_prefix":"79551e8e8ab3e337","entry":"f","repo":"jiaqileng/gradient-based-qhd","repo_kind":"official","path":"convex_optim.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/convex_optim.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"79551e8e8ab3e337"}},{"code_sha256_prefix":"cf69a4ee90924580","entry":"f","repo":"jiaqileng/gradient-based-qhd","repo_kind":"official","path":"styblinski_tang.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/styblinski_tang.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"cf69a4ee90924580"}},{"code_sha256_prefix":"7e5517769dd75a5c","entry":"f","repo":"jiaqileng/gradient-based-qhd","repo_kind":"official","path":"nonconvex_optim.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/nonconvex_optim.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7e5517769dd75a5c"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}