{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:337B6KQLJMODLR2UVEKVZ6DGNE","short_pith_number":"pith:337B6KQL","schema_version":"1.0","canonical_sha256":"defe1f2a0b4b1c35c754a9155cf8666902ffc5094cd39acdfce099b700e4156b","source":{"kind":"arxiv","id":"1201.6319","version":2},"attestation_state":"computed","paper":{"title":"Classical simulation of measurement-based quantum computation on higher-genus surface-code states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Leonard Goff, Robert Raussendorf","submitted_at":"2012-01-30T18:48:44Z","abstract_excerpt":"We consider the efficiency of classically simulating measurement-based quantum computation on surface-code states. We devise a method for calculating the elements of the probability distribution for the classical output of the quantum computation. The operational cost of this method is polynomial in the size of the surface-code state, but in the worst case scales as $2^{2g}$ in the genus $g$ of the surface embedding the code. However, there are states in the code space for which the simulation becomes efficient. In general, the simulation cost is exponential in the entanglement contained in a "},"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":"1201.6319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-01-30T18:48:44Z","cross_cats_sorted":[],"title_canon_sha256":"032de33505f43433071c44c8d92fd4137d51da3f93df14d888e086f902dab329","abstract_canon_sha256":"45517d3323a67a2c36ba31783c7f2f94c346d1a9923a2badf9302aed03a17b02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:56.374780Z","signature_b64":"uUYkeNARm5G3I2go06zrVFokAXXWhacA87neBfaT+EQ7xQ+nPLQ1gEEGVTJyHswOLOGTPe5NnU+qlUdLxu3oDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"defe1f2a0b4b1c35c754a9155cf8666902ffc5094cd39acdfce099b700e4156b","last_reissued_at":"2026-05-18T03:41:56.373980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:56.373980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical simulation of measurement-based quantum computation on higher-genus surface-code states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Leonard Goff, Robert Raussendorf","submitted_at":"2012-01-30T18:48:44Z","abstract_excerpt":"We consider the efficiency of classically simulating measurement-based quantum computation on surface-code states. We devise a method for calculating the elements of the probability distribution for the classical output of the quantum computation. The operational cost of this method is polynomial in the size of the surface-code state, but in the worst case scales as $2^{2g}$ in the genus $g$ of the surface embedding the code. However, there are states in the code space for which the simulation becomes efficient. In general, the simulation cost is exponential in the entanglement contained in a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6319","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":""},"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":"1201.6319","created_at":"2026-05-18T03:41:56.374115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6319v2","created_at":"2026-05-18T03:41:56.374115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6319","created_at":"2026-05-18T03:41:56.374115+00:00"},{"alias_kind":"pith_short_12","alias_value":"337B6KQLJMOD","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"337B6KQLJMODLR2U","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"337B6KQL","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.08847","citing_title":"The Structure of Circle Graph States","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/337B6KQLJMODLR2UVEKVZ6DGNE","json":"https://pith.science/pith/337B6KQLJMODLR2UVEKVZ6DGNE.json","graph_json":"https://pith.science/api/pith-number/337B6KQLJMODLR2UVEKVZ6DGNE/graph.json","events_json":"https://pith.science/api/pith-number/337B6KQLJMODLR2UVEKVZ6DGNE/events.json","paper":"https://pith.science/paper/337B6KQL"},"agent_actions":{"view_html":"https://pith.science/pith/337B6KQLJMODLR2UVEKVZ6DGNE","download_json":"https://pith.science/pith/337B6KQLJMODLR2UVEKVZ6DGNE.json","view_paper":"https://pith.science/paper/337B6KQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6319&json=true","fetch_graph":"https://pith.science/api/pith-number/337B6KQLJMODLR2UVEKVZ6DGNE/graph.json","fetch_events":"https://pith.science/api/pith-number/337B6KQLJMODLR2UVEKVZ6DGNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/337B6KQLJMODLR2UVEKVZ6DGNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/337B6KQLJMODLR2UVEKVZ6DGNE/action/storage_attestation","attest_author":"https://pith.science/pith/337B6KQLJMODLR2UVEKVZ6DGNE/action/author_attestation","sign_citation":"https://pith.science/pith/337B6KQLJMODLR2UVEKVZ6DGNE/action/citation_signature","submit_replication":"https://pith.science/pith/337B6KQLJMODLR2UVEKVZ6DGNE/action/replication_record"}},"created_at":"2026-05-18T03:41:56.374115+00:00","updated_at":"2026-05-18T03:41:56.374115+00:00"}