{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P3NNUOKJU7SKJATKWLO2VZ5CJP","short_pith_number":"pith:P3NNUOKJ","schema_version":"1.0","canonical_sha256":"7edada3949a7e4a4826ab2ddaae7a24bf3807359c7c8b4dccdd779ba45579413","source":{"kind":"arxiv","id":"2503.10790","version":2},"attestation_state":"computed","paper":{"title":"Quantum Error Detection For Early Term Fault-Tolerant Quantum Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Tom Ginsberg, Vyom Patel","submitted_at":"2025-03-13T18:34:01Z","abstract_excerpt":"Quantum error detection (QED) offers a promising pathway to fault tolerance in near-term quantum devices by balancing error suppression with minimal resource overhead. However, its practical utility hinges on optimizing design parameters-such as syndrome measurement frequency-to avoid diminishing returns from detection overhead. In this work, we present a comprehensive framework for fault-tolerant compilation and simulation of quantum algorithms using [[n, n-2, 2]] codes, which enable low-qubit-overhead error detection and a simple nearly fault-tolerant universal set of operations. We demonstr"},"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":"2503.10790","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-13T18:34:01Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"67d8ccd78d3a1acb97af53ab23f45cb521628bc8f664ffc5028105088b4f1722","abstract_canon_sha256":"6731430ddc6323ec94abf8c3871e7d15d35790f6c6968e16f2999498d0a4279c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:36.526612Z","signature_b64":"+53qdSVowpqIqbDbCU3gwqqMcVizkRNi3cN61yp+gFSn76yczTPWe19UMpF+ISCwW0pJlbmXr/hJq3JIT99jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7edada3949a7e4a4826ab2ddaae7a24bf3807359c7c8b4dccdd779ba45579413","last_reissued_at":"2026-07-05T10:47:36.526128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:36.526128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Error Detection For Early Term Fault-Tolerant Quantum Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Tom Ginsberg, Vyom Patel","submitted_at":"2025-03-13T18:34:01Z","abstract_excerpt":"Quantum error detection (QED) offers a promising pathway to fault tolerance in near-term quantum devices by balancing error suppression with minimal resource overhead. However, its practical utility hinges on optimizing design parameters-such as syndrome measurement frequency-to avoid diminishing returns from detection overhead. In this work, we present a comprehensive framework for fault-tolerant compilation and simulation of quantum algorithms using [[n, n-2, 2]] codes, which enable low-qubit-overhead error detection and a simple nearly fault-tolerant universal set of operations. We demonstr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10790","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/2503.10790/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":"2503.10790","created_at":"2026-07-05T10:47:36.526184+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.10790v2","created_at":"2026-07-05T10:47:36.526184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10790","created_at":"2026-07-05T10:47:36.526184+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3NNUOKJU7SK","created_at":"2026-07-05T10:47:36.526184+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3NNUOKJU7SKJATK","created_at":"2026-07-05T10:47:36.526184+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3NNUOKJ","created_at":"2026-07-05T10:47:36.526184+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07666","citing_title":"Hardware-aware Low-latency Quantum Compilation with Data-driven Lightweight Error Detection for Early Fault-Tolerant Systems","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2504.21172","citing_title":"Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2603.15610","citing_title":"Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09956","citing_title":"Logical Compilation for Multi-Qubit Iceberg Patches","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P3NNUOKJU7SKJATKWLO2VZ5CJP","json":"https://pith.science/pith/P3NNUOKJU7SKJATKWLO2VZ5CJP.json","graph_json":"https://pith.science/api/pith-number/P3NNUOKJU7SKJATKWLO2VZ5CJP/graph.json","events_json":"https://pith.science/api/pith-number/P3NNUOKJU7SKJATKWLO2VZ5CJP/events.json","paper":"https://pith.science/paper/P3NNUOKJ"},"agent_actions":{"view_html":"https://pith.science/pith/P3NNUOKJU7SKJATKWLO2VZ5CJP","download_json":"https://pith.science/pith/P3NNUOKJU7SKJATKWLO2VZ5CJP.json","view_paper":"https://pith.science/paper/P3NNUOKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.10790&json=true","fetch_graph":"https://pith.science/api/pith-number/P3NNUOKJU7SKJATKWLO2VZ5CJP/graph.json","fetch_events":"https://pith.science/api/pith-number/P3NNUOKJU7SKJATKWLO2VZ5CJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3NNUOKJU7SKJATKWLO2VZ5CJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3NNUOKJU7SKJATKWLO2VZ5CJP/action/storage_attestation","attest_author":"https://pith.science/pith/P3NNUOKJU7SKJATKWLO2VZ5CJP/action/author_attestation","sign_citation":"https://pith.science/pith/P3NNUOKJU7SKJATKWLO2VZ5CJP/action/citation_signature","submit_replication":"https://pith.science/pith/P3NNUOKJU7SKJATKWLO2VZ5CJP/action/replication_record"}},"created_at":"2026-07-05T10:47:36.526184+00:00","updated_at":"2026-07-05T10:47:36.526184+00:00"}