{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DHEW3WOULZFWWDWZXXJ2GZRQSY","short_pith_number":"pith:DHEW3WOU","schema_version":"1.0","canonical_sha256":"19c96dd9d45e4b6b0ed9bdd3a36630962d1ce4e041d48031d0e6bfd6c16510b7","source":{"kind":"arxiv","id":"1302.3428","version":7},"attestation_state":"computed","paper":{"title":"Quantum Error Correction for Quantum Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara M. Terhal","submitted_at":"2013-02-14T15:20:12Z","abstract_excerpt":"Active quantum error correction using qubit stabilizer codes has emerged as a promising, but experimentally challenging, engineering program for building a universal quantum computer. In this review we consider the formalism of qubit stabilizer and subsystem stabilizer codes and their possible use in protecting quantum information in a quantum memory. We review the theory of fault-tolerance and quantum error-correction, discuss examples of various codes and code constructions, the general quantum error correction conditions, the noise threshold, the special role played by Clifford gates and 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":"1302.3428","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-14T15:20:12Z","cross_cats_sorted":[],"title_canon_sha256":"4ef907336faa71513e64b8c943020d5e19f31df6ca08a79b36ebfa61a1962832","abstract_canon_sha256":"6179cd226b145c68e9d4e9498a686e1f0d895c5c2e1ef11e5024365afe5ca92b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:08.681817Z","signature_b64":"N05/9tbnFoO6K+u66wdZL42+ZJfz9fs+lwq6VgF3BG/gGZ8UzqtufWlB0txIg65ctKA/ffh+QRCIY2Tik+vPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19c96dd9d45e4b6b0ed9bdd3a36630962d1ce4e041d48031d0e6bfd6c16510b7","last_reissued_at":"2026-05-18T02:19:08.681389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:08.681389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Error Correction for Quantum Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara M. Terhal","submitted_at":"2013-02-14T15:20:12Z","abstract_excerpt":"Active quantum error correction using qubit stabilizer codes has emerged as a promising, but experimentally challenging, engineering program for building a universal quantum computer. In this review we consider the formalism of qubit stabilizer and subsystem stabilizer codes and their possible use in protecting quantum information in a quantum memory. We review the theory of fault-tolerance and quantum error-correction, discuss examples of various codes and code constructions, the general quantum error correction conditions, the noise threshold, the special role played by Clifford gates and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3428","kind":"arxiv","version":7},"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":"1302.3428","created_at":"2026-05-18T02:19:08.681456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3428v7","created_at":"2026-05-18T02:19:08.681456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3428","created_at":"2026-05-18T02:19:08.681456+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHEW3WOULZFW","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHEW3WOULZFWWDWZ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHEW3WOU","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2602.14499","citing_title":"Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2603.05320","citing_title":"Simplified circuit-level decoding using Knill error correction","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DHEW3WOULZFWWDWZXXJ2GZRQSY","json":"https://pith.science/pith/DHEW3WOULZFWWDWZXXJ2GZRQSY.json","graph_json":"https://pith.science/api/pith-number/DHEW3WOULZFWWDWZXXJ2GZRQSY/graph.json","events_json":"https://pith.science/api/pith-number/DHEW3WOULZFWWDWZXXJ2GZRQSY/events.json","paper":"https://pith.science/paper/DHEW3WOU"},"agent_actions":{"view_html":"https://pith.science/pith/DHEW3WOULZFWWDWZXXJ2GZRQSY","download_json":"https://pith.science/pith/DHEW3WOULZFWWDWZXXJ2GZRQSY.json","view_paper":"https://pith.science/paper/DHEW3WOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3428&json=true","fetch_graph":"https://pith.science/api/pith-number/DHEW3WOULZFWWDWZXXJ2GZRQSY/graph.json","fetch_events":"https://pith.science/api/pith-number/DHEW3WOULZFWWDWZXXJ2GZRQSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHEW3WOULZFWWDWZXXJ2GZRQSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHEW3WOULZFWWDWZXXJ2GZRQSY/action/storage_attestation","attest_author":"https://pith.science/pith/DHEW3WOULZFWWDWZXXJ2GZRQSY/action/author_attestation","sign_citation":"https://pith.science/pith/DHEW3WOULZFWWDWZXXJ2GZRQSY/action/citation_signature","submit_replication":"https://pith.science/pith/DHEW3WOULZFWWDWZXXJ2GZRQSY/action/replication_record"}},"created_at":"2026-05-18T02:19:08.681456+00:00","updated_at":"2026-05-18T02:19:08.681456+00:00"}