{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:6WEXBX7MKMTQQVKL4VESS7LQDD","short_pith_number":"pith:6WEXBX7M","schema_version":"1.0","canonical_sha256":"f58970dfec532708554be549297d7018f53d9af88506ce44bac649df611a177d","source":{"kind":"arxiv","id":"0805.1214","version":1},"attestation_state":"computed","paper":{"title":"Quantum algorithms for spin models and simulable gate sets for quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"H. J. Briegel, M. Van den Nest, R. Raussendorf, W. D\\\"ur","submitted_at":"2008-05-08T18:24:54Z","abstract_excerpt":"We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we recover and generalize the simulability of Valiant's match-gates by invoking the solvability of the free-fermion eight-vertex model. Our mappings furthermore provide a systematic formalism to obtain simple quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. For example, we present an efficient quantum algo"},"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":"0805.1214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-05-08T18:24:54Z","cross_cats_sorted":[],"title_canon_sha256":"26be2b51b67e78258c0ea79a557b5ec4814bc25ce73e2b415b33c65da175bbec","abstract_canon_sha256":"47000b591158049712c71af86a62aca5c75cee2e6bbcc1d05722d2035bfeaf67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:12.367655Z","signature_b64":"2nqNV/IgEd1R5z68om70h7psBWhDanuTEmZz4UC8stqC63J0iUMgqBmqSVrvlRgTg/0t3crj+nbvoibzBxqRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f58970dfec532708554be549297d7018f53d9af88506ce44bac649df611a177d","last_reissued_at":"2026-05-18T04:02:12.366734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:12.366734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithms for spin models and simulable gate sets for quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"H. J. Briegel, M. Van den Nest, R. Raussendorf, W. D\\\"ur","submitted_at":"2008-05-08T18:24:54Z","abstract_excerpt":"We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we recover and generalize the simulability of Valiant's match-gates by invoking the solvability of the free-fermion eight-vertex model. Our mappings furthermore provide a systematic formalism to obtain simple quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. For example, we present an efficient quantum algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.1214","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":"0805.1214","created_at":"2026-05-18T04:02:12.366889+00:00"},{"alias_kind":"arxiv_version","alias_value":"0805.1214v1","created_at":"2026-05-18T04:02:12.366889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.1214","created_at":"2026-05-18T04:02:12.366889+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WEXBX7MKMTQ","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WEXBX7MKMTQQVKL","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WEXBX7M","created_at":"2026-05-18T12:25:56.245647+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/6WEXBX7MKMTQQVKL4VESS7LQDD","json":"https://pith.science/pith/6WEXBX7MKMTQQVKL4VESS7LQDD.json","graph_json":"https://pith.science/api/pith-number/6WEXBX7MKMTQQVKL4VESS7LQDD/graph.json","events_json":"https://pith.science/api/pith-number/6WEXBX7MKMTQQVKL4VESS7LQDD/events.json","paper":"https://pith.science/paper/6WEXBX7M"},"agent_actions":{"view_html":"https://pith.science/pith/6WEXBX7MKMTQQVKL4VESS7LQDD","download_json":"https://pith.science/pith/6WEXBX7MKMTQQVKL4VESS7LQDD.json","view_paper":"https://pith.science/paper/6WEXBX7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0805.1214&json=true","fetch_graph":"https://pith.science/api/pith-number/6WEXBX7MKMTQQVKL4VESS7LQDD/graph.json","fetch_events":"https://pith.science/api/pith-number/6WEXBX7MKMTQQVKL4VESS7LQDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WEXBX7MKMTQQVKL4VESS7LQDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WEXBX7MKMTQQVKL4VESS7LQDD/action/storage_attestation","attest_author":"https://pith.science/pith/6WEXBX7MKMTQQVKL4VESS7LQDD/action/author_attestation","sign_citation":"https://pith.science/pith/6WEXBX7MKMTQQVKL4VESS7LQDD/action/citation_signature","submit_replication":"https://pith.science/pith/6WEXBX7MKMTQQVKL4VESS7LQDD/action/replication_record"}},"created_at":"2026-05-18T04:02:12.366889+00:00","updated_at":"2026-05-18T04:02:12.366889+00:00"}