{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KLPLGLCVIXC44PSGPKKZ43K2Y4","short_pith_number":"pith:KLPLGLCV","schema_version":"1.0","canonical_sha256":"52deb32c5545c5ce3e467a959e6d5ac7216dcdc876580c4963d6069b3fe7bc19","source":{"kind":"arxiv","id":"2504.15725","version":1},"attestation_state":"computed","paper":{"title":"Low-overhead error detection with spacetime codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Javadi-Abhari, Simon Martiel","submitted_at":"2025-04-22T09:20:25Z","abstract_excerpt":"We introduce a low-overhead approach for detecting errors in arbitrary Clifford circuits on arbitrary qubit connectivities. Our method is based on the framework of spacetime codes, and is particularly suited to near-term hardware since it has a much milder overhead in qubits and gates compared to error correction, while achieving a better sampling overhead than existing error mitigation methods. We present efficient algorithms for finding valid checks that are simultaneously low weight, satisfy connectivity constraints, and cover large detecting regions within the circuit. Using this approach,"},"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":"2504.15725","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-22T09:20:25Z","cross_cats_sorted":[],"title_canon_sha256":"7fbb6c9cfbb915349573a411b1d5d77fee3021d62c29233ef233d2d24cb0d51c","abstract_canon_sha256":"c1294353df2a49a3fcdb3a20e3ce6a7d51b73973c54ade56b64d418d30383bb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:28.947500Z","signature_b64":"QjcgE886Visyn7GUvwXwahipkHYy46GFb//DFYHYi5XHHPU1GQtP+Fvu0MicTriP+BaOC3pXBfCqXKaNBoRgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52deb32c5545c5ce3e467a959e6d5ac7216dcdc876580c4963d6069b3fe7bc19","last_reissued_at":"2026-07-05T10:52:28.947047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:28.947047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-overhead error detection with spacetime codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Javadi-Abhari, Simon Martiel","submitted_at":"2025-04-22T09:20:25Z","abstract_excerpt":"We introduce a low-overhead approach for detecting errors in arbitrary Clifford circuits on arbitrary qubit connectivities. Our method is based on the framework of spacetime codes, and is particularly suited to near-term hardware since it has a much milder overhead in qubits and gates compared to error correction, while achieving a better sampling overhead than existing error mitigation methods. We present efficient algorithms for finding valid checks that are simultaneously low weight, satisfy connectivity constraints, and cover large detecting regions within the circuit. Using this approach,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15725","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/2504.15725/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":"2504.15725","created_at":"2026-07-05T10:52:28.947094+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15725v1","created_at":"2026-07-05T10:52:28.947094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15725","created_at":"2026-07-05T10:52:28.947094+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLPLGLCVIXC4","created_at":"2026-07-05T10:52:28.947094+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLPLGLCVIXC44PSG","created_at":"2026-07-05T10:52:28.947094+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLPLGLCV","created_at":"2026-07-05T10:52:28.947094+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27824","citing_title":"Compressed Sensing for Efficient Fidelity Estimation of GHZ States","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02861","citing_title":"Opportunities and challenges in scaling quantum error detection on hardware","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02861","citing_title":"Opportunities and challenges in scaling quantum error detection on hardware","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KLPLGLCVIXC44PSGPKKZ43K2Y4","json":"https://pith.science/pith/KLPLGLCVIXC44PSGPKKZ43K2Y4.json","graph_json":"https://pith.science/api/pith-number/KLPLGLCVIXC44PSGPKKZ43K2Y4/graph.json","events_json":"https://pith.science/api/pith-number/KLPLGLCVIXC44PSGPKKZ43K2Y4/events.json","paper":"https://pith.science/paper/KLPLGLCV"},"agent_actions":{"view_html":"https://pith.science/pith/KLPLGLCVIXC44PSGPKKZ43K2Y4","download_json":"https://pith.science/pith/KLPLGLCVIXC44PSGPKKZ43K2Y4.json","view_paper":"https://pith.science/paper/KLPLGLCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15725&json=true","fetch_graph":"https://pith.science/api/pith-number/KLPLGLCVIXC44PSGPKKZ43K2Y4/graph.json","fetch_events":"https://pith.science/api/pith-number/KLPLGLCVIXC44PSGPKKZ43K2Y4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLPLGLCVIXC44PSGPKKZ43K2Y4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLPLGLCVIXC44PSGPKKZ43K2Y4/action/storage_attestation","attest_author":"https://pith.science/pith/KLPLGLCVIXC44PSGPKKZ43K2Y4/action/author_attestation","sign_citation":"https://pith.science/pith/KLPLGLCVIXC44PSGPKKZ43K2Y4/action/citation_signature","submit_replication":"https://pith.science/pith/KLPLGLCVIXC44PSGPKKZ43K2Y4/action/replication_record"}},"created_at":"2026-07-05T10:52:28.947094+00:00","updated_at":"2026-07-05T10:52:28.947094+00:00"}