{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:UJOZH4NMYGFPHEQ2OCBJN5UM2O","short_pith_number":"pith:UJOZH4NM","canonical_record":{"source":{"id":"0911.1624","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-09T10:17:46Z","cross_cats_sorted":[],"title_canon_sha256":"c265be7260ae9a21c7b0ff19936a5c81f981ce29cc2fa9f93bcd403960041544","abstract_canon_sha256":"eb2abf2e4c368788b9eb126c4d8e999b8687cce1d512238af55a15c0e0951afc"},"schema_version":"1.0"},"canonical_sha256":"a25d93f1acc18af3921a708296f68cd3917e7463d624b03acd0971f034a320dc","source":{"kind":"arxiv","id":"0911.1624","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.1624","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"arxiv_version","alias_value":"0911.1624v3","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1624","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"pith_short_12","alias_value":"UJOZH4NMYGFP","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"UJOZH4NMYGFPHEQ2","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"UJOZH4NM","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:UJOZH4NMYGFPHEQ2OCBJN5UM2O","target":"record","payload":{"canonical_record":{"source":{"id":"0911.1624","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-09T10:17:46Z","cross_cats_sorted":[],"title_canon_sha256":"c265be7260ae9a21c7b0ff19936a5c81f981ce29cc2fa9f93bcd403960041544","abstract_canon_sha256":"eb2abf2e4c368788b9eb126c4d8e999b8687cce1d512238af55a15c0e0951afc"},"schema_version":"1.0"},"canonical_sha256":"a25d93f1acc18af3921a708296f68cd3917e7463d624b03acd0971f034a320dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:12.201034Z","signature_b64":"9TM5It3kH1K1+JI407EpEheeXqZo5IbnC14YRFcGtIaj6MCLO/ptGTgjPULqNoiZeLuuY7IKf7vz7zjS1Oi+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a25d93f1acc18af3921a708296f68cd3917e7463d624b03acd0971f034a320dc","last_reissued_at":"2026-05-18T04:02:12.200291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:12.200291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.1624","source_version":3,"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":"DI+f3y4Uxq1C2WYs7uJkcPnj5OxqDh9Yd+rFffqNc1a0W3wjQIhvJgraPGy+lBGFYIAo2iQm62g3pwk1u8PFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:18:44.510152Z"},"content_sha256":"312fc60fb7984834af734ed4648f8762f11a8f5bd6cc7306ec0af7fb080e3697","schema_version":"1.0","event_id":"sha256:312fc60fb7984834af734ed4648f8762f11a8f5bd6cc7306ec0af7fb080e3697"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:UJOZH4NMYGFPHEQ2OCBJN5UM2O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulating quantum computers with probabilistic methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. Van den Nest","submitted_at":"2009-11-09T10:17:46Z","abstract_excerpt":"We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate new classes of classically simulatable quantum circuits where standard techniques relying on the exact computation of measurement probabilities fail to provide efficient simulations. For example, we show how various concatenations of matchgate, Toffoli, Clifford, bounded-depth, Fourier transform and other circuits are classically simulatable. We also prove th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.1624","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"},"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":"uBXwS8bGjsKebu2Z4xPqUF/jDbtXoGUN7pinToyC7Ugxqkkg6nwoiugz4Qcn36jAxD/pNn58+H51HdsnubFZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:18:44.510558Z"},"content_sha256":"3aad831b8beebcbed4e7d4768303b5a26556a17fc7c540e0a4e161d3c368e002","schema_version":"1.0","event_id":"sha256:3aad831b8beebcbed4e7d4768303b5a26556a17fc7c540e0a4e161d3c368e002"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/bundle.json","state_url":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/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-26T11:18:44Z","links":{"resolver":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O","bundle":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/bundle.json","state":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:UJOZH4NMYGFPHEQ2OCBJN5UM2O","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":"eb2abf2e4c368788b9eb126c4d8e999b8687cce1d512238af55a15c0e0951afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-09T10:17:46Z","title_canon_sha256":"c265be7260ae9a21c7b0ff19936a5c81f981ce29cc2fa9f93bcd403960041544"},"schema_version":"1.0","source":{"id":"0911.1624","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.1624","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"arxiv_version","alias_value":"0911.1624v3","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1624","created_at":"2026-05-18T04:02:12Z"},{"alias_kind":"pith_short_12","alias_value":"UJOZH4NMYGFP","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"UJOZH4NMYGFPHEQ2","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"UJOZH4NM","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:3aad831b8beebcbed4e7d4768303b5a26556a17fc7c540e0a4e161d3c368e002","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 investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate new classes of classically simulatable quantum circuits where standard techniques relying on the exact computation of measurement probabilities fail to provide efficient simulations. For example, we show how various concatenations of matchgate, Toffoli, Clifford, bounded-depth, Fourier transform and other circuits are classically simulatable. We also prove th","authors_text":"M. Van den Nest","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-09T10:17:46Z","title":"Simulating quantum computers with probabilistic methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.1624","kind":"arxiv","version":3},"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:312fc60fb7984834af734ed4648f8762f11a8f5bd6cc7306ec0af7fb080e3697","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":"eb2abf2e4c368788b9eb126c4d8e999b8687cce1d512238af55a15c0e0951afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-09T10:17:46Z","title_canon_sha256":"c265be7260ae9a21c7b0ff19936a5c81f981ce29cc2fa9f93bcd403960041544"},"schema_version":"1.0","source":{"id":"0911.1624","kind":"arxiv","version":3}},"canonical_sha256":"a25d93f1acc18af3921a708296f68cd3917e7463d624b03acd0971f034a320dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a25d93f1acc18af3921a708296f68cd3917e7463d624b03acd0971f034a320dc","first_computed_at":"2026-05-18T04:02:12.200291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:12.200291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9TM5It3kH1K1+JI407EpEheeXqZo5IbnC14YRFcGtIaj6MCLO/ptGTgjPULqNoiZeLuuY7IKf7vz7zjS1Oi+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:12.201034Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.1624","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:312fc60fb7984834af734ed4648f8762f11a8f5bd6cc7306ec0af7fb080e3697","sha256:3aad831b8beebcbed4e7d4768303b5a26556a17fc7c540e0a4e161d3c368e002"],"state_sha256":"3032f251589bc2378def12bd48babe7bbcb00645dd560942ab9918fd12903079"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HifS0y8h4uJA29lTa8om+ZyicGSiCGhU5qCw/8cSHb2v07ZiI0Wrn4ZK+j+v7Gs7qp4OqGGO36Jn0jRYChhlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:18:44.512678Z","bundle_sha256":"d3f86840e915b3dbd9a8dd871e932989618786cfc6bcd62049902bcfff221b1c"}}