{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2WKCDCXUGQ6YPSTHYA2BGT7XOJ","short_pith_number":"pith:2WKCDCXU","schema_version":"1.0","canonical_sha256":"d594218af4343d87ca67c034134ff7725360a553aac41413e1dbba2b52e3f4e6","source":{"kind":"arxiv","id":"2207.08643","version":2},"attestation_state":"computed","paper":{"title":"A Sublinear-Time Quantum Algorithm for Approximating Partition Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"quant-ph","authors_text":"Arjan Cornelissen, Yassine Hamoudi","submitted_at":"2022-07-18T14:41:48Z","abstract_excerpt":"We present a novel quantum algorithm for estimating Gibbs partition functions in sublinear time with respect to the logarithm of the size of the state space. This is the first speed-up of this type to be obtained over the seminal nearly-linear time algorithm of \\v{S}tefankovi\\v{c}, Vempala and Vigoda [JACM, 2009]. Our result also preserves the quadratic speed-up in precision and spectral gap achieved in previous work by exploiting the properties of quantum Markov chains. As an application, we obtain new polynomial improvements over the best-known algorithms for computing the partition function"},"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":"2207.08643","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-18T14:41:48Z","cross_cats_sorted":["cs.CC","cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"9b8bcf03d187f33ebfcf9c64af93b8662c64bece3320f12cb2f79bc4e959fbdc","abstract_canon_sha256":"6b0ccad28389c60dd224b16701398e40779f32a672d7bfef6928883caa30b0f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:33:14.543825Z","signature_b64":"QfKAKEKiPw+Dl1mwcAn4B4fusRUDrDZAf8UDihboKeS+2/m0KFy7ULbQYSDWcPwrAd3Ljv/pZDxUMBOj9q9CCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d594218af4343d87ca67c034134ff7725360a553aac41413e1dbba2b52e3f4e6","last_reissued_at":"2026-07-05T05:33:14.542688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:33:14.542688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sublinear-Time Quantum Algorithm for Approximating Partition Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"quant-ph","authors_text":"Arjan Cornelissen, Yassine Hamoudi","submitted_at":"2022-07-18T14:41:48Z","abstract_excerpt":"We present a novel quantum algorithm for estimating Gibbs partition functions in sublinear time with respect to the logarithm of the size of the state space. This is the first speed-up of this type to be obtained over the seminal nearly-linear time algorithm of \\v{S}tefankovi\\v{c}, Vempala and Vigoda [JACM, 2009]. Our result also preserves the quadratic speed-up in precision and spectral gap achieved in previous work by exploiting the properties of quantum Markov chains. As an application, we obtain new polynomial improvements over the best-known algorithms for computing the partition function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.08643","kind":"arxiv","version":2},"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/2207.08643/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":"2207.08643","created_at":"2026-07-05T05:33:14.542744+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.08643v2","created_at":"2026-07-05T05:33:14.542744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.08643","created_at":"2026-07-05T05:33:14.542744+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WKCDCXUGQ6Y","created_at":"2026-07-05T05:33:14.542744+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WKCDCXUGQ6YPSTH","created_at":"2026-07-05T05:33:14.542744+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WKCDCXU","created_at":"2026-07-05T05:33:14.542744+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08030","citing_title":"Circuit-Efficient Randomized Quantum Simulation of Non-Unitary Dynamics with Observable-Driven and Symmetry-Aware Designs","ref_index":69,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2WKCDCXUGQ6YPSTHYA2BGT7XOJ","json":"https://pith.science/pith/2WKCDCXUGQ6YPSTHYA2BGT7XOJ.json","graph_json":"https://pith.science/api/pith-number/2WKCDCXUGQ6YPSTHYA2BGT7XOJ/graph.json","events_json":"https://pith.science/api/pith-number/2WKCDCXUGQ6YPSTHYA2BGT7XOJ/events.json","paper":"https://pith.science/paper/2WKCDCXU"},"agent_actions":{"view_html":"https://pith.science/pith/2WKCDCXUGQ6YPSTHYA2BGT7XOJ","download_json":"https://pith.science/pith/2WKCDCXUGQ6YPSTHYA2BGT7XOJ.json","view_paper":"https://pith.science/paper/2WKCDCXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.08643&json=true","fetch_graph":"https://pith.science/api/pith-number/2WKCDCXUGQ6YPSTHYA2BGT7XOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2WKCDCXUGQ6YPSTHYA2BGT7XOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WKCDCXUGQ6YPSTHYA2BGT7XOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WKCDCXUGQ6YPSTHYA2BGT7XOJ/action/storage_attestation","attest_author":"https://pith.science/pith/2WKCDCXUGQ6YPSTHYA2BGT7XOJ/action/author_attestation","sign_citation":"https://pith.science/pith/2WKCDCXUGQ6YPSTHYA2BGT7XOJ/action/citation_signature","submit_replication":"https://pith.science/pith/2WKCDCXUGQ6YPSTHYA2BGT7XOJ/action/replication_record"}},"created_at":"2026-07-05T05:33:14.542744+00:00","updated_at":"2026-07-05T05:33:14.542744+00:00"}