Correlated Decoding of Logical Algorithms with Transversal Gates
Open accessThe DOI matches its Crossref record; 41 of the 41 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
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
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
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
The Heisenberg Representation of Quantum Computers
Gottesman, D. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9807006 · Cited by 489
Stim: a fast stabilizer circuit simulator
Gidney, C. (2021) · Quantum · doi:10.22331/q-2021-07-06-497 · Cited by 415
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-03-05-128 · Cited by 408
Real-time quantum error correction beyond break-even
Sivak, V. V., Eickbusch, A., Royer, B., Singh, S., Tsioutsios, I., Ganjam, S., Miano, A., Brock, B. L., Ding, A. Z., Frunzio, L., et al. (2023) · Nature · doi:10.1038/s41586-023-05782-6 · Cited by 407
A new quantum ripple-carry addition circuit
Cuccaro, S. A., Draper, T. G., Kutin, S. A., & Moulton, D. P. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0410184 · Cited by 344
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Realization of Real-Time Fault-Tolerant Quantum Error Correction
Ryan-Anderson, C., Bohnet, J. G., Lee, K., Gresh, D., Hankin, A., Gaebler, J. P., Francois, D., Chernoguzov, A., Lucchetti, D., Brown, N. C., et al. (2021) · Physical Review X · doi:10.1103/physrevx.11.041058 · Cited by 306
Demonstration of fault-tolerant universal quantum gate operations
Postler, L., Heuβen, S., Pogorelov, I., Rispler, M., Feldker, T., Meth, M., Marciniak, C. D., Stricker, R., Ringbauer, M., Blatt, R., et al. (2022) · Nature · doi:10.1038/s41586-022-04721-1 · Cited by 287
Entanglement detection in the stabilizer formalism
Tóth, G., & Gühne, O. (2005) · Physical Review A · doi:10.1103/physreva.72.022340 · Cited by 281
Degenerate Quantum LDPC Codes With Good Finite Length Performance
Panteleev, P., & Kalachev, G. (2021) · Quantum · doi:10.22331/q-2021-11-22-585 · Cited by 257
Almost-linear time decoding algorithm for topological codes
Delfosse, N., & Nickerson, N. H. (2021) · Quantum · doi:10.22331/q-2021-12-02-595 · Cited by 242
High-fidelity gates and mid-circuit erasure conversion in an atomic qubit
Ma, S., Liu, G., Peng, P., Zhang, B., Jandura, S., Claes, J., Burgers, A. P., Pupillo, G., Puri, S., & Thompson, J. D. (2023) · Nature · doi:10.1038/s41586-023-06438-1 · Cited by 228
Efficient algorithms for maximum likelihood decoding in the surface code
Bravyi, S., Suchara, M., & Vargo, A. (2014) · Physical Review A · doi:10.1103/physreva.90.032326 · Cited by 214
Sparse blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2025) · Quantum · doi:10.22331/q-2025-01-20-1600 · Cited by 180 · cited 4×
“We also explore different settings of the decompose errors parameter in Stim, which describes whether or not high-order hyperedges are decomposed into existing low-order hyperedges, resulting in an input decoding hypergraph with only essential hyperedges [27].”
InfluentialSparse Blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2023) · arXiv · doi:10.48550/arxiv.2303.15933 · Cited by 148
Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms
Cong, I., Levine, H., Keesling, A., Bluvstein, D., Wang, S.-T., & Lukin, M. D. (2022) · Physical Review X · doi:10.1103/physrevx.12.021049 · Cited by 144
Self-citationNon-Abelian braiding of graph vertices in a superconducting processor
Collaborators, G. Q. A. A., Andersen, T. I., Lensky, Y. D., Kechedzhi, K., Drozdov, I. K., Bengtsson, A., Hong, S., Morvan, A., Mi, X., Opremcak, A., et al. (2023) · Nature · doi:10.1038/s41586-023-05954-4 · Cited by 108
A Fault-Tolerant Honeycomb Memory
Gidney, C., Newman, M., Fowler, A., & Broughton, M. (2021) · Quantum · doi:10.22331/q-2021-12-20-605 · Cited by 83
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
Fault-tolerant quantum computing with color codes
Landahl, A. J., Anderson, J. T., & Rice, P. R. (2011) · arXiv · doi:10.48550/arxiv.1108.5738 · Cited by 79
Decoding algorithms for surface codes
deMarti iOlius, A., Fuentes, P., Orús, R., Crespo, P. M., & Etxezarreta Martinez, J. (2024) · Quantum · doi:10.22331/q-2024-10-10-1498 · Cited by 60 · cited 1×
“These experiments [17] motivate theoretical explorations of the optimal ways to design and decode error-corrected circuits, in order to accurately infer which physical errors occurred such that they can be corrected [19, 20].”
Implementing Fault-tolerant Entangling Gates on the Five-qubit Code and the Color Code
Ryan-Anderson, C., Brown, N. C., Allman, M. S., Arkin, B., Asa-Attuah, G., Baldwin, C., Berg, J., Bohnet, J. G., Braxton, S., Burdick, N., et al. (2022) · arXiv · doi:10.48550/arxiv.2208.01863 · Cited by 38
Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
Wang, Y., Simsek, S., Gatterman, T. M., Gerber, J. A., Gilmore, K., Gresh, D., Hewitt, N., Horst, C. V., Matheny, M., Mengle, T., et al. (2023) · arXiv · doi:10.48550/arxiv.2309.09893 · Cited by 32
Protecting expressive circuits with a quantum error detection code
Self, C. N., Benedetti, M., & Amaro, D. (2024) · Nature Physics · doi:10.1038/s41567-023-02282-2 · Cited by 31
General tensor network decoding of 2D Pauli codes
Chubb, C. T. (2021) · arXiv · doi:10.48550/arxiv.2101.04125 · Cited by 20
Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
Menendez, D. H., Ray, A., & Vasmer, M. (2023) · arXiv · doi:10.48550/arxiv.2309.08663 · Cited by 12
Ising model formulation for highly accurate topological color codes decoding
Takada, Y., Takeuchi, Y., & Fujii, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013092 · Cited by 10
New circuits and an open source decoder for the color code
Gidney, C., & Jones, C. (2023) · arXiv · doi:10.48550/arxiv.2312.08813 · Cited by 3
Research works printed but not linked: 35
- 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.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.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
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
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
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
- 41
- 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
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.