{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KPATBZFJOG7DIIP5XHXMJJLPTT","short_pith_number":"pith:KPATBZFJ","schema_version":"1.0","canonical_sha256":"53c130e4a971be3421fdb9eec4a56f9cfa8311675d2e1498d23d374c42c43e4b","source":{"kind":"arxiv","id":"2303.01471","version":1},"attestation_state":"computed","paper":{"title":"Quantum Hamiltonian Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Ethan Hickman, Jiaqi Leng, Joseph Li, Xiaodi Wu","submitted_at":"2023-03-02T18:34:38Z","abstract_excerpt":"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 gradie"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2303.01471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-03-02T18:34:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"eba10260b3c5117f444dc6b3cd9b8fb7438533e3d6c6e3b6c454723ed2e9e24b","abstract_canon_sha256":"c3776dc1ce685104c801060aa10368215777ec87ce603871dd20aac7cd81dcf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:31.343748Z","signature_b64":"dvohA6qGkRs7s5eX3ANs3xSUVis6Nrpw2oHStvNeLSR/XLcsfyBjeLuPeiXr7B31nkwUV0y4zUGrVJD+M8tjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53c130e4a971be3421fdb9eec4a56f9cfa8311675d2e1498d23d374c42c43e4b","last_reissued_at":"2026-07-05T05:47:31.343304Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:31.343304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Hamiltonian Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Ethan Hickman, Jiaqi Leng, Joseph Li, Xiaodi Wu","submitted_at":"2023-03-02T18:34:38Z","abstract_excerpt":"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 gradie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01471","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.01471/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2303.01471","created_at":"2026-07-05T05:47:31.343375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.01471v1","created_at":"2026-07-05T05:47:31.343375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01471","created_at":"2026-07-05T05:47:31.343375+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPATBZFJOG7D","created_at":"2026-07-05T05:47:31.343375+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPATBZFJOG7DIIP5","created_at":"2026-07-05T05:47:31.343375+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPATBZFJ","created_at":"2026-07-05T05:47:31.343375+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01037","citing_title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2508.11765","citing_title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","ref_index":220,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12066","citing_title":"Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KPATBZFJOG7DIIP5XHXMJJLPTT","json":"https://pith.science/pith/KPATBZFJOG7DIIP5XHXMJJLPTT.json","graph_json":"https://pith.science/api/pith-number/KPATBZFJOG7DIIP5XHXMJJLPTT/graph.json","events_json":"https://pith.science/api/pith-number/KPATBZFJOG7DIIP5XHXMJJLPTT/events.json","paper":"https://pith.science/paper/KPATBZFJ"},"agent_actions":{"view_html":"https://pith.science/pith/KPATBZFJOG7DIIP5XHXMJJLPTT","download_json":"https://pith.science/pith/KPATBZFJOG7DIIP5XHXMJJLPTT.json","view_paper":"https://pith.science/paper/KPATBZFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.01471&json=true","fetch_graph":"https://pith.science/api/pith-number/KPATBZFJOG7DIIP5XHXMJJLPTT/graph.json","fetch_events":"https://pith.science/api/pith-number/KPATBZFJOG7DIIP5XHXMJJLPTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPATBZFJOG7DIIP5XHXMJJLPTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPATBZFJOG7DIIP5XHXMJJLPTT/action/storage_attestation","attest_author":"https://pith.science/pith/KPATBZFJOG7DIIP5XHXMJJLPTT/action/author_attestation","sign_citation":"https://pith.science/pith/KPATBZFJOG7DIIP5XHXMJJLPTT/action/citation_signature","submit_replication":"https://pith.science/pith/KPATBZFJOG7DIIP5XHXMJJLPTT/action/replication_record"}},"created_at":"2026-07-05T05:47:31.343375+00:00","updated_at":"2026-07-05T05:47:31.343375+00:00"}