{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:SSFJZ6KMHSDNPT347MUJ55P5IS","short_pith_number":"pith:SSFJZ6KM","schema_version":"1.0","canonical_sha256":"948a9cf94c3c86d7cf7cfb289ef5fd44afc7149b52588cfdfe7e5e282d10b96a","source":{"kind":"arxiv","id":"quant-ph/9702029","version":2},"attestation_state":"computed","paper":{"title":"A Theory of Fault-Tolerant Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman","submitted_at":"1997-02-12T00:48:43Z","abstract_excerpt":"In order to use quantum error-correcting codes to actually improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a general theory of fault-tolerant operations based on symmetries of the code stabilizer. This allows a straightforward determination of which operations can be performed fault-tolerantly on a given code. I demonstrate that fault-tolerant universal computation is possible for any stabilizer code. I discuss a number of examples in more detail, including the five-qubit code."},"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/9702029","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-02-12T00:48:43Z","cross_cats_sorted":[],"title_canon_sha256":"f4d123c870e3414ecf02117b165b0d2c3885a9006d2d45cb6b82463d91b93aa3","abstract_canon_sha256":"da97a1b880f7bfa61b3dffd6a1ebf56edb37876577f007fcbed614504954ea62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:25.756438Z","signature_b64":"xK6QUFK+fKIQ/ysClRkGIh2aWwXdDkhItn1MHO6u36d45QTRygK+4CTSFO9vkBYgj8fHOi6nRW+9Pn3sPBmbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"948a9cf94c3c86d7cf7cfb289ef5fd44afc7149b52588cfdfe7e5e282d10b96a","last_reissued_at":"2026-05-18T04:17:25.755798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:25.755798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theory of Fault-Tolerant Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman","submitted_at":"1997-02-12T00:48:43Z","abstract_excerpt":"In order to use quantum error-correcting codes to actually improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a general theory of fault-tolerant operations based on symmetries of the code stabilizer. This allows a straightforward determination of which operations can be performed fault-tolerantly on a given code. I demonstrate that fault-tolerant universal computation is possible for any stabilizer code. I discuss a number of examples in more detail, including the five-qubit code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9702029","kind":"arxiv","version":2},"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":"quant-ph/9702029","created_at":"2026-05-18T04:17:25.755882+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9702029v2","created_at":"2026-05-18T04:17:25.755882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9702029","created_at":"2026-05-18T04:17:25.755882+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSFJZ6KMHSDN","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSFJZ6KMHSDNPT34","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSFJZ6KM","created_at":"2026-05-18T12:25:48.327863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2306.01043","citing_title":"Clifford Orbits from Cayley Graph Quotients","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2510.10835","citing_title":"Rigorous estimation of error thresholds of transversal Clifford logical circuits","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2411.11822","citing_title":"Fault-tolerant quantum computation with a neutral atom processor","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"quant-ph/9807006","citing_title":"The Heisenberg Representation of Quantum Computers","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSFJZ6KMHSDNPT347MUJ55P5IS","json":"https://pith.science/pith/SSFJZ6KMHSDNPT347MUJ55P5IS.json","graph_json":"https://pith.science/api/pith-number/SSFJZ6KMHSDNPT347MUJ55P5IS/graph.json","events_json":"https://pith.science/api/pith-number/SSFJZ6KMHSDNPT347MUJ55P5IS/events.json","paper":"https://pith.science/paper/SSFJZ6KM"},"agent_actions":{"view_html":"https://pith.science/pith/SSFJZ6KMHSDNPT347MUJ55P5IS","download_json":"https://pith.science/pith/SSFJZ6KMHSDNPT347MUJ55P5IS.json","view_paper":"https://pith.science/paper/SSFJZ6KM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9702029&json=true","fetch_graph":"https://pith.science/api/pith-number/SSFJZ6KMHSDNPT347MUJ55P5IS/graph.json","fetch_events":"https://pith.science/api/pith-number/SSFJZ6KMHSDNPT347MUJ55P5IS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSFJZ6KMHSDNPT347MUJ55P5IS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSFJZ6KMHSDNPT347MUJ55P5IS/action/storage_attestation","attest_author":"https://pith.science/pith/SSFJZ6KMHSDNPT347MUJ55P5IS/action/author_attestation","sign_citation":"https://pith.science/pith/SSFJZ6KMHSDNPT347MUJ55P5IS/action/citation_signature","submit_replication":"https://pith.science/pith/SSFJZ6KMHSDNPT347MUJ55P5IS/action/replication_record"}},"created_at":"2026-05-18T04:17:25.755882+00:00","updated_at":"2026-05-18T04:17:25.755882+00:00"}