{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:XZSS5H5OL725LE7TNDXYWDISHW","short_pith_number":"pith:XZSS5H5O","schema_version":"1.0","canonical_sha256":"be652e9fae5ff5d593f368ef8b0d123dae627e507f991f4596b216d9277c0792","source":{"kind":"arxiv","id":"quant-ph/9612028","version":2},"attestation_state":"computed","paper":{"title":"Threshold Estimate for Fault Tolerant Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christof Zalka (T-6 LANL)","submitted_at":"1996-12-08T23:37:43Z","abstract_excerpt":"I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor (quant-ph/9505011) for fault tolerant error correction (FTEC) and the fault tolerant implementation of elementary operations on states encoded by the 7-qubit code. A simple computer simulation suggests a threshold for gate errors of the order \\epsilon \\approx 10^{-3} or better. I also give a simple argument that the threshold for memory errors is about 10 times smaller, thus \\epsilon "},"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/9612028","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-12-08T23:37:43Z","cross_cats_sorted":[],"title_canon_sha256":"de9fe11d31b8b57edc10ea24580d3304eccc855486d4c363c3dc1ed5a8b52109","abstract_canon_sha256":"a03a7053cb9cf438208501aee3fa00f413e67729c79aa25d48ef9babd67ec51e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:08:20.441731Z","signature_b64":"686OxWFG8gHhcIBCsRiMpD/epsSA0l2LKtmkU+y1zkbOUGnfRPHJOfLoxzDHJSp7Xs02HqZWk4W2DQO3qNPcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be652e9fae5ff5d593f368ef8b0d123dae627e507f991f4596b216d9277c0792","last_reissued_at":"2026-07-04T15:08:20.441323Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:08:20.441323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold Estimate for Fault Tolerant Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christof Zalka (T-6 LANL)","submitted_at":"1996-12-08T23:37:43Z","abstract_excerpt":"I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor (quant-ph/9505011) for fault tolerant error correction (FTEC) and the fault tolerant implementation of elementary operations on states encoded by the 7-qubit code. A simple computer simulation suggests a threshold for gate errors of the order \\epsilon \\approx 10^{-3} or better. I also give a simple argument that the threshold for memory errors is about 10 times smaller, thus \\epsilon "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9612028","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/9612028/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/9612028","created_at":"2026-07-04T15:08:20.441382+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9612028v2","created_at":"2026-07-04T15:08:20.441382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9612028","created_at":"2026-07-04T15:08:20.441382+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZSS5H5OL725","created_at":"2026-07-04T15:08:20.441382+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZSS5H5OL725LE7T","created_at":"2026-07-04T15:08:20.441382+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZSS5H5O","created_at":"2026-07-04T15:08:20.441382+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15344","citing_title":"Fire and ice: Partially fault-tolerant quantum computing with selective state filtering","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"quant-ph/9705052","citing_title":"Stabilizer Codes and Quantum Error Correction","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XZSS5H5OL725LE7TNDXYWDISHW","json":"https://pith.science/pith/XZSS5H5OL725LE7TNDXYWDISHW.json","graph_json":"https://pith.science/api/pith-number/XZSS5H5OL725LE7TNDXYWDISHW/graph.json","events_json":"https://pith.science/api/pith-number/XZSS5H5OL725LE7TNDXYWDISHW/events.json","paper":"https://pith.science/paper/XZSS5H5O"},"agent_actions":{"view_html":"https://pith.science/pith/XZSS5H5OL725LE7TNDXYWDISHW","download_json":"https://pith.science/pith/XZSS5H5OL725LE7TNDXYWDISHW.json","view_paper":"https://pith.science/paper/XZSS5H5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9612028&json=true","fetch_graph":"https://pith.science/api/pith-number/XZSS5H5OL725LE7TNDXYWDISHW/graph.json","fetch_events":"https://pith.science/api/pith-number/XZSS5H5OL725LE7TNDXYWDISHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZSS5H5OL725LE7TNDXYWDISHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZSS5H5OL725LE7TNDXYWDISHW/action/storage_attestation","attest_author":"https://pith.science/pith/XZSS5H5OL725LE7TNDXYWDISHW/action/author_attestation","sign_citation":"https://pith.science/pith/XZSS5H5OL725LE7TNDXYWDISHW/action/citation_signature","submit_replication":"https://pith.science/pith/XZSS5H5OL725LE7TNDXYWDISHW/action/replication_record"}},"created_at":"2026-07-04T15:08:20.441382+00:00","updated_at":"2026-07-04T15:08:20.441382+00:00"}