{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1995:NTHEFXPTLQEDSLE5LT6ELAMLED","short_pith_number":"pith:NTHEFXPT","schema_version":"1.0","canonical_sha256":"6cce42ddf35c08392c9d5cfc45818b20ea6f54cb73796fd290e7febc929abf55","source":{"kind":"arxiv","id":"quant-ph/9512032","version":2},"attestation_state":"computed","paper":{"title":"Good Quantum Error-Correcting Codes Exist","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. R. Calderbank, Peter W. Shor (AT&T Research)","submitted_at":"1995-12-30T21:31:00Z","abstract_excerpt":"A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used to faithfully reconstruct the original quantum state of the k encoded qubits. Quantum error-correcting codes are shown to exist with asymptotic rate k/n = 1 - 2H(2t/n) where H(p) is the binary entropy function -p log p - (1-p) log (1-p). Upper bounds on this asymptotic rate are given."},"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/9512032","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1995-12-30T21:31:00Z","cross_cats_sorted":[],"title_canon_sha256":"fd00763dab4a7b56a06e00397974cf7411bb891f9125bf54a95cec425d0730ce","abstract_canon_sha256":"9f92a932eae6df7eda5b7f23c5930efeab74d209c3af8c82bd1f236a44cbbf20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:59:58.200190Z","signature_b64":"BLDTxdp96fz1AL+TBZt61pOZJSej1FjA7/Ep0UNO3T3qkN4xgVDlsVvFgA4sRTieDxGa0ND0QtOYACJG4QSmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cce42ddf35c08392c9d5cfc45818b20ea6f54cb73796fd290e7febc929abf55","last_reissued_at":"2026-07-04T15:59:58.199829Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:59:58.199829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Good Quantum Error-Correcting Codes Exist","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. R. Calderbank, Peter W. Shor (AT&T Research)","submitted_at":"1995-12-30T21:31:00Z","abstract_excerpt":"A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used to faithfully reconstruct the original quantum state of the k encoded qubits. Quantum error-correcting codes are shown to exist with asymptotic rate k/n = 1 - 2H(2t/n) where H(p) is the binary entropy function -p log p - (1-p) log (1-p). Upper bounds on this asymptotic rate are given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9512032","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9512032/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/9512032","created_at":"2026-07-04T15:59:58.199881+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9512032v2","created_at":"2026-07-04T15:59:58.199881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9512032","created_at":"2026-07-04T15:59:58.199881+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTHEFXPTLQED","created_at":"2026-07-04T15:59:58.199881+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTHEFXPTLQEDSLE5","created_at":"2026-07-04T15:59:58.199881+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTHEFXPT","created_at":"2026-07-04T15:59:58.199881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.31428","citing_title":"The limits of erasure-based postselection for quantum error mitigation","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2304.04743","citing_title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2602.14499","citing_title":"Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.06087","citing_title":"Gauss law codes and vacuum codes from lattice gauge theories","ref_index":86,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NTHEFXPTLQEDSLE5LT6ELAMLED","json":"https://pith.science/pith/NTHEFXPTLQEDSLE5LT6ELAMLED.json","graph_json":"https://pith.science/api/pith-number/NTHEFXPTLQEDSLE5LT6ELAMLED/graph.json","events_json":"https://pith.science/api/pith-number/NTHEFXPTLQEDSLE5LT6ELAMLED/events.json","paper":"https://pith.science/paper/NTHEFXPT"},"agent_actions":{"view_html":"https://pith.science/pith/NTHEFXPTLQEDSLE5LT6ELAMLED","download_json":"https://pith.science/pith/NTHEFXPTLQEDSLE5LT6ELAMLED.json","view_paper":"https://pith.science/paper/NTHEFXPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9512032&json=true","fetch_graph":"https://pith.science/api/pith-number/NTHEFXPTLQEDSLE5LT6ELAMLED/graph.json","fetch_events":"https://pith.science/api/pith-number/NTHEFXPTLQEDSLE5LT6ELAMLED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTHEFXPTLQEDSLE5LT6ELAMLED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTHEFXPTLQEDSLE5LT6ELAMLED/action/storage_attestation","attest_author":"https://pith.science/pith/NTHEFXPTLQEDSLE5LT6ELAMLED/action/author_attestation","sign_citation":"https://pith.science/pith/NTHEFXPTLQEDSLE5LT6ELAMLED/action/citation_signature","submit_replication":"https://pith.science/pith/NTHEFXPTLQEDSLE5LT6ELAMLED/action/replication_record"}},"created_at":"2026-07-04T15:59:58.199881+00:00","updated_at":"2026-07-04T15:59:58.199881+00:00"}