{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:T7A5FBJMHJJ323BHNSEYPPZQDH","short_pith_number":"pith:T7A5FBJM","schema_version":"1.0","canonical_sha256":"9fc1d2852c3a53bd6c276c8987bf3019efaeb52b31b32da3eb18d8dc30587f24","source":{"kind":"arxiv","id":"quant-ph/0406196","version":5},"attestation_state":"computed","paper":{"title":"Improved Simulation of Stabilizer Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, Scott Aaronson","submitted_at":"2004-06-25T17:57:42Z","abstract_excerpt":"The Gottesman-Knill theorem says that a stabilizer circuit -- that is, a quantum circuit consisting solely of CNOT, Hadamard, and phase gates -- can be simulated efficiently on a classical computer. This paper improves that theorem in several directions. First, by removing the need for Gaussian elimination, we make the simulation algorithm much faster at the cost of a factor-2 increase in the number of bits needed to represent a state. We have implemented the improved algorithm in a freely-available program called CHP (CNOT-Hadamard-Phase), which can handle thousands of qubits easily. Second, "},"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":"quant-ph/0406196","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2004-06-25T17:57:42Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"647e9e5a31d4533589af6d2a4dd921021979b0c243e3e3f8661b3f097d5bd1f0","abstract_canon_sha256":"79118811a3f07bf0938e8a92fa519f3efc038070675336a89e8a85022a059327"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:50:20.052426Z","signature_b64":"5LOTxdzHRaUVJnqp4IF2yq0aKSnL6305tJIHSOmNWMNXgK9lGeBmw3xHDH7SL5QM+5SwgxoTrS4m2uYH75v4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fc1d2852c3a53bd6c276c8987bf3019efaeb52b31b32da3eb18d8dc30587f24","last_reissued_at":"2026-07-04T16:50:20.052072Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:50:20.052072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Simulation of Stabilizer Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, Scott Aaronson","submitted_at":"2004-06-25T17:57:42Z","abstract_excerpt":"The Gottesman-Knill theorem says that a stabilizer circuit -- that is, a quantum circuit consisting solely of CNOT, Hadamard, and phase gates -- can be simulated efficiently on a classical computer. This paper improves that theorem in several directions. First, by removing the need for Gaussian elimination, we make the simulation algorithm much faster at the cost of a factor-2 increase in the number of bits needed to represent a state. We have implemented the improved algorithm in a freely-available program called CHP (CNOT-Hadamard-Phase), which can handle thousands of qubits easily. Second, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0406196","kind":"arxiv","version":5},"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/quant-ph/0406196/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":"quant-ph/0406196","created_at":"2026-07-04T16:50:20.052130+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0406196v5","created_at":"2026-07-04T16:50:20.052130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0406196","created_at":"2026-07-04T16:50:20.052130+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7A5FBJMHJJ3","created_at":"2026-07-04T16:50:20.052130+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7A5FBJMHJJ323BH","created_at":"2026-07-04T16:50:20.052130+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7A5FBJM","created_at":"2026-07-04T16:50:20.052130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":21,"internal_anchor_count":18,"sample":[{"citing_arxiv_id":"2607.08396","citing_title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2607.08508","citing_title":"Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07197","citing_title":"Analytical Landscape of Maximal Magic for Two-Qutrit States and Beyond","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2606.22507","citing_title":"Hierarchy of mixed symmetry protected topological states in extended cluster states under subsystem decoherence","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20805","citing_title":"Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers","ref_index":141,"is_internal_anchor":true},{"citing_arxiv_id":"2607.01351","citing_title":"Wigner negativity in Krylov space and emergent semiclassicality","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2606.17148","citing_title":"Quantum Resources and Wigner Symmetry in Nucleon-Nucleon Scattering from Effective Field Theory","ref_index":58,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12404","citing_title":"Collective neutrino oscillations: Many-body non-forward effects and non-classicality","ref_index":82,"is_internal_anchor":true},{"citing_arxiv_id":"2606.09971","citing_title":"Magic and entanglement in 1+1-dimensional SU(2) lattice gauge theory","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2606.08707","citing_title":"Simulating quantum circuits with a neural statebank","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2607.00229","citing_title":"Production of Magic States via $Z$ Bosons and Dark Photons","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2606.29962","citing_title":"BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2605.25974","citing_title":"PauLIB: A High-Performance Library for Processing Pauli Strings","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2606.28004","citing_title":"Hard-core Bosons in Action: Applications to Quantum Circuits","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2306.01043","citing_title":"Clifford Orbits from Cayley Graph Quotients","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2603.10932","citing_title":"Gauge-invariant QMETTS with mutually unbiased physical bases for $Z_2$ lattice gauge theories at finite temperature and density","ref_index":79,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2509.04075","citing_title":"Complexity of Quadratic Quantum Chaos","ref_index":76,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14271","citing_title":"Magic and Non-Clifford Gates in Topological Quantum Field Theory","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":79,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T7A5FBJMHJJ323BHNSEYPPZQDH","json":"https://pith.science/pith/T7A5FBJMHJJ323BHNSEYPPZQDH.json","graph_json":"https://pith.science/api/pith-number/T7A5FBJMHJJ323BHNSEYPPZQDH/graph.json","events_json":"https://pith.science/api/pith-number/T7A5FBJMHJJ323BHNSEYPPZQDH/events.json","paper":"https://pith.science/paper/T7A5FBJM"},"agent_actions":{"view_html":"https://pith.science/pith/T7A5FBJMHJJ323BHNSEYPPZQDH","download_json":"https://pith.science/pith/T7A5FBJMHJJ323BHNSEYPPZQDH.json","view_paper":"https://pith.science/paper/T7A5FBJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0406196&json=true","fetch_graph":"https://pith.science/api/pith-number/T7A5FBJMHJJ323BHNSEYPPZQDH/graph.json","fetch_events":"https://pith.science/api/pith-number/T7A5FBJMHJJ323BHNSEYPPZQDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7A5FBJMHJJ323BHNSEYPPZQDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7A5FBJMHJJ323BHNSEYPPZQDH/action/storage_attestation","attest_author":"https://pith.science/pith/T7A5FBJMHJJ323BHNSEYPPZQDH/action/author_attestation","sign_citation":"https://pith.science/pith/T7A5FBJMHJJ323BHNSEYPPZQDH/action/citation_signature","submit_replication":"https://pith.science/pith/T7A5FBJMHJJ323BHNSEYPPZQDH/action/replication_record"}},"created_at":"2026-07-04T16:50:20.052130+00:00","updated_at":"2026-07-04T16:50:20.052130+00:00"}