{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:KOYUNJROCLO3RBBNYXEZYNVILU","short_pith_number":"pith:KOYUNJRO","schema_version":"1.0","canonical_sha256":"53b146a62e12ddb8842dc5c99c36a85d17cf443777e161b02f0cd74872f3817d","source":{"kind":"arxiv","id":"quant-ph/0504218","version":3},"attestation_state":"computed","paper":{"title":"Quantum accuracy threshold for concatenated distance-3 codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, John Preskill, Panos Aliferis","submitted_at":"2005-04-28T20:12:44Z","abstract_excerpt":"We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criteria for assessing the accuracy of fault-tolerant circuits, which are particularly conducive to the inductive analysis of recursive simulations. Our lower bound on the threshold, epsilon_0 > 2.73 \\t"},"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/0504218","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-28T20:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"5bea61ef4d65e413ec08cf4e0e030b49d9e7073662c998aa5331ac85f51c81b5","abstract_canon_sha256":"5a9f2e581de05a68e9e25086087dad7bd1aa41b3b69ee69b2995ee17f8b894c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:50:19.005577Z","signature_b64":"/upYTmi9Y9/jlJ8cETgpVSr9cB4/fRC+qFfORvvumI23dlIxzEsjV06qCzGYe3BRrbiLeTJjlOtfp7mospgWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53b146a62e12ddb8842dc5c99c36a85d17cf443777e161b02f0cd74872f3817d","last_reissued_at":"2026-07-04T14:50:19.005199Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:50:19.005199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum accuracy threshold for concatenated distance-3 codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, John Preskill, Panos Aliferis","submitted_at":"2005-04-28T20:12:44Z","abstract_excerpt":"We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criteria for assessing the accuracy of fault-tolerant circuits, which are particularly conducive to the inductive analysis of recursive simulations. Our lower bound on the threshold, epsilon_0 > 2.73 \\t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504218","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0504218/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/0504218","created_at":"2026-07-04T14:50:19.005256+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504218v3","created_at":"2026-07-04T14:50:19.005256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504218","created_at":"2026-07-04T14:50:19.005256+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOYUNJROCLO3","created_at":"2026-07-04T14:50:19.005256+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOYUNJROCLO3RBBN","created_at":"2026-07-04T14:50:19.005256+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOYUNJRO","created_at":"2026-07-04T14:50:19.005256+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":6,"sample":[{"citing_arxiv_id":"2606.05664","citing_title":"Gauging the Spacetime Code","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20024","citing_title":"Simulation of Non-Markovian Quantum Accelerated Dynamics via Time-Fractional Schr\\\"odinger Equation","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"1907.05950","citing_title":"Maximally Sensitive Sets of States","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2411.01880","citing_title":"Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2510.10835","citing_title":"Rigorous estimation of error thresholds of transversal Clifford logical circuits","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2411.11822","citing_title":"Fault-tolerant quantum computation with a neutral atom processor","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":197,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00038","citing_title":"Lottery BP: Unlocking Quantum Error Decoding at Scale","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU","json":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU.json","graph_json":"https://pith.science/api/pith-number/KOYUNJROCLO3RBBNYXEZYNVILU/graph.json","events_json":"https://pith.science/api/pith-number/KOYUNJROCLO3RBBNYXEZYNVILU/events.json","paper":"https://pith.science/paper/KOYUNJRO"},"agent_actions":{"view_html":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU","download_json":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU.json","view_paper":"https://pith.science/paper/KOYUNJRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0504218&json=true","fetch_graph":"https://pith.science/api/pith-number/KOYUNJROCLO3RBBNYXEZYNVILU/graph.json","fetch_events":"https://pith.science/api/pith-number/KOYUNJROCLO3RBBNYXEZYNVILU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU/action/storage_attestation","attest_author":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU/action/author_attestation","sign_citation":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU/action/citation_signature","submit_replication":"https://pith.science/pith/KOYUNJROCLO3RBBNYXEZYNVILU/action/replication_record"}},"created_at":"2026-07-04T14:50:19.005256+00:00","updated_at":"2026-07-04T14:50:19.005256+00:00"}