{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:ND6GRHEX43BX7JDPQNZM6CAKXO","short_pith_number":"pith:ND6GRHEX","schema_version":"1.0","canonical_sha256":"68fc689c97e6c37fa46f8372cf080abb83f217b0fb353fcff35589ae6dc9c021","source":{"kind":"arxiv","id":"quant-ph/0404104","version":1},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Postselected Quantum Computation: Threshold Analysis","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"2004-04-19T21:17:56Z","abstract_excerpt":"The schemes for fault-tolerant postselected quantum computation given in [Knill, Fault-Tolerant Postselected Quantum Computation: Schemes, http://arxiv.org/abs/quant-ph/0402171] are analyzed to determine their error-tolerance. The analysis is based on computer-assisted heuristics. It indicates that if classical and quantum communication delays are negligible, then scalable qubit-based quantum computation is possible with errors above 1% per elementary quantum gate."},"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/0404104","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-04-19T21:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"089c5942436abca94e466fa172ba68d31ecf2cb74e0da82c7eaa5e3aaf754c1b","abstract_canon_sha256":"b95f75f80b3d3ddd2deba4c2f90497bc9e17c8b0cdb294b4719ce670c0f24601"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:34.497610Z","signature_b64":"T7xrevjhS8OvKKTsp1PCqdRGcp5hW75q7ndW/5ZpuCGsaO4jEq/YnZ431YPw0FnzxAlSJeT4E4zU27wCbW5qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68fc689c97e6c37fa46f8372cf080abb83f217b0fb353fcff35589ae6dc9c021","last_reissued_at":"2026-07-04T14:46:34.497248Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:34.497248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Postselected Quantum Computation: Threshold Analysis","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"2004-04-19T21:17:56Z","abstract_excerpt":"The schemes for fault-tolerant postselected quantum computation given in [Knill, Fault-Tolerant Postselected Quantum Computation: Schemes, http://arxiv.org/abs/quant-ph/0402171] are analyzed to determine their error-tolerance. The analysis is based on computer-assisted heuristics. It indicates that if classical and quantum communication delays are negligible, then scalable qubit-based quantum computation is possible with errors above 1% per elementary quantum gate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0404104","kind":"arxiv","version":1},"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/0404104/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/0404104","created_at":"2026-07-04T14:46:34.497319+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0404104v1","created_at":"2026-07-04T14:46:34.497319+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0404104","created_at":"2026-07-04T14:46:34.497319+00:00"},{"alias_kind":"pith_short_12","alias_value":"ND6GRHEX43BX","created_at":"2026-07-04T14:46:34.497319+00:00"},{"alias_kind":"pith_short_16","alias_value":"ND6GRHEX43BX7JDP","created_at":"2026-07-04T14:46:34.497319+00:00"},{"alias_kind":"pith_short_8","alias_value":"ND6GRHEX","created_at":"2026-07-04T14:46:34.497319+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2606.20441","citing_title":"Computing noise-canceling observables via Pauli propagation","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2506.01204","citing_title":"Quantum-Classical Embedding via Ghost Gutzwiller Approximation for Enhanced Simulations of Correlated Electron Systems","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2510.26497","citing_title":"Certification and Classification of Linear Quantum Error Mitigation Methods","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2603.05320","citing_title":"Simplified circuit-level decoding using Knill error correction","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06284","citing_title":"Local distillation from Reed Muller codes unfolding","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ND6GRHEX43BX7JDPQNZM6CAKXO","json":"https://pith.science/pith/ND6GRHEX43BX7JDPQNZM6CAKXO.json","graph_json":"https://pith.science/api/pith-number/ND6GRHEX43BX7JDPQNZM6CAKXO/graph.json","events_json":"https://pith.science/api/pith-number/ND6GRHEX43BX7JDPQNZM6CAKXO/events.json","paper":"https://pith.science/paper/ND6GRHEX"},"agent_actions":{"view_html":"https://pith.science/pith/ND6GRHEX43BX7JDPQNZM6CAKXO","download_json":"https://pith.science/pith/ND6GRHEX43BX7JDPQNZM6CAKXO.json","view_paper":"https://pith.science/paper/ND6GRHEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0404104&json=true","fetch_graph":"https://pith.science/api/pith-number/ND6GRHEX43BX7JDPQNZM6CAKXO/graph.json","fetch_events":"https://pith.science/api/pith-number/ND6GRHEX43BX7JDPQNZM6CAKXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ND6GRHEX43BX7JDPQNZM6CAKXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ND6GRHEX43BX7JDPQNZM6CAKXO/action/storage_attestation","attest_author":"https://pith.science/pith/ND6GRHEX43BX7JDPQNZM6CAKXO/action/author_attestation","sign_citation":"https://pith.science/pith/ND6GRHEX43BX7JDPQNZM6CAKXO/action/citation_signature","submit_replication":"https://pith.science/pith/ND6GRHEX43BX7JDPQNZM6CAKXO/action/replication_record"}},"created_at":"2026-07-04T14:46:34.497319+00:00","updated_at":"2026-07-04T14:46:34.497319+00:00"}