{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3ZW2CH4NGUEKI3TGXP3E4UBSRR","short_pith_number":"pith:3ZW2CH4N","schema_version":"1.0","canonical_sha256":"de6da11f8d3508a46e66bbf64e50328c523f2684af40b24b01e502bd84ef47ed","source":{"kind":"arxiv","id":"2103.02202","version":3},"attestation_state":"computed","paper":{"title":"Stim: a fast stabilizer circuit simulator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney","submitted_at":"2021-03-03T06:21:21Z","abstract_excerpt":"This paper presents ``Stim\", a fast simulator for quantum stabilizer circuits. The paper explains how Stim works and compares it to existing tools. With no foreknowledge, Stim can analyze a distance 100 surface code circuit (20 thousand qubits, 8 million gates, 1 million measurements) in 15 seconds and then begin sampling full circuit shots at a rate of 1 kHz. Stim uses a stabilizer tableau representation, similar to Aaronson and Gottesman's CHP simulator, but with three main improvements. First, Stim improves the asymptotic complexity of deterministic measurement from quadratic to linear by t"},"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":"2103.02202","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-03-03T06:21:21Z","cross_cats_sorted":[],"title_canon_sha256":"cbe108b1e69652fa62fc360cf9fa3ffe25a975e062603cb369256a1abb622a7e","abstract_canon_sha256":"0efd7bd7b54cf01350008df70ad1d795ea5fa556587c7a1bf1179c3ff7ed3426"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:55:41.421252Z","signature_b64":"5NLQGgtPNeqe7yUbp2THY9S5HcCClPKkdLaACrpthAsbWlow9N3it29d5nU6YLI+akizfNjcHk+b0eEQUOYxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de6da11f8d3508a46e66bbf64e50328c523f2684af40b24b01e502bd84ef47ed","last_reissued_at":"2026-07-05T02:55:41.420832Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:55:41.420832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stim: a fast stabilizer circuit simulator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney","submitted_at":"2021-03-03T06:21:21Z","abstract_excerpt":"This paper presents ``Stim\", a fast simulator for quantum stabilizer circuits. The paper explains how Stim works and compares it to existing tools. With no foreknowledge, Stim can analyze a distance 100 surface code circuit (20 thousand qubits, 8 million gates, 1 million measurements) in 15 seconds and then begin sampling full circuit shots at a rate of 1 kHz. Stim uses a stabilizer tableau representation, similar to Aaronson and Gottesman's CHP simulator, but with three main improvements. First, Stim improves the asymptotic complexity of deterministic measurement from quadratic to linear by t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.02202","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.02202/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2103.02202","created_at":"2026-07-05T02:55:41.420889+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.02202v3","created_at":"2026-07-05T02:55:41.420889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.02202","created_at":"2026-07-05T02:55:41.420889+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZW2CH4NGUEK","created_at":"2026-07-05T02:55:41.420889+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZW2CH4NGUEKI3TG","created_at":"2026-07-05T02:55:41.420889+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZW2CH4N","created_at":"2026-07-05T02:55:41.420889+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":16,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27358","citing_title":"Cultivating logical catalysts for fault-tolerant dyadic phase rotations","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01887","citing_title":"LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09678","citing_title":"The dynamic 4.8.8 Floquet code","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08707","citing_title":"Simulating quantum circuits with a neural statebank","ref_index":56,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31428","citing_title":"The limits of erasure-based postselection for quantum error mitigation","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25974","citing_title":"PauLIB: A High-Performance Library for Processing Pauli Strings","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2406.14445","citing_title":"High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2411.16228","citing_title":"Soft information decoding with superconducting qubits","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2412.01446","citing_title":"Magic State Injection on IBM Quantum Processors Above the Distillation Threshold","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2512.09189","citing_title":"Exact and Efficient Stabilizer Simulation of Thermal-Relaxation Noise for Quantum Error Correction","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2603.05429","citing_title":"Constant depth magic state cultivation with Clifford measurements by gauging","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24739","citing_title":"CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04892","citing_title":"Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder","ref_index":74,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19871","citing_title":"Co-Designing Error Mitigation and Error Detection for Logical Qubits","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3ZW2CH4NGUEKI3TGXP3E4UBSRR","json":"https://pith.science/pith/3ZW2CH4NGUEKI3TGXP3E4UBSRR.json","graph_json":"https://pith.science/api/pith-number/3ZW2CH4NGUEKI3TGXP3E4UBSRR/graph.json","events_json":"https://pith.science/api/pith-number/3ZW2CH4NGUEKI3TGXP3E4UBSRR/events.json","paper":"https://pith.science/paper/3ZW2CH4N"},"agent_actions":{"view_html":"https://pith.science/pith/3ZW2CH4NGUEKI3TGXP3E4UBSRR","download_json":"https://pith.science/pith/3ZW2CH4NGUEKI3TGXP3E4UBSRR.json","view_paper":"https://pith.science/paper/3ZW2CH4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.02202&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZW2CH4NGUEKI3TGXP3E4UBSRR/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZW2CH4NGUEKI3TGXP3E4UBSRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZW2CH4NGUEKI3TGXP3E4UBSRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZW2CH4NGUEKI3TGXP3E4UBSRR/action/storage_attestation","attest_author":"https://pith.science/pith/3ZW2CH4NGUEKI3TGXP3E4UBSRR/action/author_attestation","sign_citation":"https://pith.science/pith/3ZW2CH4NGUEKI3TGXP3E4UBSRR/action/citation_signature","submit_replication":"https://pith.science/pith/3ZW2CH4NGUEKI3TGXP3E4UBSRR/action/replication_record"}},"created_at":"2026-07-05T02:55:41.420889+00:00","updated_at":"2026-07-05T02:55:41.420889+00:00"}