{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:4LQPGIAFXLFRXFBHUHAQYQIH5B","short_pith_number":"pith:4LQPGIAF","schema_version":"1.0","canonical_sha256":"e2e0f32005bacb1b9427a1c10c4107e87581adda6b539bb9abc20137a3f4ff04","source":{"kind":"arxiv","id":"quant-ph/9608012","version":1},"attestation_state":"computed","paper":{"title":"Concatenated Quantum Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Emanuel Knill, Raymond Laflamme","submitted_at":"1996-08-08T23:13:46Z","abstract_excerpt":"One of the main problems for the future of practical quantum computing is to stabilize the computation against unwanted interactions with the environment and imperfections in the applied operations. Existing proposals for quantum memories and quantum channels require gates with asymptotically zero error to store or transmit an input quantum state for arbitrarily long times or distances with fixed error. In this report a method is given which has the property that to store or transmit a qubit with maximum error $\\epsilon$ requires gates with error at most $c\\epsilon$ and storage or channel elem"},"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/9608012","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-08-08T23:13:46Z","cross_cats_sorted":[],"title_canon_sha256":"ebc511219009156310cc7a2773ee71cb5daf84ed449da4f2a236a432db021d4a","abstract_canon_sha256":"b4099c4af7cb745e33d229cecac7cf0896ee29090746633e8076f773ca6f20a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:05.145091Z","signature_b64":"XIF+vG1uK6kN3k1ilYqAYysLLiqPKi5trZ4o09hBTmOTaJaH/Dvapohuk7cmPNR6HYHQllTtLPWbQTEFYA2HBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2e0f32005bacb1b9427a1c10c4107e87581adda6b539bb9abc20137a3f4ff04","last_reissued_at":"2026-07-04T14:47:05.144727Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:05.144727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concatenated Quantum Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Emanuel Knill, Raymond Laflamme","submitted_at":"1996-08-08T23:13:46Z","abstract_excerpt":"One of the main problems for the future of practical quantum computing is to stabilize the computation against unwanted interactions with the environment and imperfections in the applied operations. Existing proposals for quantum memories and quantum channels require gates with asymptotically zero error to store or transmit an input quantum state for arbitrarily long times or distances with fixed error. In this report a method is given which has the property that to store or transmit a qubit with maximum error $\\epsilon$ requires gates with error at most $c\\epsilon$ and storage or channel elem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9608012","kind":"arxiv","version":1},"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/9608012/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/9608012","created_at":"2026-07-04T14:47:05.144779+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9608012v1","created_at":"2026-07-04T14:47:05.144779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9608012","created_at":"2026-07-04T14:47:05.144779+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LQPGIAFXLFR","created_at":"2026-07-04T14:47:05.144779+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LQPGIAFXLFRXFBH","created_at":"2026-07-04T14:47:05.144779+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LQPGIAF","created_at":"2026-07-04T14:47:05.144779+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.15266","citing_title":"Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2506.11552","citing_title":"Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2603.08711","citing_title":"Coupled-Layer Construction of Quantum Product Codes","ref_index":52,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05870","citing_title":"Fault-Tolerant One-Shot Entanglement Generation with Constant-Sized Quantum Devices in the Plane","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14931","citing_title":"Learning to Concatenate Quantum Codes","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4LQPGIAFXLFRXFBHUHAQYQIH5B","json":"https://pith.science/pith/4LQPGIAFXLFRXFBHUHAQYQIH5B.json","graph_json":"https://pith.science/api/pith-number/4LQPGIAFXLFRXFBHUHAQYQIH5B/graph.json","events_json":"https://pith.science/api/pith-number/4LQPGIAFXLFRXFBHUHAQYQIH5B/events.json","paper":"https://pith.science/paper/4LQPGIAF"},"agent_actions":{"view_html":"https://pith.science/pith/4LQPGIAFXLFRXFBHUHAQYQIH5B","download_json":"https://pith.science/pith/4LQPGIAFXLFRXFBHUHAQYQIH5B.json","view_paper":"https://pith.science/paper/4LQPGIAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9608012&json=true","fetch_graph":"https://pith.science/api/pith-number/4LQPGIAFXLFRXFBHUHAQYQIH5B/graph.json","fetch_events":"https://pith.science/api/pith-number/4LQPGIAFXLFRXFBHUHAQYQIH5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LQPGIAFXLFRXFBHUHAQYQIH5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LQPGIAFXLFRXFBHUHAQYQIH5B/action/storage_attestation","attest_author":"https://pith.science/pith/4LQPGIAFXLFRXFBHUHAQYQIH5B/action/author_attestation","sign_citation":"https://pith.science/pith/4LQPGIAFXLFRXFBHUHAQYQIH5B/action/citation_signature","submit_replication":"https://pith.science/pith/4LQPGIAFXLFRXFBHUHAQYQIH5B/action/replication_record"}},"created_at":"2026-07-04T14:47:05.144779+00:00","updated_at":"2026-07-04T14:47:05.144779+00:00"}