{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:J3RVK4PLDY6GCI6PYQJRE4FMEU","short_pith_number":"pith:J3RVK4PL","schema_version":"1.0","canonical_sha256":"4ee35571eb1e3c6123cfc4131270ac252ce9e0f5f0e5cfbd8d68fd2aa038f495","source":{"kind":"arxiv","id":"2311.15587","version":3},"attestation_state":"computed","paper":{"title":"Quantum Langevin Dynamics for Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Hao Wang, Tongyang Li, Yizhou Liu, Yuchen Lu, Zherui Chen","submitted_at":"2023-11-27T07:25:47Z","abstract_excerpt":"We initiate the study of utilizing Quantum Langevin Dynamics (QLD) to solve optimization problems, particularly those non-convex objective functions that present substantial obstacles for traditional gradient descent algorithms. Specifically, we examine the dynamics of a system coupled with an infinite heat bath. This interaction induces both random quantum noise and a deterministic damping effect to the system, which nudge the system towards a steady state that hovers near the global minimum of objective functions. We theoretically prove the convergence of QLD in convex landscapes, demonstrat"},"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":"2311.15587","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-11-27T07:25:47Z","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"title_canon_sha256":"5fac6a7d6cba4b3c896a2efa50d187c4fcd4776239685f6e3d34c91df5d59ff9","abstract_canon_sha256":"072d52a7ce647320711214cbfae129f6c529a470856ba41adf0053128d5153c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:27:05.999159Z","signature_b64":"0e6ZTvViQK7HXnB66NLbJV0/9KA8ITPsPj068LXm4WBSQ0pC7yB/MNvfkA4wsVtLyjJPTE4zm4ZYsk84yEMtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ee35571eb1e3c6123cfc4131270ac252ce9e0f5f0e5cfbd8d68fd2aa038f495","last_reissued_at":"2026-07-05T10:27:05.998704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:27:05.998704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Langevin Dynamics for Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Hao Wang, Tongyang Li, Yizhou Liu, Yuchen Lu, Zherui Chen","submitted_at":"2023-11-27T07:25:47Z","abstract_excerpt":"We initiate the study of utilizing Quantum Langevin Dynamics (QLD) to solve optimization problems, particularly those non-convex objective functions that present substantial obstacles for traditional gradient descent algorithms. Specifically, we examine the dynamics of a system coupled with an infinite heat bath. This interaction induces both random quantum noise and a deterministic damping effect to the system, which nudge the system towards a steady state that hovers near the global minimum of objective functions. We theoretically prove the convergence of QLD in convex landscapes, demonstrat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.15587","kind":"arxiv","version":3},"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/2311.15587/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":"2311.15587","created_at":"2026-07-05T10:27:05.998765+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.15587v3","created_at":"2026-07-05T10:27:05.998765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.15587","created_at":"2026-07-05T10:27:05.998765+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3RVK4PLDY6G","created_at":"2026-07-05T10:27:05.998765+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3RVK4PLDY6GCI6P","created_at":"2026-07-05T10:27:05.998765+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3RVK4PL","created_at":"2026-07-05T10:27:05.998765+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04438","citing_title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J3RVK4PLDY6GCI6PYQJRE4FMEU","json":"https://pith.science/pith/J3RVK4PLDY6GCI6PYQJRE4FMEU.json","graph_json":"https://pith.science/api/pith-number/J3RVK4PLDY6GCI6PYQJRE4FMEU/graph.json","events_json":"https://pith.science/api/pith-number/J3RVK4PLDY6GCI6PYQJRE4FMEU/events.json","paper":"https://pith.science/paper/J3RVK4PL"},"agent_actions":{"view_html":"https://pith.science/pith/J3RVK4PLDY6GCI6PYQJRE4FMEU","download_json":"https://pith.science/pith/J3RVK4PLDY6GCI6PYQJRE4FMEU.json","view_paper":"https://pith.science/paper/J3RVK4PL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.15587&json=true","fetch_graph":"https://pith.science/api/pith-number/J3RVK4PLDY6GCI6PYQJRE4FMEU/graph.json","fetch_events":"https://pith.science/api/pith-number/J3RVK4PLDY6GCI6PYQJRE4FMEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3RVK4PLDY6GCI6PYQJRE4FMEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3RVK4PLDY6GCI6PYQJRE4FMEU/action/storage_attestation","attest_author":"https://pith.science/pith/J3RVK4PLDY6GCI6PYQJRE4FMEU/action/author_attestation","sign_citation":"https://pith.science/pith/J3RVK4PLDY6GCI6PYQJRE4FMEU/action/citation_signature","submit_replication":"https://pith.science/pith/J3RVK4PLDY6GCI6PYQJRE4FMEU/action/replication_record"}},"created_at":"2026-07-05T10:27:05.998765+00:00","updated_at":"2026-07-05T10:27:05.998765+00:00"}