{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:5AU4CLA6UBV46EEUPNS4BQ4EIT","short_pith_number":"pith:5AU4CLA6","schema_version":"1.0","canonical_sha256":"e829c12c1ea06bcf10947b65c0c38444dc926dd525885011e5cd0742e4515c4a","source":{"kind":"arxiv","id":"quant-ph/0312190","version":2},"attestation_state":"computed","paper":{"title":"Scalable Quantum Computation in the Presence of Large Detected-Error Rates","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"2003-12-23T18:43:07Z","abstract_excerpt":"The tolerable erasure error rate for scalable quantum computation is shown to be at least 0.292, given standard scalability assumptions. This bound is obtained by implementing computations with generic stabilizer code teleportation steps that combine the necessary operations with error correction. An interesting consequence of the technique is that the only errors that affect the maximum tolerable error rate are storage and Bell measurement errors. If storage errors are negligible, then any detected Bell measurement error below 1/2 is permissible. Another consequence of the technique is that 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/0312190","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-12-23T18:43:07Z","cross_cats_sorted":[],"title_canon_sha256":"1fe50eefa77760f6808922b055f91f193d426634f97a26465b1db2ffee9024e5","abstract_canon_sha256":"7727241849f2e014f748649722cced53fc2a7237fe7c672ff4fdc1e337c536a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:29.396255Z","signature_b64":"xa4zyj5GczZJR3YbYZFhfMn1udLj5oD2ovbexNAg/WKHxSGpWcq8CBrqP8Ev7S030/uVimbUxqaTtnuXDWsbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e829c12c1ea06bcf10947b65c0c38444dc926dd525885011e5cd0742e4515c4a","last_reissued_at":"2026-07-04T14:46:29.395850Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:29.395850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Quantum Computation in the Presence of Large Detected-Error Rates","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"2003-12-23T18:43:07Z","abstract_excerpt":"The tolerable erasure error rate for scalable quantum computation is shown to be at least 0.292, given standard scalability assumptions. This bound is obtained by implementing computations with generic stabilizer code teleportation steps that combine the necessary operations with error correction. An interesting consequence of the technique is that the only errors that affect the maximum tolerable error rate are storage and Bell measurement errors. If storage errors are negligible, then any detected Bell measurement error below 1/2 is permissible. Another consequence of the technique is that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0312190","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/0312190/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/0312190","created_at":"2026-07-04T14:46:29.395917+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0312190v2","created_at":"2026-07-04T14:46:29.395917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0312190","created_at":"2026-07-04T14:46:29.395917+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AU4CLA6UBV4","created_at":"2026-07-04T14:46:29.395917+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AU4CLA6UBV46EEU","created_at":"2026-07-04T14:46:29.395917+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AU4CLA6","created_at":"2026-07-04T14:46:29.395917+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.24501","citing_title":"Performance Limits of Fault-Tolerant Quantum Error Correction Schemes","ref_index":45,"is_internal_anchor":true},{"citing_arxiv_id":"2404.02280","citing_title":"Demonstration of logical qubits and repeated error correction with better-than-physical error rates","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5AU4CLA6UBV46EEUPNS4BQ4EIT","json":"https://pith.science/pith/5AU4CLA6UBV46EEUPNS4BQ4EIT.json","graph_json":"https://pith.science/api/pith-number/5AU4CLA6UBV46EEUPNS4BQ4EIT/graph.json","events_json":"https://pith.science/api/pith-number/5AU4CLA6UBV46EEUPNS4BQ4EIT/events.json","paper":"https://pith.science/paper/5AU4CLA6"},"agent_actions":{"view_html":"https://pith.science/pith/5AU4CLA6UBV46EEUPNS4BQ4EIT","download_json":"https://pith.science/pith/5AU4CLA6UBV46EEUPNS4BQ4EIT.json","view_paper":"https://pith.science/paper/5AU4CLA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0312190&json=true","fetch_graph":"https://pith.science/api/pith-number/5AU4CLA6UBV46EEUPNS4BQ4EIT/graph.json","fetch_events":"https://pith.science/api/pith-number/5AU4CLA6UBV46EEUPNS4BQ4EIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AU4CLA6UBV46EEUPNS4BQ4EIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AU4CLA6UBV46EEUPNS4BQ4EIT/action/storage_attestation","attest_author":"https://pith.science/pith/5AU4CLA6UBV46EEUPNS4BQ4EIT/action/author_attestation","sign_citation":"https://pith.science/pith/5AU4CLA6UBV46EEUPNS4BQ4EIT/action/citation_signature","submit_replication":"https://pith.science/pith/5AU4CLA6UBV46EEUPNS4BQ4EIT/action/replication_record"}},"created_at":"2026-07-04T14:46:29.395917+00:00","updated_at":"2026-07-04T14:46:29.395917+00:00"}