{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:Q7QDHAVMTGPUMZYLQ6YSAPQEQO","short_pith_number":"pith:Q7QDHAVM","schema_version":"1.0","canonical_sha256":"87e03382ac999f46670b87b1203e04838c046abebcc91a067c30fce95727326a","source":{"kind":"arxiv","id":"quant-ph/0703264","version":2},"attestation_state":"computed","paper":{"title":"Accuracy threshold for postselected quantum computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, John Preskill, Panos Aliferis","submitted_at":"2007-03-28T20:19:39Z","abstract_excerpt":"We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla states are protected by a concatenated error-detecting code and the preparation is aborted if an error is detected. The proof applies to independent stochastic noise but (in contrast to proofs of the quantum accuracy threshold theorem based on concatenated error-correcting codes) not to strongly-correlated adversarial noise. Our rigorously established lower "},"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/0703264","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-03-28T20:19:39Z","cross_cats_sorted":[],"title_canon_sha256":"13440437453942a7d85769620a8a79f119fa480c76a3b781055fb0401cd214fe","abstract_canon_sha256":"30ef15485286841ffeb921dab07dd31665a12399efedf22575b8d1c61df6da21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:09:50.769894Z","signature_b64":"Cb00VQvjivWawIJhWX+XumQ3PT5lNG2eb6/UV9E9EXa0kyYnyWtjXz5fJjgvxCIkWtdUOH9sGfbp6RAEeDtnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87e03382ac999f46670b87b1203e04838c046abebcc91a067c30fce95727326a","last_reissued_at":"2026-07-04T15:09:50.769506Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:09:50.769506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accuracy threshold for postselected quantum computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, John Preskill, Panos Aliferis","submitted_at":"2007-03-28T20:19:39Z","abstract_excerpt":"We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla states are protected by a concatenated error-detecting code and the preparation is aborted if an error is detected. The proof applies to independent stochastic noise but (in contrast to proofs of the quantum accuracy threshold theorem based on concatenated error-correcting codes) not to strongly-correlated adversarial noise. Our rigorously established lower "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0703264","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/0703264/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/0703264","created_at":"2026-07-04T15:09:50.769563+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0703264v2","created_at":"2026-07-04T15:09:50.769563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0703264","created_at":"2026-07-04T15:09:50.769563+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7QDHAVMTGPU","created_at":"2026-07-04T15:09:50.769563+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7QDHAVMTGPUMZYL","created_at":"2026-07-04T15:09:50.769563+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7QDHAVM","created_at":"2026-07-04T15:09:50.769563+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.08758","citing_title":"Neural network decoder confidence as a learned proxy for the logical gap","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q7QDHAVMTGPUMZYLQ6YSAPQEQO","json":"https://pith.science/pith/Q7QDHAVMTGPUMZYLQ6YSAPQEQO.json","graph_json":"https://pith.science/api/pith-number/Q7QDHAVMTGPUMZYLQ6YSAPQEQO/graph.json","events_json":"https://pith.science/api/pith-number/Q7QDHAVMTGPUMZYLQ6YSAPQEQO/events.json","paper":"https://pith.science/paper/Q7QDHAVM"},"agent_actions":{"view_html":"https://pith.science/pith/Q7QDHAVMTGPUMZYLQ6YSAPQEQO","download_json":"https://pith.science/pith/Q7QDHAVMTGPUMZYLQ6YSAPQEQO.json","view_paper":"https://pith.science/paper/Q7QDHAVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0703264&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7QDHAVMTGPUMZYLQ6YSAPQEQO/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7QDHAVMTGPUMZYLQ6YSAPQEQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7QDHAVMTGPUMZYLQ6YSAPQEQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7QDHAVMTGPUMZYLQ6YSAPQEQO/action/storage_attestation","attest_author":"https://pith.science/pith/Q7QDHAVMTGPUMZYLQ6YSAPQEQO/action/author_attestation","sign_citation":"https://pith.science/pith/Q7QDHAVMTGPUMZYLQ6YSAPQEQO/action/citation_signature","submit_replication":"https://pith.science/pith/Q7QDHAVMTGPUMZYLQ6YSAPQEQO/action/replication_record"}},"created_at":"2026-07-04T15:09:50.769563+00:00","updated_at":"2026-07-04T15:09:50.769563+00:00"}