{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UFFO7HD7C7TDLLDKMXMDDFFTQ5","short_pith_number":"pith:UFFO7HD7","schema_version":"1.0","canonical_sha256":"a14aef9c7f17e635ac6a65d83194b3874ceff2041bb8855b8c3ab1ece61fc7e3","source":{"kind":"arxiv","id":"2504.03626","version":1},"attestation_state":"computed","paper":{"title":"Quantum Speedups for Markov Chain Monte Carlo Methods with Application to Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Chunhao Wang, Guneykan Ozgul, Mehrdad Mahdavi, Xiantao Li","submitted_at":"2025-04-04T17:44:22Z","abstract_excerpt":"We propose quantum algorithms that provide provable speedups for Markov Chain Monte Carlo (MCMC) methods commonly used for sampling from probability distributions of the form $\\pi \\propto e^{-f}$, where $f$ is a potential function. Our first approach considers Gibbs sampling for finite-sum potentials in the stochastic setting, employing an oracle that provides gradients of individual functions. In the second setting, we consider access only to a stochastic evaluation oracle, allowing simultaneous queries at two points of the potential function under the same stochastic parameter. By introducin"},"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":"2504.03626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-04T17:44:22Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"009b036c16d4adc0f89c50e4eeb7e075fe91984b974e194d38da48a55ef2943a","abstract_canon_sha256":"17d33570fce1e289fb7c380d7189525abcc0c36972624000a497e44acc481377"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:34.577431Z","signature_b64":"lzHcqdujGoA/KKMgRpoUF5sQQhTFHn3130gXO4XvE0KEK8zgSM0nH38DbmZ1LlSXtytlTewzL2mhy4F7iueABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a14aef9c7f17e635ac6a65d83194b3874ceff2041bb8855b8c3ab1ece61fc7e3","last_reissued_at":"2026-07-05T10:44:34.576926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:34.576926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Speedups for Markov Chain Monte Carlo Methods with Application to Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Chunhao Wang, Guneykan Ozgul, Mehrdad Mahdavi, Xiantao Li","submitted_at":"2025-04-04T17:44:22Z","abstract_excerpt":"We propose quantum algorithms that provide provable speedups for Markov Chain Monte Carlo (MCMC) methods commonly used for sampling from probability distributions of the form $\\pi \\propto e^{-f}$, where $f$ is a potential function. Our first approach considers Gibbs sampling for finite-sum potentials in the stochastic setting, employing an oracle that provides gradients of individual functions. In the second setting, we consider access only to a stochastic evaluation oracle, allowing simultaneous queries at two points of the potential function under the same stochastic parameter. By introducin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03626","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/2504.03626/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":"2504.03626","created_at":"2026-07-05T10:44:34.576988+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.03626v1","created_at":"2026-07-05T10:44:34.576988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03626","created_at":"2026-07-05T10:44:34.576988+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFFO7HD7C7TD","created_at":"2026-07-05T10:44:34.576988+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFFO7HD7C7TDLLDK","created_at":"2026-07-05T10:44:34.576988+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFFO7HD7","created_at":"2026-07-05T10:44:34.576988+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31076","citing_title":"Quantum Derivative Pricing for SPDEs via BDSDE Representation","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2505.21255","citing_title":"Quantum Markov chain Monte Carlo method with programmable quantum simulators","ref_index":60,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UFFO7HD7C7TDLLDKMXMDDFFTQ5","json":"https://pith.science/pith/UFFO7HD7C7TDLLDKMXMDDFFTQ5.json","graph_json":"https://pith.science/api/pith-number/UFFO7HD7C7TDLLDKMXMDDFFTQ5/graph.json","events_json":"https://pith.science/api/pith-number/UFFO7HD7C7TDLLDKMXMDDFFTQ5/events.json","paper":"https://pith.science/paper/UFFO7HD7"},"agent_actions":{"view_html":"https://pith.science/pith/UFFO7HD7C7TDLLDKMXMDDFFTQ5","download_json":"https://pith.science/pith/UFFO7HD7C7TDLLDKMXMDDFFTQ5.json","view_paper":"https://pith.science/paper/UFFO7HD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.03626&json=true","fetch_graph":"https://pith.science/api/pith-number/UFFO7HD7C7TDLLDKMXMDDFFTQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/UFFO7HD7C7TDLLDKMXMDDFFTQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFFO7HD7C7TDLLDKMXMDDFFTQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFFO7HD7C7TDLLDKMXMDDFFTQ5/action/storage_attestation","attest_author":"https://pith.science/pith/UFFO7HD7C7TDLLDKMXMDDFFTQ5/action/author_attestation","sign_citation":"https://pith.science/pith/UFFO7HD7C7TDLLDKMXMDDFFTQ5/action/citation_signature","submit_replication":"https://pith.science/pith/UFFO7HD7C7TDLLDKMXMDDFFTQ5/action/replication_record"}},"created_at":"2026-07-05T10:44:34.576988+00:00","updated_at":"2026-07-05T10:44:34.576988+00:00"}