Correlated Decoding of Logical Algorithms with Transversal Gates
Open accessThe DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Abstract
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 (London) 626, 58 (2024)NATUAS0028-083610.1038/s41586-023-06927-3], 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-Clifford transversal entangling gates, and explore two decoders offering different computational runtimes and accuracies. In particular, by leveraging the deterministic propagation of stabilizer measurement errors, we find that correlated decoding enables the number of noisy syndrome extraction rounds between gates to be reduced from O(d) to O(1) in transversal Clifford circuits, where d is the code distance. We verify numerically that this approach substantially reduces the space-time cost of deep logical Clifford circuits. These results demonstrate that correlated decoding provides a major advantage in early fault-tolerant computation, as realized in recent experiments, and further indicate it has considerable potential to reduce the space-time cost in large-scale logical algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
Self-citationSuppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Extending the lifetime of a quantum bit with error correction in superconducting circuits
Ofek, N., Petrenko, A., Heeres, R., Reinhold, P., Leghtas, Z., Vlastakis, B., Liu, Y., Frunzio, L., Girvin, S. M., Jiang, L., et al. (2016) · Nature · doi:10.1038/nature18949 · Cited by 941
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Research works printed but not linked: 38
- 10.1063/1.1499754 · DOI · Paper page
- M. A. Nielsen, 2010, Quantum Computation and Quantum Information: 10th Anniversary Edition
- 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
- 10.1038/s41567-020-0931-8 · DOI · Paper page
- 10.1103/PhysRevA.109.062438 · DOI
- 10.1126/sciadv.ado9024 · DOI
- 10.1038/s41586-022-04592-6 · DOI · Paper page
- 10.22331/q-2019-03-05-128 · DOI · Paper page
- 10.1103/PhysRevX.13.031007 · DOI · Paper page
- 10.22331/q-2023-11-07-1172 · DOI · Paper page
- 10.1103/PhysRevResearch.2.033042 · DOI · Paper page
- N. Delfosse, 2014, 2014 IEEE International Symposium on Information Theory, 10.1109/ISIT.2014.6874997 · DOI
- 10.1109/TIT.1986.1057137 · DOI · Paper page
- 10.1088/1367-2630/16/9/093045 · DOI
- 10.26421/QIC11.1-2-2 · DOI
- 10.1145/3505637 · DOI · Paper page
- 10.1109/TIT.1978.1055873 · DOI · Paper page
- 10.1109/18.641542 · doi:10.1109/18.641542
- 10.22331/q-2021-12-02-595 · DOI · Paper page
- 10.1109/TIT.2022.3143452 · DOI
- P. Shor, 1996, Proceedings of the 37th Conference on Foundations of Computer Science, 10.1109/SFCS.1996.548464 · DOI · Paper page
- 10.1103/PhysRevLett.111.090505 · DOI · Paper page
- 10.1103/PhysRevResearch.4.043052 · DOI
- 10.1103/PhysRevLett.113.030501 · DOI · Paper page
- 10.1103/PhysRevLett.119.030501 · DOI · Paper page
- 10.1103/PhysRevLett.122.200501 · DOI · Paper page
- 10.1109/TC.2019.2948612 · DOI · Paper page
- 10.1038/s41534-022-00623-2 · DOI
- 10.1038/s41467-023-42482-1 · DOI · Paper page
- 10.1103/PRXQuantum.4.040344 · DOI · Paper page
- 10.1109/TIT.2013.2292061 · DOI · Paper page
- 10.1109/TIT.2021.3119384 · DOI · Paper page
- P. Panteleev, 2022, Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
- 10.1038/s41567-024-02479-z · DOI · Paper page
- 10.1103/PhysRevA.85.022317 · DOI · Paper page
- 10.1103/PhysRevA.89.012317 · DOI · Paper page
- 10.1038/s41467-022-32094-6 · DOI · Paper page
- 10.1103/PhysRevX.13.041013 · DOI · Paper page
Cited by
Quantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
“We further expect these overheads will reduce with advances in error correction protocols [48–54] and decoding [55–57].”
Localized statistics decoding for quantum low-density parity-check codes
Hillmann, T., Berent, L., Quintavalle, A. O., Eisert, J., Wille, R., & Roffe, J. (2025) · Nature Communications · doi:10.1038/s41467-025-63214-7 · Cited by 37
Helios: A 98-qubit trapped-ion quantum computer
Ransford, A., & Bohnet, J. (2025) · doi:10.21203/rs.3.rs-8130124/v1 · Cited by 16
Efficient fault-tolerant code switching via one-way transversal CNOT gates
Heußen, S., & Hilder, J. (2025) · Quantum · doi:10.22331/q-2025-09-03-1846 · Cited by 12
A 98-qubit trapped-ion quantum computer with all-to-all connectivity
Ransford, A., Allman, M. S., Arkinstall, J., Campora, J. P., Cooper, S. F., Delaney, R. D., Dreiling, J. M., Estey, B., Figgatt, C., Hall, A., et al. (2026) · Nature · doi:10.1038/s41586-026-10676-4 · Cited by 16
Metadata
- Authors
- Cain, M., Zhao, C., Zhou, H., Meister, N., Ataides, J. P. B., Jaffe, A., Bluvstein, D., & Lukin, M. D.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2024-12-11
- Volume
- 133
- Issue
- 24
- Pages
- 240602-240602
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W4405279421
- Cited by
- 37
- References
- 37
- FWCI
- 5.51
- Type
- journal article
- Language
- en
- Open access
- green
- Licence
- Funders
- Army Research Office (W911NF-23-2-0219, W911NF2320219, W911NF-19-1-0302)
- Defense Advanced Research Projects Agency (W911NF2010021, HR0011-23-3-0012)
- Center for Ultracold Atoms, Massachusetts Institute of Technology
- National Science Foundation (PHY-1734011, PHY-2012023, CCF-2313084, CHE-2037687, DGE1745303)
- Multidisciplinary University Research Initiative (W911NF-20-1-0082)
- Hertz Foundation
- Department of Energy Computational Science (DE-SC0020347)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Correlated Decoding of Logical Algorithms with Transversal Gates. https://app.cochat.ai/papers/10.1103/physrevlett.133.240602
- The paper
- Cain, M., Zhao, C., Zhou, H., Meister, N., Ataides, J. P. B., Jaffe, A., Bluvstein, D., & Lukin, M. D. (2024). Correlated Decoding of Logical Algorithms with Transversal Gates. Physical Review Letters. https://doi.org/10.1103/physrevlett.133.240602
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.