{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CA3FFWTD55DPKZ3BIRSQMWC7QX","short_pith_number":"pith:CA3FFWTD","schema_version":"1.0","canonical_sha256":"103652da63ef46f56761446506585f85f595696bf1eff23eddf79d89b79da999","source":{"kind":"arxiv","id":"1405.2749","version":1},"attestation_state":"computed","paper":{"title":"A quantum algorithm for additive approximation of Ising partition functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"primary_cat":"quant-ph","authors_text":"Akira Matsuo, Keisuke Fujii, Nobuyuki Imoto","submitted_at":"2014-05-12T13:34:06Z","abstract_excerpt":"We investigate quantum computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the overlap mapping developed by Van den Nest, D\\\"ur, and Briegel [Phys. Rev. Lett. 98, 117207 (2007)] and its interpretation through measurement-based quantum computation (MBQC). We specify an algorithmic domain, on which the proposed algorithm works, and an approximation scale, which determines the accuracy of the approximation. We show that the proposed algor"},"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":"1405.2749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-12T13:34:06Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"title_canon_sha256":"8eb5ca34a31d31a124c09b1f60377948843781273cde8ef91a0d5712e78d944c","abstract_canon_sha256":"0afe0e2d71afe22a3201795782f728e40144798b5e50a5b95e71860e79061c63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:22.077056Z","signature_b64":"YW4VovvXCWDuCNkzCEjC1xH0FOpCh2ZzGl93wWQsmHxL35Rv2yCz0dkE15QpUQuAZKC8pHpl9nEHxZkSHh5NDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"103652da63ef46f56761446506585f85f595696bf1eff23eddf79d89b79da999","last_reissued_at":"2026-05-18T02:45:22.076444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:22.076444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantum algorithm for additive approximation of Ising partition functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.CC"],"primary_cat":"quant-ph","authors_text":"Akira Matsuo, Keisuke Fujii, Nobuyuki Imoto","submitted_at":"2014-05-12T13:34:06Z","abstract_excerpt":"We investigate quantum computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the overlap mapping developed by Van den Nest, D\\\"ur, and Briegel [Phys. Rev. Lett. 98, 117207 (2007)] and its interpretation through measurement-based quantum computation (MBQC). We specify an algorithmic domain, on which the proposed algorithm works, and an approximation scale, which determines the accuracy of the approximation. We show that the proposed algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2749","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":""},"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":"1405.2749","created_at":"2026-05-18T02:45:22.076529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2749v1","created_at":"2026-05-18T02:45:22.076529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2749","created_at":"2026-05-18T02:45:22.076529+00:00"},{"alias_kind":"pith_short_12","alias_value":"CA3FFWTD55DP","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CA3FFWTD55DPKZ3B","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CA3FFWTD","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CA3FFWTD55DPKZ3BIRSQMWC7QX","json":"https://pith.science/pith/CA3FFWTD55DPKZ3BIRSQMWC7QX.json","graph_json":"https://pith.science/api/pith-number/CA3FFWTD55DPKZ3BIRSQMWC7QX/graph.json","events_json":"https://pith.science/api/pith-number/CA3FFWTD55DPKZ3BIRSQMWC7QX/events.json","paper":"https://pith.science/paper/CA3FFWTD"},"agent_actions":{"view_html":"https://pith.science/pith/CA3FFWTD55DPKZ3BIRSQMWC7QX","download_json":"https://pith.science/pith/CA3FFWTD55DPKZ3BIRSQMWC7QX.json","view_paper":"https://pith.science/paper/CA3FFWTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2749&json=true","fetch_graph":"https://pith.science/api/pith-number/CA3FFWTD55DPKZ3BIRSQMWC7QX/graph.json","fetch_events":"https://pith.science/api/pith-number/CA3FFWTD55DPKZ3BIRSQMWC7QX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CA3FFWTD55DPKZ3BIRSQMWC7QX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CA3FFWTD55DPKZ3BIRSQMWC7QX/action/storage_attestation","attest_author":"https://pith.science/pith/CA3FFWTD55DPKZ3BIRSQMWC7QX/action/author_attestation","sign_citation":"https://pith.science/pith/CA3FFWTD55DPKZ3BIRSQMWC7QX/action/citation_signature","submit_replication":"https://pith.science/pith/CA3FFWTD55DPKZ3BIRSQMWC7QX/action/replication_record"}},"created_at":"2026-05-18T02:45:22.076529+00:00","updated_at":"2026-05-18T02:45:22.076529+00:00"}