{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2GHC2S4DSJ2YTS4E4TSVH3AH32","short_pith_number":"pith:2GHC2S4D","schema_version":"1.0","canonical_sha256":"d18e2d4b83927589cb84e4e553ec07de929285ce31d7a7c5d1f5ecb238a5c521","source":{"kind":"arxiv","id":"2304.05943","version":2},"attestation_state":"computed","paper":{"title":"Spacetime codes of Clifford circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Adam Paetznick, Nicolas Delfosse","submitted_at":"2023-04-12T16:05:44Z","abstract_excerpt":"We propose a scheme for detecting and correcting faults in any Clifford circuit. The scheme is based on the observation that the set of all possible outcome bit-strings of a Clifford circuit is a linear code, which we call the outcome code. From the outcome code we construct a corresponding stabilizer code, the spacetime code. Our construction extends the circuit-to-code construction of Bacon, Flammia, Harrow and Shi [2], revisited recently by Gottesman [16], to include intermediate and multi-qubit measurements. With this correspondence, we reduce the problem of correcting faults in a circuit "},"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":"2304.05943","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-04-12T16:05:44Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0bef3b11daa4bee8ca37df2ddfe569ade619a4c7fbf4aa783b5e0259775b1cc1","abstract_canon_sha256":"302124ebc475566b41e0826ca91c831983c2b564894cb37d3b8a9f09ac13a15e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:09.575485Z","signature_b64":"bvCSKUWCHFbHbO5hozRdntl2EG3mYscPfXqL0NACQz5aP5Hd0iCZ3+euQsI87qQ94qKkLnklc30yoaTCnT5LCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d18e2d4b83927589cb84e4e553ec07de929285ce31d7a7c5d1f5ecb238a5c521","last_reissued_at":"2026-07-05T06:14:09.575008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:09.575008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spacetime codes of Clifford circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Adam Paetznick, Nicolas Delfosse","submitted_at":"2023-04-12T16:05:44Z","abstract_excerpt":"We propose a scheme for detecting and correcting faults in any Clifford circuit. The scheme is based on the observation that the set of all possible outcome bit-strings of a Clifford circuit is a linear code, which we call the outcome code. From the outcome code we construct a corresponding stabilizer code, the spacetime code. Our construction extends the circuit-to-code construction of Bacon, Flammia, Harrow and Shi [2], revisited recently by Gottesman [16], to include intermediate and multi-qubit measurements. With this correspondence, we reduce the problem of correcting faults in a circuit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.05943","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/2304.05943/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":"2304.05943","created_at":"2026-07-05T06:14:09.575066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.05943v2","created_at":"2026-07-05T06:14:09.575066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.05943","created_at":"2026-07-05T06:14:09.575066+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GHC2S4DSJ2Y","created_at":"2026-07-05T06:14:09.575066+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GHC2S4DSJ2YTS4E","created_at":"2026-07-05T06:14:09.575066+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GHC2S4D","created_at":"2026-07-05T06:14:09.575066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06365","citing_title":"A framework for low-overhead quantum fault tolerance via spacetime lifting","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05664","citing_title":"Gauging the Spacetime Code","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2408.14828","citing_title":"Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2404.02280","citing_title":"Demonstration of logical qubits and repeated error correction with better-than-physical error rates","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09797","citing_title":"Optimising Quantum Error Correction Using Morphing Circuits","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2GHC2S4DSJ2YTS4E4TSVH3AH32","json":"https://pith.science/pith/2GHC2S4DSJ2YTS4E4TSVH3AH32.json","graph_json":"https://pith.science/api/pith-number/2GHC2S4DSJ2YTS4E4TSVH3AH32/graph.json","events_json":"https://pith.science/api/pith-number/2GHC2S4DSJ2YTS4E4TSVH3AH32/events.json","paper":"https://pith.science/paper/2GHC2S4D"},"agent_actions":{"view_html":"https://pith.science/pith/2GHC2S4DSJ2YTS4E4TSVH3AH32","download_json":"https://pith.science/pith/2GHC2S4DSJ2YTS4E4TSVH3AH32.json","view_paper":"https://pith.science/paper/2GHC2S4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.05943&json=true","fetch_graph":"https://pith.science/api/pith-number/2GHC2S4DSJ2YTS4E4TSVH3AH32/graph.json","fetch_events":"https://pith.science/api/pith-number/2GHC2S4DSJ2YTS4E4TSVH3AH32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GHC2S4DSJ2YTS4E4TSVH3AH32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GHC2S4DSJ2YTS4E4TSVH3AH32/action/storage_attestation","attest_author":"https://pith.science/pith/2GHC2S4DSJ2YTS4E4TSVH3AH32/action/author_attestation","sign_citation":"https://pith.science/pith/2GHC2S4DSJ2YTS4E4TSVH3AH32/action/citation_signature","submit_replication":"https://pith.science/pith/2GHC2S4DSJ2YTS4E4TSVH3AH32/action/replication_record"}},"created_at":"2026-07-05T06:14:09.575066+00:00","updated_at":"2026-07-05T06:14:09.575066+00:00"}