{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:4I7K7T4XNPCTKGWCBKIUYRO3GZ","short_pith_number":"pith:4I7K7T4X","canonical_record":{"source":{"id":"0811.0898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-06T09:12:13Z","cross_cats_sorted":[],"title_canon_sha256":"578b92d378b07c982e98ad0f19299e76974da4354bc5f287ff8009c7a9c5b2e9","abstract_canon_sha256":"e55e6aa8d0da14a9546066700da7d5543a1344e411d8cbdd242acdc972ee06ab"},"schema_version":"1.0"},"canonical_sha256":"e23eafcf976bc5351ac20a914c45db366a50df3b23abcb10fdb76bc9a9be8a74","source":{"kind":"arxiv","id":"0811.0898","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.0898","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"arxiv_version","alias_value":"0811.0898v2","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.0898","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"pith_short_12","alias_value":"4I7K7T4XNPCT","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"4I7K7T4XNPCTKGWC","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"4I7K7T4X","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:4I7K7T4XNPCTKGWCBKIUYRO3GZ","target":"record","payload":{"canonical_record":{"source":{"id":"0811.0898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-06T09:12:13Z","cross_cats_sorted":[],"title_canon_sha256":"578b92d378b07c982e98ad0f19299e76974da4354bc5f287ff8009c7a9c5b2e9","abstract_canon_sha256":"e55e6aa8d0da14a9546066700da7d5543a1344e411d8cbdd242acdc972ee06ab"},"schema_version":"1.0"},"canonical_sha256":"e23eafcf976bc5351ac20a914c45db366a50df3b23abcb10fdb76bc9a9be8a74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:12.324994Z","signature_b64":"mLl4YNdyg7lip5JgEcmCjWxfrvRoELbUe/QGHFpd3SGFEF40Vx9ilCh/akAJI751tr5SVWlIDv2A5qDjvJ0GDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e23eafcf976bc5351ac20a914c45db366a50df3b23abcb10fdb76bc9a9be8a74","last_reissued_at":"2026-05-18T04:02:12.324166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:12.324166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.0898","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:02:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDWx1o5JRF03Xy4skh7wZDuOvLZ3BjBCJxUBiXxij/q/Sh6kVMiSAJg5h4KtyPrGP2OZxZTqGaMOz7278oxhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:32:32.824163Z"},"content_sha256":"d222f881bab225738cde01d9a65095b6bd5ea053db55e6ad40b1b89a4af663af","schema_version":"1.0","event_id":"sha256:d222f881bab225738cde01d9a65095b6bd5ea053db55e6ad40b1b89a4af663af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:4I7K7T4XNPCTKGWCBKIUYRO3GZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. Van den Nest","submitted_at":"2008-11-06T09:12:13Z","abstract_excerpt":"We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a simple proof of the Gottesman-Knill theorem without resorting to stabilizer techniques. The normal form highlights why Clifford circuits have such limited computational power in spite of their high entangling power. At the same time, the normal form shows how the classical simulation of Clifford circuits fits into the standard way of embedding classical compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.0898","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:02:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5aC5UCqV5e+boVfjTVcCEiwQY5RURscCrgzfbZ9yp7vAokQOcO/LKbxU/FxWNuX0jL1r8UqTWrtrPnC9J1/XCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:32:32.824599Z"},"content_sha256":"d975d068ff96cadfd246a359f51ee6ea974ad84d7379c743a55b591768918e3f","schema_version":"1.0","event_id":"sha256:d975d068ff96cadfd246a359f51ee6ea974ad84d7379c743a55b591768918e3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4I7K7T4XNPCTKGWCBKIUYRO3GZ/bundle.json","state_url":"https://pith.science/pith/4I7K7T4XNPCTKGWCBKIUYRO3GZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4I7K7T4XNPCTKGWCBKIUYRO3GZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T13:32:32Z","links":{"resolver":"https://pith.science/pith/4I7K7T4XNPCTKGWCBKIUYRO3GZ","bundle":"https://pith.science/pith/4I7K7T4XNPCTKGWCBKIUYRO3GZ/bundle.json","state":"https://pith.science/pith/4I7K7T4XNPCTKGWCBKIUYRO3GZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4I7K7T4XNPCTKGWCBKIUYRO3GZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:4I7K7T4XNPCTKGWCBKIUYRO3GZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e55e6aa8d0da14a9546066700da7d5543a1344e411d8cbdd242acdc972ee06ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-06T09:12:13Z","title_canon_sha256":"578b92d378b07c982e98ad0f19299e76974da4354bc5f287ff8009c7a9c5b2e9"},"schema_version":"1.0","source":{"id":"0811.0898","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.0898","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"arxiv_version","alias_value":"0811.0898v2","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.0898","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"pith_short_12","alias_value":"4I7K7T4XNPCT","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"4I7K7T4XNPCTKGWC","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"4I7K7T4X","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:d975d068ff96cadfd246a359f51ee6ea974ad84d7379c743a55b591768918e3f","target":"graph","created_at":"2026-05-18T04:02:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a simple proof of the Gottesman-Knill theorem without resorting to stabilizer techniques. The normal form highlights why Clifford circuits have such limited computational power in spite of their high entangling power. At the same time, the normal form shows how the classical simulation of Clifford circuits fits into the standard way of embedding classical compu","authors_text":"M. Van den Nest","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-06T09:12:13Z","title":"Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.0898","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d222f881bab225738cde01d9a65095b6bd5ea053db55e6ad40b1b89a4af663af","target":"record","created_at":"2026-05-18T04:02:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e55e6aa8d0da14a9546066700da7d5543a1344e411d8cbdd242acdc972ee06ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-06T09:12:13Z","title_canon_sha256":"578b92d378b07c982e98ad0f19299e76974da4354bc5f287ff8009c7a9c5b2e9"},"schema_version":"1.0","source":{"id":"0811.0898","kind":"arxiv","version":2}},"canonical_sha256":"e23eafcf976bc5351ac20a914c45db366a50df3b23abcb10fdb76bc9a9be8a74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e23eafcf976bc5351ac20a914c45db366a50df3b23abcb10fdb76bc9a9be8a74","first_computed_at":"2026-05-18T04:02:12.324166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:12.324166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mLl4YNdyg7lip5JgEcmCjWxfrvRoELbUe/QGHFpd3SGFEF40Vx9ilCh/akAJI751tr5SVWlIDv2A5qDjvJ0GDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:12.324994Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.0898","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d222f881bab225738cde01d9a65095b6bd5ea053db55e6ad40b1b89a4af663af","sha256:d975d068ff96cadfd246a359f51ee6ea974ad84d7379c743a55b591768918e3f"],"state_sha256":"673381ae71f62c6c0c076f630706340b63be327565facd732246551e70c496b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Zkyi7CkRRl5cjqMXJtddK62rVcQNfbW36p9aJ5z9xtUSqvdjafyQvz4p6UiDy0ZKIeWVH0qmpnIBNzh+HX1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T13:32:32.828179Z","bundle_sha256":"4e07d105048c33a147a11fe815ef9ebb0e225e986812a04f0dac5c0b49be31c6"}}