{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:UJOZH4NMYGFPHEQ2OCBJN5UM2O","short_pith_number":"pith:UJOZH4NM","schema_version":"1.0","canonical_sha256":"a25d93f1acc18af3921a708296f68cd3917e7463d624b03acd0971f034a320dc","source":{"kind":"arxiv","id":"0911.1624","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0911.1624","created_at":"2026-05-18T04:02:12.200413+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.1624v3","created_at":"2026-05-18T04:02:12.200413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1624","created_at":"2026-05-18T04:02:12.200413+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJOZH4NMYGFP","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJOZH4NMYGFPHEQ2","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJOZH4NM","created_at":"2026-05-18T12:26:02.257875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2501.04776","citing_title":"IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2509.25821","citing_title":"On the Complexity of the Succinct State Local Hamiltonian Problem","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2509.25829","citing_title":"The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O","json":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O.json","graph_json":"https://pith.science/api/pith-number/UJOZH4NMYGFPHEQ2OCBJN5UM2O/graph.json","events_json":"https://pith.science/api/pith-number/UJOZH4NMYGFPHEQ2OCBJN5UM2O/events.json","paper":"https://pith.science/paper/UJOZH4NM"},"agent_actions":{"view_html":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O","download_json":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O.json","view_paper":"https://pith.science/paper/UJOZH4NM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.1624&json=true","fetch_graph":"https://pith.science/api/pith-number/UJOZH4NMYGFPHEQ2OCBJN5UM2O/graph.json","fetch_events":"https://pith.science/api/pith-number/UJOZH4NMYGFPHEQ2OCBJN5UM2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/action/storage_attestation","attest_author":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/action/author_attestation","sign_citation":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/action/citation_signature","submit_replication":"https://pith.science/pith/UJOZH4NMYGFPHEQ2OCBJN5UM2O/action/replication_record"}},"created_at":"2026-05-18T04:02:12.200413+00:00","updated_at":"2026-05-18T04:02:12.200413+00:00"}