{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:C6PXZJI3FDE3BDUI3YLNIFZWUE","short_pith_number":"pith:C6PXZJI3","schema_version":"1.0","canonical_sha256":"179f7ca51b28c9b08e88de16d41736a10bd3a575032f1fdad656f6bd7d020fba","source":{"kind":"arxiv","id":"2403.03272","version":2},"attestation_state":"computed","paper":{"title":"Correlated decoding of logical algorithms with transversal gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Arthur Jaffe, Chen Zhao, Dolev Bluvstein, Hengyun Zhou, J. Pablo Bonilla Ataides, Madelyn Cain, Mikhail D. Lukin, Nadine Meister","submitted_at":"2024-03-05T19:13:32Z","abstract_excerpt":"Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation of logical qubits using transversal gates (Bluvstein et al., Nature 626, 58-65 (2024)), we show that the performance of logical algorithms can be substantially improved by decoding the qubits jointly to account for error propagation during transversal entangling gates. We find that such correlated decoding improves the performance of both Clifford and non-Cli"},"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":"2403.03272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-05T19:13:32Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"167fbb4b4611c4e1994d6c28520052fc26d7c007c92f9c21c0001d71310126b3","abstract_canon_sha256":"f360f9a0f2d507a4aadfaebb4a6a349853bbc902f262f482f162f4fda0051c24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:06.757268Z","signature_b64":"bWkklwsKO3KQDUPatXubwZ5htVH4F/TADWGFCgHnxM6awLUCN+YGZ7xkoY78182iyuBlX6yhcGny7LfFDXBPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"179f7ca51b28c9b08e88de16d41736a10bd3a575032f1fdad656f6bd7d020fba","last_reissued_at":"2026-07-05T10:45:06.756731Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:06.756731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correlated decoding of logical algorithms with transversal gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Arthur Jaffe, Chen Zhao, Dolev Bluvstein, Hengyun Zhou, J. Pablo Bonilla Ataides, Madelyn Cain, Mikhail D. Lukin, Nadine Meister","submitted_at":"2024-03-05T19:13:32Z","abstract_excerpt":"Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation of logical qubits using transversal gates (Bluvstein et al., Nature 626, 58-65 (2024)), we show that the performance of logical algorithms can be substantially improved by decoding the qubits jointly to account for error propagation during transversal entangling gates. We find that such correlated decoding improves the performance of both Clifford and non-Cli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03272","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/2403.03272/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":"2403.03272","created_at":"2026-07-05T10:45:06.756798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.03272v2","created_at":"2026-07-05T10:45:06.756798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03272","created_at":"2026-07-05T10:45:06.756798+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6PXZJI3FDE3","created_at":"2026-07-05T10:45:06.756798+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6PXZJI3FDE3BDUI","created_at":"2026-07-05T10:45:06.756798+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6PXZJI3","created_at":"2026-07-05T10:45:06.756798+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15297","citing_title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03951","citing_title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","ref_index":85,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25094","citing_title":"INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C6PXZJI3FDE3BDUI3YLNIFZWUE","json":"https://pith.science/pith/C6PXZJI3FDE3BDUI3YLNIFZWUE.json","graph_json":"https://pith.science/api/pith-number/C6PXZJI3FDE3BDUI3YLNIFZWUE/graph.json","events_json":"https://pith.science/api/pith-number/C6PXZJI3FDE3BDUI3YLNIFZWUE/events.json","paper":"https://pith.science/paper/C6PXZJI3"},"agent_actions":{"view_html":"https://pith.science/pith/C6PXZJI3FDE3BDUI3YLNIFZWUE","download_json":"https://pith.science/pith/C6PXZJI3FDE3BDUI3YLNIFZWUE.json","view_paper":"https://pith.science/paper/C6PXZJI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.03272&json=true","fetch_graph":"https://pith.science/api/pith-number/C6PXZJI3FDE3BDUI3YLNIFZWUE/graph.json","fetch_events":"https://pith.science/api/pith-number/C6PXZJI3FDE3BDUI3YLNIFZWUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6PXZJI3FDE3BDUI3YLNIFZWUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6PXZJI3FDE3BDUI3YLNIFZWUE/action/storage_attestation","attest_author":"https://pith.science/pith/C6PXZJI3FDE3BDUI3YLNIFZWUE/action/author_attestation","sign_citation":"https://pith.science/pith/C6PXZJI3FDE3BDUI3YLNIFZWUE/action/citation_signature","submit_replication":"https://pith.science/pith/C6PXZJI3FDE3BDUI3YLNIFZWUE/action/replication_record"}},"created_at":"2026-07-05T10:45:06.756798+00:00","updated_at":"2026-07-05T10:45:06.756798+00:00"}