{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:B53SIQHTQGTJR756MZPIWKDTXU","short_pith_number":"pith:B53SIQHT","schema_version":"1.0","canonical_sha256":"0f772440f381a698ffbe665e8b2873bd397c7daeff93344fa180d22f51ba4d38","source":{"kind":"arxiv","id":"2408.14828","version":4},"attestation_state":"computed","paper":{"title":"Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher Gerhard, Todd A. Brun","submitted_at":"2024-08-27T07:25:36Z","abstract_excerpt":"Many current quantum error-correcting codes that achieve full fault tolerance suffer from having low ratios of logical to physical qubits and significant overhead. This makes them difficult to implement on current noisy intermediate-scale quantum (NISQ) computers and results in the inability to perform quantum algorithms at useful scales with near-term quantum processors. As a result, calculations are generally done without encoding. We propose a middle ground between these two approaches: constructions in the $[[n,n-2,2]]$ quantum error-detecting code that can detect any error from a single f"},"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":"2408.14828","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-27T07:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"c8e1d5e5c657f78ae8505531ea1d297f67e89e4862bf98029db3c2df6fcdde5d","abstract_canon_sha256":"649cff724254ff3cec44a3fb91ea920eebc3cf7cc86b77329b892510b1fa7139"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:40.265891Z","signature_b64":"0LqthN9GQvkOoHN9z9YNo6MV8vsJJt65z2v9h5GurJlIJPKIPiPHh8CaGtPsG+coRmdVlpJHVZOajz6JwyYCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f772440f381a698ffbe665e8b2873bd397c7daeff93344fa180d22f51ba4d38","last_reissued_at":"2026-05-22T01:03:40.264883Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:40.264883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher Gerhard, Todd A. Brun","submitted_at":"2024-08-27T07:25:36Z","abstract_excerpt":"Many current quantum error-correcting codes that achieve full fault tolerance suffer from having low ratios of logical to physical qubits and significant overhead. This makes them difficult to implement on current noisy intermediate-scale quantum (NISQ) computers and results in the inability to perform quantum algorithms at useful scales with near-term quantum processors. As a result, calculations are generally done without encoding. We propose a middle ground between these two approaches: constructions in the $[[n,n-2,2]]$ quantum error-detecting code that can detect any error from a single f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.14828","kind":"arxiv","version":4},"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/2408.14828/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":"2408.14828","created_at":"2026-05-22T01:03:40.265042+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.14828v4","created_at":"2026-05-22T01:03:40.265042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.14828","created_at":"2026-05-22T01:03:40.265042+00:00"},{"alias_kind":"pith_short_12","alias_value":"B53SIQHTQGTJ","created_at":"2026-05-22T01:03:40.265042+00:00"},{"alias_kind":"pith_short_16","alias_value":"B53SIQHTQGTJR756","created_at":"2026-05-22T01:03:40.265042+00:00"},{"alias_kind":"pith_short_8","alias_value":"B53SIQHT","created_at":"2026-05-22T01:03:40.265042+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2602.13399","citing_title":"Protection of Exponential Operation using Stabilizer Codes in the Early Fault Tolerance Era","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2603.15610","citing_title":"Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B53SIQHTQGTJR756MZPIWKDTXU","json":"https://pith.science/pith/B53SIQHTQGTJR756MZPIWKDTXU.json","graph_json":"https://pith.science/api/pith-number/B53SIQHTQGTJR756MZPIWKDTXU/graph.json","events_json":"https://pith.science/api/pith-number/B53SIQHTQGTJR756MZPIWKDTXU/events.json","paper":"https://pith.science/paper/B53SIQHT"},"agent_actions":{"view_html":"https://pith.science/pith/B53SIQHTQGTJR756MZPIWKDTXU","download_json":"https://pith.science/pith/B53SIQHTQGTJR756MZPIWKDTXU.json","view_paper":"https://pith.science/paper/B53SIQHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.14828&json=true","fetch_graph":"https://pith.science/api/pith-number/B53SIQHTQGTJR756MZPIWKDTXU/graph.json","fetch_events":"https://pith.science/api/pith-number/B53SIQHTQGTJR756MZPIWKDTXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B53SIQHTQGTJR756MZPIWKDTXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B53SIQHTQGTJR756MZPIWKDTXU/action/storage_attestation","attest_author":"https://pith.science/pith/B53SIQHTQGTJR756MZPIWKDTXU/action/author_attestation","sign_citation":"https://pith.science/pith/B53SIQHTQGTJR756MZPIWKDTXU/action/citation_signature","submit_replication":"https://pith.science/pith/B53SIQHTQGTJR756MZPIWKDTXU/action/replication_record"}},"created_at":"2026-05-22T01:03:40.265042+00:00","updated_at":"2026-05-22T01:03:40.265042+00:00"}