{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OVMAEYV277Y5U2PJ4UFSSZ7GVS","short_pith_number":"pith:OVMAEYV2","schema_version":"1.0","canonical_sha256":"75580262bafff1da69e9e50b2967e6ac99f5565a153f516b9f8376b687c1c3d4","source":{"kind":"arxiv","id":"2505.13599","version":4},"attestation_state":"computed","paper":{"title":"Decoding across transversal Clifford gates in the surface code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara M. Terhal, Mackenzie H. Shaw, Marc Serra-Peralta","submitted_at":"2025-05-19T18:00:02Z","abstract_excerpt":"Transversal logical gates offer the opportunity for fast and low-noise logic, particularly when interspersed by a single round of parity check measurements of the underlying code. Using such circuits for the surface code requires decoding across logical gates, complicating the decoding task. We show how one can decode across an arbitrary sequence of transversal gates for the unrotated surface code, using a fast \"logical observable\" minimum-weight-perfect-matching (MWPM) based decoder, and benchmark its performance in Clifford circuits under circuit-level noise. We propose windowed logical obse"},"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":"2505.13599","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-19T18:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"86731b771adbe3115136fc369bae9993624b54fb9021a8fa3fbac996ba0f7e2e","abstract_canon_sha256":"3020482e90e0246351264d4552279526a0748a8bb404e12a6ae4c8e285f14ef0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T03:18:46.966512Z","signature_b64":"pSkOb8z2ry2ekgPiLR/QXSSvPhSDojVr4p7bFpX7b4s5qxySY4xR0wpCzDHPiJCtCFWmpNmFiE2hJB0FapFQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75580262bafff1da69e9e50b2967e6ac99f5565a153f516b9f8376b687c1c3d4","last_reissued_at":"2026-07-07T03:18:46.965938Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T03:18:46.965938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding across transversal Clifford gates in the surface code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara M. Terhal, Mackenzie H. Shaw, Marc Serra-Peralta","submitted_at":"2025-05-19T18:00:02Z","abstract_excerpt":"Transversal logical gates offer the opportunity for fast and low-noise logic, particularly when interspersed by a single round of parity check measurements of the underlying code. Using such circuits for the surface code requires decoding across logical gates, complicating the decoding task. We show how one can decode across an arbitrary sequence of transversal gates for the unrotated surface code, using a fast \"logical observable\" minimum-weight-perfect-matching (MWPM) based decoder, and benchmark its performance in Clifford circuits under circuit-level noise. We propose windowed logical obse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13599","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/2505.13599/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":"2505.13599","created_at":"2026-07-07T03:18:46.966004+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13599v4","created_at":"2026-07-07T03:18:46.966004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13599","created_at":"2026-07-07T03:18:46.966004+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVMAEYV277Y5","created_at":"2026-07-07T03:18:46.966004+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVMAEYV277Y5U2PJ","created_at":"2026-07-07T03:18:46.966004+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVMAEYV2","created_at":"2026-07-07T03:18:46.966004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2507.12024","citing_title":"Benchmarking fault-tolerant quantum computing hardware via QLOPS","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2509.13247","citing_title":"Demonstration of a Logical Architecture Uniting Motion and In-Place Entanglement","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2510.10835","citing_title":"Rigorous estimation of error thresholds of transversal Clifford logical circuits","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2603.04156","citing_title":"Achieving Optimal-Distance Atom-Loss Correction via Pauli Envelope","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11318","citing_title":"Spatial overhead reduction for 2D hypergraph product codes","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OVMAEYV277Y5U2PJ4UFSSZ7GVS","json":"https://pith.science/pith/OVMAEYV277Y5U2PJ4UFSSZ7GVS.json","graph_json":"https://pith.science/api/pith-number/OVMAEYV277Y5U2PJ4UFSSZ7GVS/graph.json","events_json":"https://pith.science/api/pith-number/OVMAEYV277Y5U2PJ4UFSSZ7GVS/events.json","paper":"https://pith.science/paper/OVMAEYV2"},"agent_actions":{"view_html":"https://pith.science/pith/OVMAEYV277Y5U2PJ4UFSSZ7GVS","download_json":"https://pith.science/pith/OVMAEYV277Y5U2PJ4UFSSZ7GVS.json","view_paper":"https://pith.science/paper/OVMAEYV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13599&json=true","fetch_graph":"https://pith.science/api/pith-number/OVMAEYV277Y5U2PJ4UFSSZ7GVS/graph.json","fetch_events":"https://pith.science/api/pith-number/OVMAEYV277Y5U2PJ4UFSSZ7GVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVMAEYV277Y5U2PJ4UFSSZ7GVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVMAEYV277Y5U2PJ4UFSSZ7GVS/action/storage_attestation","attest_author":"https://pith.science/pith/OVMAEYV277Y5U2PJ4UFSSZ7GVS/action/author_attestation","sign_citation":"https://pith.science/pith/OVMAEYV277Y5U2PJ4UFSSZ7GVS/action/citation_signature","submit_replication":"https://pith.science/pith/OVMAEYV277Y5U2PJ4UFSSZ7GVS/action/replication_record"}},"created_at":"2026-07-07T03:18:46.966004+00:00","updated_at":"2026-07-07T03:18:46.966004+00:00"}