{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:MGUEDPU6KPQGJOE3I25NJGUIH5","short_pith_number":"pith:MGUEDPU6","schema_version":"1.0","canonical_sha256":"61a841be9e53e064b89b46bad49a883f6bfdbd3cb66e0873debd09a12f739fd5","source":{"kind":"arxiv","id":"quant-ph/9610011","version":3},"attestation_state":"computed","paper":{"title":"Threshold Accuracy for Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill, R. Laflamme, W. Zurek","submitted_at":"1996-10-08T19:50:12Z","abstract_excerpt":"We have previously (quant-ph/9608012) shown that for quantum memories and quantum communication, a state can be transmitted over arbitrary distances with error $\\epsilon$ provided each gate has error at most $c\\epsilon$. We discuss a similar concatenation technique which can be used with fault tolerant networks to achieve any desired accuracy when computing with classical initial states, provided a minimum gate accuracy can be achieved. The technique works under realistic assumptions on operational errors. These assumptions are more general than the stochastic error heuristic used in other wor"},"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/9610011","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-10-08T19:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"91573baea40b5deb0720d510b1de1efd860f68eac50031b15e1c0fa942c8456f","abstract_canon_sha256":"53a54b7e504d293dbae3499a28fbb2ea8ed96b0b0264464816e4b2286bd9efbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:07:57.889296Z","signature_b64":"8rUad/ymtN2apHDRcUAvrmqjO8/Ki72BjKfm2nin4G18DjFWbjLAg0ly2uFfuD0yM7/McP94VlyCNxyXsQrdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61a841be9e53e064b89b46bad49a883f6bfdbd3cb66e0873debd09a12f739fd5","last_reissued_at":"2026-07-04T15:07:57.888905Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:07:57.888905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold Accuracy for Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill, R. Laflamme, W. Zurek","submitted_at":"1996-10-08T19:50:12Z","abstract_excerpt":"We have previously (quant-ph/9608012) shown that for quantum memories and quantum communication, a state can be transmitted over arbitrary distances with error $\\epsilon$ provided each gate has error at most $c\\epsilon$. We discuss a similar concatenation technique which can be used with fault tolerant networks to achieve any desired accuracy when computing with classical initial states, provided a minimum gate accuracy can be achieved. The technique works under realistic assumptions on operational errors. These assumptions are more general than the stochastic error heuristic used in other wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9610011","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/9610011/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/9610011","created_at":"2026-07-04T15:07:57.888968+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9610011v3","created_at":"2026-07-04T15:07:57.888968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9610011","created_at":"2026-07-04T15:07:57.888968+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGUEDPU6KPQG","created_at":"2026-07-04T15:07:57.888968+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGUEDPU6KPQGJOE3","created_at":"2026-07-04T15:07:57.888968+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGUEDPU6","created_at":"2026-07-04T15:07:57.888968+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2604.21468","citing_title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2601.10964","citing_title":"Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":210,"is_internal_anchor":false},{"citing_arxiv_id":"quant-ph/9705052","citing_title":"Stabilizer Codes and Quantum Error Correction","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21472","citing_title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5","json":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5.json","graph_json":"https://pith.science/api/pith-number/MGUEDPU6KPQGJOE3I25NJGUIH5/graph.json","events_json":"https://pith.science/api/pith-number/MGUEDPU6KPQGJOE3I25NJGUIH5/events.json","paper":"https://pith.science/paper/MGUEDPU6"},"agent_actions":{"view_html":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5","download_json":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5.json","view_paper":"https://pith.science/paper/MGUEDPU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9610011&json=true","fetch_graph":"https://pith.science/api/pith-number/MGUEDPU6KPQGJOE3I25NJGUIH5/graph.json","fetch_events":"https://pith.science/api/pith-number/MGUEDPU6KPQGJOE3I25NJGUIH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/action/storage_attestation","attest_author":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/action/author_attestation","sign_citation":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/action/citation_signature","submit_replication":"https://pith.science/pith/MGUEDPU6KPQGJOE3I25NJGUIH5/action/replication_record"}},"created_at":"2026-07-04T15:07:57.888968+00:00","updated_at":"2026-07-04T15:07:57.888968+00:00"}