{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XDWPZGQHWVHT533FLM2JV44H5L","short_pith_number":"pith:XDWPZGQH","schema_version":"1.0","canonical_sha256":"b8ecfc9a07b54f3eef655b349af387eac872e078113e160bdf0eb454fa9683c8","source":{"kind":"arxiv","id":"1601.07601","version":3},"attestation_state":"computed","paper":{"title":"Improved classical simulation of quantum circuits dominated by Clifford gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gosset, Sergey Bravyi","submitted_at":"2016-01-27T23:54:12Z","abstract_excerpt":"The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates, where T is the single-qubit 45-degree phase shift. We assume that the circuit outputs a bit string x obtained by measuring some subset of w qubits. Two simulation tasks are considered: (1) computing the probability of a given output x, and (2) sampling x from the output probability distribution. It is shown that these tasks can be solved on a classical computer"},"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":"1601.07601","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-01-27T23:54:12Z","cross_cats_sorted":[],"title_canon_sha256":"875deb2a08f2f7a89fd44f936a035d5b8728ee995c9dae1023357b38d9c9a6ce","abstract_canon_sha256":"026da54446dca439a0e60dbb69ed7c10a12f2fb978a8691397afb7f6ab56e5e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:58.112490Z","signature_b64":"nAXyVCZ62v5mCeDxs9xcv+wiWvBoK3BHq+D3JfSy6lEbAm7bcLX1mDekj7hUuzn8/DNq6d7Q7LqSWeJCPcXzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8ecfc9a07b54f3eef655b349af387eac872e078113e160bdf0eb454fa9683c8","last_reissued_at":"2026-05-17T23:48:58.111894Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:58.111894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved classical simulation of quantum circuits dominated by Clifford gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gosset, Sergey Bravyi","submitted_at":"2016-01-27T23:54:12Z","abstract_excerpt":"The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates, where T is the single-qubit 45-degree phase shift. We assume that the circuit outputs a bit string x obtained by measuring some subset of w qubits. Two simulation tasks are considered: (1) computing the probability of a given output x, and (2) sampling x from the output probability distribution. It is shown that these tasks can be solved on a classical computer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07601","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":"1601.07601","created_at":"2026-05-17T23:48:58.111989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07601v3","created_at":"2026-05-17T23:48:58.111989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07601","created_at":"2026-05-17T23:48:58.111989+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDWPZGQHWVHT","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDWPZGQHWVHT533F","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDWPZGQH","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2603.08841","citing_title":"Universal Non-stabilizerness Dynamics Across Quantum Phase Transitions","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2512.05210","citing_title":"A Framework for Quantum Simulations of Energy-Loss and Hadronization in Non-Abelian Gauge Theories: SU(2) Lattice Gauge Theory in 1+1D","ref_index":146,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XDWPZGQHWVHT533FLM2JV44H5L","json":"https://pith.science/pith/XDWPZGQHWVHT533FLM2JV44H5L.json","graph_json":"https://pith.science/api/pith-number/XDWPZGQHWVHT533FLM2JV44H5L/graph.json","events_json":"https://pith.science/api/pith-number/XDWPZGQHWVHT533FLM2JV44H5L/events.json","paper":"https://pith.science/paper/XDWPZGQH"},"agent_actions":{"view_html":"https://pith.science/pith/XDWPZGQHWVHT533FLM2JV44H5L","download_json":"https://pith.science/pith/XDWPZGQHWVHT533FLM2JV44H5L.json","view_paper":"https://pith.science/paper/XDWPZGQH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07601&json=true","fetch_graph":"https://pith.science/api/pith-number/XDWPZGQHWVHT533FLM2JV44H5L/graph.json","fetch_events":"https://pith.science/api/pith-number/XDWPZGQHWVHT533FLM2JV44H5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDWPZGQHWVHT533FLM2JV44H5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDWPZGQHWVHT533FLM2JV44H5L/action/storage_attestation","attest_author":"https://pith.science/pith/XDWPZGQHWVHT533FLM2JV44H5L/action/author_attestation","sign_citation":"https://pith.science/pith/XDWPZGQHWVHT533FLM2JV44H5L/action/citation_signature","submit_replication":"https://pith.science/pith/XDWPZGQHWVHT533FLM2JV44H5L/action/replication_record"}},"created_at":"2026-05-17T23:48:58.111989+00:00","updated_at":"2026-05-17T23:48:58.111989+00:00"}