{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:DNW7ASOPUYC2CIHTLAARJL4VKD","short_pith_number":"pith:DNW7ASOP","schema_version":"1.0","canonical_sha256":"1b6df049cfa605a120f3580114af9550e7c37d7cc14eab0ca5895d6f8f07b5e5","source":{"kind":"arxiv","id":"0811.0596","version":3},"attestation_state":"computed","paper":{"title":"Quantum Speed-up for Approximating Partition Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anura Abeyesinghe, Chen-Fu Chiang, Daniel Nagaj, Pawel Wocjan","submitted_at":"2008-11-04T20:24:00Z","abstract_excerpt":"We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method and use non-adaptive cooling schedules. The improvement in time complexity is twofold: a quadratic reduction with respect to the spectral gap of the underlying Markov chains and a quadratic reduction with respect to the parameter characterizing the desired accuracy of the estimate output by the FPRAS. Both reductions are intimately related and cannot be achieved separately.\n  First, we use Grover'"},"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":"0811.0596","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-04T20:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"b6ba2534e4b0d53618dddca0efe2596e81747c3f760f3480971bc6a522701fc8","abstract_canon_sha256":"3ffd6fe7d9d881a1ca865fe2deb120973266fbaeb245a781a219b34abb1c16c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:21.820568Z","signature_b64":"RjqUTZzqXh7dT7xy3v77hZ1L+UCa/NH+OpsyMHtwxt8sr9f7HpQmUNDFW0x1tPzQPdfDpXH1Qxryph1gQjIvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b6df049cfa605a120f3580114af9550e7c37d7cc14eab0ca5895d6f8f07b5e5","last_reissued_at":"2026-05-18T03:21:21.819964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:21.819964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Speed-up for Approximating Partition Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anura Abeyesinghe, Chen-Fu Chiang, Daniel Nagaj, Pawel Wocjan","submitted_at":"2008-11-04T20:24:00Z","abstract_excerpt":"We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method and use non-adaptive cooling schedules. The improvement in time complexity is twofold: a quadratic reduction with respect to the spectral gap of the underlying Markov chains and a quadratic reduction with respect to the parameter characterizing the desired accuracy of the estimate output by the FPRAS. Both reductions are intimately related and cannot be achieved separately.\n  First, we use Grover'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.0596","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":""},"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":"0811.0596","created_at":"2026-05-18T03:21:21.820051+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.0596v3","created_at":"2026-05-18T03:21:21.820051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.0596","created_at":"2026-05-18T03:21:21.820051+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNW7ASOPUYC2","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNW7ASOPUYC2CIHT","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNW7ASOP","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":284,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DNW7ASOPUYC2CIHTLAARJL4VKD","json":"https://pith.science/pith/DNW7ASOPUYC2CIHTLAARJL4VKD.json","graph_json":"https://pith.science/api/pith-number/DNW7ASOPUYC2CIHTLAARJL4VKD/graph.json","events_json":"https://pith.science/api/pith-number/DNW7ASOPUYC2CIHTLAARJL4VKD/events.json","paper":"https://pith.science/paper/DNW7ASOP"},"agent_actions":{"view_html":"https://pith.science/pith/DNW7ASOPUYC2CIHTLAARJL4VKD","download_json":"https://pith.science/pith/DNW7ASOPUYC2CIHTLAARJL4VKD.json","view_paper":"https://pith.science/paper/DNW7ASOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.0596&json=true","fetch_graph":"https://pith.science/api/pith-number/DNW7ASOPUYC2CIHTLAARJL4VKD/graph.json","fetch_events":"https://pith.science/api/pith-number/DNW7ASOPUYC2CIHTLAARJL4VKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNW7ASOPUYC2CIHTLAARJL4VKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNW7ASOPUYC2CIHTLAARJL4VKD/action/storage_attestation","attest_author":"https://pith.science/pith/DNW7ASOPUYC2CIHTLAARJL4VKD/action/author_attestation","sign_citation":"https://pith.science/pith/DNW7ASOPUYC2CIHTLAARJL4VKD/action/citation_signature","submit_replication":"https://pith.science/pith/DNW7ASOPUYC2CIHTLAARJL4VKD/action/replication_record"}},"created_at":"2026-05-18T03:21:21.820051+00:00","updated_at":"2026-05-18T03:21:21.820051+00:00"}