{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:CMDQ5MS4KS5ESRI3EQTW3IIUZT","short_pith_number":"pith:CMDQ5MS4","schema_version":"1.0","canonical_sha256":"13070eb25c54ba49451b24276da114ccc39dd052e75a9bff14cec2935ff86f01","source":{"kind":"arxiv","id":"0908.3932","version":2},"attestation_state":"computed","paper":{"title":"Fault Tolerance in Parity-State Linear Optical Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. J. F. Hayes, Alexei Gilchrist, H. L. Haselgrove, T. C. Ralph","submitted_at":"2009-08-27T03:09:26Z","abstract_excerpt":"We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct errors arising from the inherent nondeterminism of two-qubit linear-optical gates. When combined with teleported error-correction (using either a Steane or Golay code) at higher levels of concatenation, the parity-state scheme is found to achieve a saving of approximately three orders of magnitude "},"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":"0908.3932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-08-27T03:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"702370b463da20fcfb991f4ce5ac094ef821af3d54a08a4d89ceb2039adf761c","abstract_canon_sha256":"db772f309fb4a97818aa96b4dd9292e7a634622fd916fec487c5b6a22912f80b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:23:57.995574Z","signature_b64":"mikGQzp97FqjLs2qRv/ZUc3AoJxFkI9UdV60kxWJuTAA5sQh6Fxi/xXuJZcnEf9asjQ6UqVoDc264M88CSvcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13070eb25c54ba49451b24276da114ccc39dd052e75a9bff14cec2935ff86f01","last_reissued_at":"2026-05-18T03:23:57.995127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:23:57.995127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault Tolerance in Parity-State Linear Optical Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. J. F. Hayes, Alexei Gilchrist, H. L. Haselgrove, T. C. Ralph","submitted_at":"2009-08-27T03:09:26Z","abstract_excerpt":"We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct errors arising from the inherent nondeterminism of two-qubit linear-optical gates. When combined with teleported error-correction (using either a Steane or Golay code) at higher levels of concatenation, the parity-state scheme is found to achieve a saving of approximately three orders of magnitude "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3932","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":""},"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":"0908.3932","created_at":"2026-05-18T03:23:57.995191+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.3932v2","created_at":"2026-05-18T03:23:57.995191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3932","created_at":"2026-05-18T03:23:57.995191+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMDQ5MS4KS5E","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMDQ5MS4KS5ESRI3","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMDQ5MS4","created_at":"2026-05-18T12:25:59.703012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CMDQ5MS4KS5ESRI3EQTW3IIUZT","json":"https://pith.science/pith/CMDQ5MS4KS5ESRI3EQTW3IIUZT.json","graph_json":"https://pith.science/api/pith-number/CMDQ5MS4KS5ESRI3EQTW3IIUZT/graph.json","events_json":"https://pith.science/api/pith-number/CMDQ5MS4KS5ESRI3EQTW3IIUZT/events.json","paper":"https://pith.science/paper/CMDQ5MS4"},"agent_actions":{"view_html":"https://pith.science/pith/CMDQ5MS4KS5ESRI3EQTW3IIUZT","download_json":"https://pith.science/pith/CMDQ5MS4KS5ESRI3EQTW3IIUZT.json","view_paper":"https://pith.science/paper/CMDQ5MS4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.3932&json=true","fetch_graph":"https://pith.science/api/pith-number/CMDQ5MS4KS5ESRI3EQTW3IIUZT/graph.json","fetch_events":"https://pith.science/api/pith-number/CMDQ5MS4KS5ESRI3EQTW3IIUZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMDQ5MS4KS5ESRI3EQTW3IIUZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMDQ5MS4KS5ESRI3EQTW3IIUZT/action/storage_attestation","attest_author":"https://pith.science/pith/CMDQ5MS4KS5ESRI3EQTW3IIUZT/action/author_attestation","sign_citation":"https://pith.science/pith/CMDQ5MS4KS5ESRI3EQTW3IIUZT/action/citation_signature","submit_replication":"https://pith.science/pith/CMDQ5MS4KS5ESRI3EQTW3IIUZT/action/replication_record"}},"created_at":"2026-05-18T03:23:57.995191+00:00","updated_at":"2026-05-18T03:23:57.995191+00:00"}