{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HTHGZ2WOXE5HDQCAEPO2DCXCIQ","short_pith_number":"pith:HTHGZ2WO","schema_version":"1.0","canonical_sha256":"3cce6ceaceb93a71c04023dda18ae24429a51e769a932bb9fc63b88a36791bb0","source":{"kind":"arxiv","id":"2505.13587","version":2},"attestation_state":"computed","paper":{"title":"Fast correlated decoding of transversal logical algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Alexandra A. Geim, Chen Zhao, Dolev Bluvstein, Hengyun Zhou, Madelyn Cain, Marcin Kalinowski, Mikhail D. Lukin, Nishad Maskara, Shouzhen Gu","submitted_at":"2025-05-19T18:00:00Z","abstract_excerpt":"Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number of syndrome extraction rounds can be reduced by a factor of the code distance $d$, at the cost of increased classical decoding complexity. Here, we reformulate the problem of decoding transversal circuits by directly decoding relevant logical operator products as they propagate through the circuit. This procedure transforms the decoding task into one closely "},"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.13587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-19T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"b4e317283bcddf1e951f04a2460c72110614a394c2572feff8cf7d8055144f5f","abstract_canon_sha256":"4c28507a8efa850351ca84dfd955c4e899b78c83927b804aa78515b034f544e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:20.379797Z","signature_b64":"knF8FhEHavThQewUQ90JfWg5vX4C1JRnAv/0+39O8Qhzko/XfDOrI6ibLueW5CkUc7lxS3swIwanvPBvDHbmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cce6ceaceb93a71c04023dda18ae24429a51e769a932bb9fc63b88a36791bb0","last_reissued_at":"2026-07-05T11:24:20.379248Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:20.379248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast correlated decoding of transversal logical algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Alexandra A. Geim, Chen Zhao, Dolev Bluvstein, Hengyun Zhou, Madelyn Cain, Marcin Kalinowski, Mikhail D. Lukin, Nishad Maskara, Shouzhen Gu","submitted_at":"2025-05-19T18:00:00Z","abstract_excerpt":"Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number of syndrome extraction rounds can be reduced by a factor of the code distance $d$, at the cost of increased classical decoding complexity. Here, we reformulate the problem of decoding transversal circuits by directly decoding relevant logical operator products as they propagate through the circuit. This procedure transforms the decoding task into one closely "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13587","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/2505.13587/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.13587","created_at":"2026-07-05T11:24:20.379322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13587v2","created_at":"2026-07-05T11:24:20.379322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13587","created_at":"2026-07-05T11:24:20.379322+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTHGZ2WOXE5H","created_at":"2026-07-05T11:24:20.379322+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTHGZ2WOXE5HDQCA","created_at":"2026-07-05T11:24:20.379322+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTHGZ2WO","created_at":"2026-07-05T11:24:20.379322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08508","citing_title":"Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward","ref_index":45,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21468","citing_title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04079","citing_title":"Quantum error correction with the toric code","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30385","citing_title":"Blueprint for a fault-tolerant compound photon-atom quantum architecture","ref_index":108,"is_internal_anchor":false},{"citing_arxiv_id":"2507.12024","citing_title":"Benchmarking fault-tolerant quantum computing hardware via QLOPS","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2510.05221","citing_title":"Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2510.10835","citing_title":"Rigorous estimation of error thresholds of transversal Clifford logical circuits","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2603.04156","citing_title":"Achieving Optimal-Distance Atom-Loss Correction via Pauli Envelope","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2603.05320","citing_title":"Simplified circuit-level decoding using Knill error correction","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11318","citing_title":"Spatial overhead reduction for 2D hypergraph product codes","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05315","citing_title":"Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation","ref_index":91,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21472","citing_title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HTHGZ2WOXE5HDQCAEPO2DCXCIQ","json":"https://pith.science/pith/HTHGZ2WOXE5HDQCAEPO2DCXCIQ.json","graph_json":"https://pith.science/api/pith-number/HTHGZ2WOXE5HDQCAEPO2DCXCIQ/graph.json","events_json":"https://pith.science/api/pith-number/HTHGZ2WOXE5HDQCAEPO2DCXCIQ/events.json","paper":"https://pith.science/paper/HTHGZ2WO"},"agent_actions":{"view_html":"https://pith.science/pith/HTHGZ2WOXE5HDQCAEPO2DCXCIQ","download_json":"https://pith.science/pith/HTHGZ2WOXE5HDQCAEPO2DCXCIQ.json","view_paper":"https://pith.science/paper/HTHGZ2WO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13587&json=true","fetch_graph":"https://pith.science/api/pith-number/HTHGZ2WOXE5HDQCAEPO2DCXCIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HTHGZ2WOXE5HDQCAEPO2DCXCIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTHGZ2WOXE5HDQCAEPO2DCXCIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTHGZ2WOXE5HDQCAEPO2DCXCIQ/action/storage_attestation","attest_author":"https://pith.science/pith/HTHGZ2WOXE5HDQCAEPO2DCXCIQ/action/author_attestation","sign_citation":"https://pith.science/pith/HTHGZ2WOXE5HDQCAEPO2DCXCIQ/action/citation_signature","submit_replication":"https://pith.science/pith/HTHGZ2WOXE5HDQCAEPO2DCXCIQ/action/replication_record"}},"created_at":"2026-07-05T11:24:20.379322+00:00","updated_at":"2026-07-05T11:24:20.379322+00:00"}