{"id":91517,"date":"2025-10-21T05:52:17","date_gmt":"2025-10-21T05:52:17","guid":{"rendered":"https:\/\/www.newsbeep.com\/nz\/91517\/"},"modified":"2025-10-21T05:52:17","modified_gmt":"2025-10-21T05:52:17","slug":"low-overhead-transversal-fault-tolerance-for-universal-quantum-computation","status":"publish","type":"post","link":"https:\/\/www.newsbeep.com\/nz\/91517\/","title":{"rendered":"Low-overhead transversal fault tolerance for universal quantum computation"},"content":{"rendered":"

Dalzell, A. M. et al. Quantum Algorithms: A Survey of Applications and End-to-End Complexities (Cambridge Univ. Press, 2025).<\/p>\n

Beverland, M. E. et al. Assessing requirements to scale to practical quantum advantage. Preprint at https:\/\/arxiv.org\/abs\/2211.07629<\/a> (2022).<\/p>\n

Babbush, R. et al. Focus beyond quadratic speedups for error-corrected quantum advantage. PRX Quantum 2, 010103 (2021).<\/p>\n

Article<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Gottesman, D. An introduction to quantum error correction and fault-tolerant quantum computation. Preprint at https:\/\/arxiv.org\/abs\/0904.2557<\/a> (2010).<\/p>\n

Gottesman, D. Fault-tolerant quantum computation with constant overhead. Quantum Inf. Comput. 14, 1338\u20131372 (2013).<\/p>\n

MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Steane, A. M. Error correcting codes in quantum theory. Phys. Rev. Lett. 77, 793\u2013797 (1996).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Shor, P. W. Fault-tolerant quantum computation. In Proc. 37th Conference on Foundations of Computer Science 56\u201365 (IEEE, 1996).<\/p>\n

Bravyi, S. B. & Kitaev, A. Y. D. Quantum codes on a lattice with boundary. Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/9811052<\/a> (1998).<\/p>\n

Dennis, E., Kitaev, A., Landahl, A. & Preskill, J. Topological quantum memory. J. Math. Phys. 43, 4452\u20134505 (2002).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Horsman, C., Fowler, A. G., Devitt, S. & Van Meter, R. Surface code quantum computing by lattice surgery. New J. Phys. 14, 123011 (2012).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Litinski, D. A game of surface codes: large-scale quantum computing with lattice surgery. Quantum 3, 128 (2019).<\/p>\n

Article<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Fowler, A. G., Mariantoni, M., Martinis, J. M. & Cleland, A. N. Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Cain, M. et al. Correlated decoding of logical algorithms with transversal gates. Phys. Rev. Lett. 133, 240602 (2024).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Gidney, C. & Eker\u00e5, M. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5, 433 (2021).<\/p>\n

Article<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Hastings, M. B. Topological order at nonzero temperature. Phys. Rev. Lett. 107, 210501 (2011).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Raussendorf, R. Quantum computation via translation-invariant operations on a chain of qubits. Phys. Rev. A 72, 052301 (2005).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Cohen, L. Z., Kim, I. H., Bartlett, S. D. & Brown, B. J. Low-overhead fault-tolerant quantum computing using long-range connectivity. Sci. Adv. 8, eabn1717 (2022).<\/p>\n

Article<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n PubMed Central<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Xu, Q. et al. Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays. Nat. Phys. 20, 1084\u20131090 (2024).<\/p>\n

Article<\/a>\u00a0
\n CAS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Yamasaki, H. & Koashi, M. Time-efficient constant-space-overhead fault-tolerant quantum computation. Nat. Phys. 20, 247\u2013253 (2024).<\/p>\n

Article<\/a>\u00a0
\n CAS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Bravyi, S. et al. High-threshold and low-overhead fault-tolerant quantum memory. Nature 627, 778\u2013782 (2024).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n PubMed Central<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Tremblay, M. A., Delfosse, N. & Beverland, M. E. Constant-overhead quantum error correction with thin planar connectivity. Phys. Rev. Lett. 129, 050504 (2022).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Bomb\u00edn, H. Single-shot fault-tolerant quantum error correction. Phys. Rev. X 5, 031043 (2015).<\/p>\n


\n Google Scholar<\/a>\u00a0\n <\/p>\n

Campbell, E. T. A theory of single-shot error correction for adversarial noise. Quantum Sci. Technol. 4, 025006 (2019).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Beverland, M. E., Kubica, A. & Svore, K. M. Cost of universality: a comparative study of the overhead of state distillation and code switching with color codes. PRX Quantum 2, 020341 (2021).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Delfosse, N. & Paetznick, A. Spacetime codes of Clifford circuits. Preprint at https:\/\/arxiv.org\/abs\/2304.05943<\/a> (2023).<\/p>\n

Gidney, C. Stim: a fast stabilizer circuit simulator. Quantum 5, 497 (2021).<\/p>\n

Article<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Gottesman, D. Opportunities and challenges in fault-tolerant quantum computation. Preprint at https:\/\/arxiv.org\/abs\/2210.15844<\/a> (2022).<\/p>\n

Cai, Z., Siegel, A. & Benjamin, S. Looped pipelines enabling effective 3D qubit lattices in a strictly 2D device. PRX Quantum 4, 020345 (2023).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Duckering, C., Baker, J. M., Schuster, D. I. & Chong, F. T. Virtualized logical qubits: a 2.5D architecture for error-corrected quantum computing. In Proc. Annual International Symposium on Microarchitecture (MICRO) 173\u2013185 (IEEE, 2020).<\/p>\n

Calderbank, A. R. & Shor, P. W. Good quantum error-correcting codes exist. Phys. Rev. A 54, 1098 (1996).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Bravyi, S. & Kitaev, A. Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71, 022316 (2005).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Postler, L. et al. Demonstration of fault-tolerant universal quantum gate operations. Nature 605, 675\u2013680 (2022).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Ryan-Anderson, C. et al. Implementing fault-tolerant entangling gates on the five-qubit code and the color code. Preprint at https:\/\/arxiv.org\/abs\/2208.01863<\/a> (2022).<\/p>\n

Bluvstein, D. et al. Logical quantum processor based on reconfigurable atom arrays. Nature 626, 58\u201365 (2024).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Eastin, B. & Knill, E. Restrictions on transversal encoded quantum gate sets. Phys. Rev. Lett. 102, 110502 (2009).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Jochym-O\u2019Connor, T., Kubica, A. & Yoder, T. J. Disjointness of stabilizer codes and limitations on fault-tolerant logical gates. Phys. Rev. X 8, 021047 (2018).<\/p>\n


\n Google Scholar<\/a>\u00a0\n <\/p>\n

Li, Y. A magic state\u2019s fidelity can be superior to the operations that created it. New J. Phys. 17, 023037 (2015).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Haah, J. What is your logical qubit. In Proc. Simons Institute Workshop on Advances in Quantum Coding Theory (Simons Institute for the Theory of Computing, 2024).<\/p>\n

Cain, M. et al. Fast correlated decoding of transversal logical algorithms. Preprint at https:\/\/arxiv.org\/abs\/2505.13587<\/a> (2025).<\/p>\n

Serra-Peralta, M., Shaw, M. H. & Terhal, B. M. Decoding across transversal Clifford gates in the surface code. Preprint at https:\/\/arxiv.org\/abs\/2505.13599<\/a> (2025).<\/p>\n

Kovalev, A. A. & Pryadko, L. P. Fault tolerance of quantum low-density parity check codes with sublinear distance scaling. Phys. Rev. A\u00a087, 020304 (2013).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Higgott, O., Bohdanowicz, T. C., Kubica, A., Flammia, S. T. & Campbell, E. T. Improved decoding of circuit noise and fragile boundaries of tailored surface codes. Phys. Rev. X 13, 031007 (2023).<\/p>\n

CAS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Gurobi Optimization. Gurobi Optimizer Reference Manual (Gurobi Optimization, 2024).<\/p>\n

Kim, I. H. et al. Fault-tolerant resource estimate for quantum chemical simulations: case study on Li-ion battery electrolyte molecules. Phys. Rev. Res. 4, 023019 (2022).<\/p>\n

Article<\/a>\u00a0
\n CAS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Fowler, A. G. & Gidney, C. Low overhead quantum computation using lattice surgery. Preprint at https:\/\/arxiv.org\/abs\/1808.06709<\/a> (2018).<\/p>\n

Turner, M. L., Campbell, E. T., Crawford, O., Gillespie, N. I. & Camps, J. Scalable decoding protocols for fast transversal logic in the surface code. Preprint at https:\/\/arxiv.org\/abs\/2505.23567<\/a> (2025).<\/p>\n

Fowler, A. G. Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time. Quantum Inf. Comput.15, 145\u2013158 (2015).<\/p>\n

MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Duclos-Cianci, G. & Poulin, D. Fast decoders for topological quantum codes. Phys. Rev. Lett. 104, 050504 (2010).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Terhal, B. M. Quantum error correction for quantum memories. Rev. Mod. Phys. 87, 307\u2013346 (2015).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Breuckmann, N. P. & Eberhardt, J. N. Quantum low-density parity-check codes. PRX Quantum 2, 040101 (2021).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Tillich, J. P. & Zemor, G. Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength. IEEE Trans. Inf. Theory 60, 1193\u20131202 (2014).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Panteleev, P. & Kalachev, G. Asymptotically good quantum and locally testable classical LDPC codes. In Proc. Annual ACM Symposium on Theory of Computing 375\u2013388 (IEEE, 2022).<\/p>\n

Fawzi, O., Grospellier, A. & Leverrier, A. Constant overhead quantum fault-tolerance with quantum expander codes. In Proc. 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) 743\u2013754 (IEEE, 2018).<\/p>\n

Gu, S. et al. Single-shot decoding of good quantum LDPC codes. Commun. Math. Phys. 405, 85 (2024).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Bomb\u00edn, H. Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes. New J. Phys. 17, 083002 (2015).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Kubica, A., Yoshida, B. & Pastawski, F. Unfolding the color code. New J. Phys. 17, 083026 (2015).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Bombin, H. Transversal gates and error propagation in 3D topological codes. Preprint at https:\/\/arxiv.org\/abs\/1810.09575<\/a> (2018).<\/p>\n

Aharonov, D. & Ben-Or, M. Fault-tolerant quantum computation with constant error rate. SIAM J. Comput. 38, 1207\u20131282 (1999).<\/p>\n

Article<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information (Cambridge Univ. Press, 2010).<\/p>\n

Pattison, C. A., Krishna, A. & Preskill, J. Hierarchical memories: simulating quantum LDPC codes with local gates. Quantum 9, 1728 (2025).<\/p>\n

Article<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Bravyi, S., Gosset, D., K\u00f6nig, R. & Tomamichel, M. Quantum advantage with noisy shallow circuits. Nat. Phys. 16, 1040\u20131045 (2020).<\/p>\n

Article<\/a>\u00a0
\n CAS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Moussa, J. E. Transversal Clifford gates on folded surface codes. Phys. Rev. A 94, 042316 (2016).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Breuckmann, N. P. & Burton, S. Fold-transversal Clifford gates for quantum codes. Quantum 8, 1372 (2024).<\/p>\n

Article<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Quintavalle, A. O., Webster, P. & Vasmer, M. Partitioning qubits in hypergraph product codes to implement logical gates. Quantum 7, 1153 (2023).<\/p>\n

Article<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Bomb\u00edn, H. et al. Modular decoding: parallelizable real-time decoding for quantum computers. Preprint at https:\/\/arxiv.org\/abs\/2303.04846<\/a> (2023).<\/p>\n

Higgott, O. & Breuckmann, N. P. Improved single-shot decoding of higher-dimensional hypergraph-product codes. PRX Quantum 4, 020332 (2023).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Landahl, A. J., Anderson, J. T. & Rice, P. R. Fault-tolerant quantum computing with color codes. Preprint at https:\/\/arxiv.org\/abs\/1108.5738<\/a> (2011).<\/p>\n

Bravyi, S. & Cross, A. Doubled color codes. Preprint at https:\/\/arxiv.org\/abs\/1509.03239<\/a> (2015).<\/p>\n

Bacon, D., Flammia, S. T., Harrow, A. W. & Shi, J. Sparse quantum codes from quantum circuits. In Proc. Forty-Seventh Annual ACM Symposium on Theory of Computing 327\u2013334 (ACM, 2014).<\/p>\n

Aliferis, P., Gottesman, D. & Preskill, J. Accuracy threshold for postselected quantum computation. Quantum Inf. Comput. 8, 181\u2013244 (2008).<\/p>\n

MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Lao, L. & Criger, B. Magic state injection on the rotated surface code. In Proc. 19th ACM International Conference on Computing Frontiers 113\u2013120 (ACM, 2022).<\/p>\n

Gidney, C. Cleaner magic states with hook injection. Preprint at https:\/\/arxiv.org\/abs\/2302.12292<\/a> (2023).<\/p>\n

Vasmer, M. & Browne, D. E. Three-dimensional surface codes: transversal gates and fault-tolerant architectures. Phys. Rev. A 100, 012312 (2019).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n CAS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Brown, B. J. A fault-tolerant non-Clifford gate for the surface code in two dimensions. Sci. Adv. 6, 4929\u20134951 (2020).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Zhu, G., Sikander, S., Portnoy, E., Cross, A. W. & Brown, B. J. Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries. Preprint at https:\/\/arxiv.org\/abs\/2310.16982<\/a> (2023).<\/p>\n

Bravyi, S., Smith, G. & Smolin, J. A. Trading classical and quantum computational resources. Phys. Rev. X 6, 021043 (2016).<\/p>\n


\n Google Scholar<\/a>\u00a0\n <\/p>\n

Yoganathan, M., Jozsa, R. & Strelchuk, S. Quantum advantage of unitary Clifford circuits with magic state inputs. Proc. R. Soc. A Math. Phys. Eng. Sci. 475, 20180427 (2018).<\/p>\n

ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Gidney, C. Halving the cost of quantum addition. Quantum 2, 74 (2018).<\/p>\n

Article<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Cuccaro, S. A., Draper, T. G., Kutin, S. A. & Moulton, D. P. A new quantum ripple-carry addition circuit. Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/0410184<\/a> (2004).<\/p>\n

Babbush, R. et al. Encoding electronic spectra in quantum circuits with linear T complexity. Phys. Rev. X 8, 041015 (2018).<\/p>\n

CAS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Fowler, A. G. Time-optimal quantum computation. Preprint at https:\/\/arxiv.org\/abs\/1210.4626<\/a> (2012).<\/p>\n

Litinski, D. & Nickerson, N. Active volume: an architecture for efficient fault-tolerant quantum computers with limited non-local connections. Preprint at https:\/\/arxiv.org\/abs\/2211.15465<\/a> (2022).<\/p>\n

Knill, E. Quantum computing with very noisy devices. Nature 434, 39\u201344 (2004).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Gidney, C. & Fowler, A. G. Flexible layout of surface code computations using AutoCCZ states. Preprint at https:\/\/arxiv.org\/abs\/1905.08916<\/a> (2019).<\/p>\n

Bravyi, S. & Haah, J. Magic-state distillation with low overhead. Phys. Rev. A 86, 052329 (2012).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Kubica, A. & Vasmer, M. Single-shot quantum error correction with the three-dimensional subsystem toric code. Nat. Commun. 13, 6272 (2022).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n PubMed Central<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Acharya, R. et al. Suppressing quantum errors by scaling a surface code logical qubit. Nature 614, 676\u2013681 (2023).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Wootton, J. R. & Loss, D. High threshold error correction for the surface code. Phys. Rev. Lett. 109, 160503 (2012).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Fowler, A. G. Optimal complexity correction of correlated errors in the surface code. Preprint at https:\/\/arxiv.org\/abs\/1310.0863<\/a> (2013).<\/p>\n

Delfosse, N., Londe, V. & Beverland, M. E. Toward a union-find decoder for quantum LDPC codes. IEEE Trans. Inf. Theory 68, 3187\u20133199 (2022).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Panteleev, P. & Kalachev, G. Degenerate quantum LDPC codes with good finite length performance. Quantum 5, 585 (2019).<\/p>\n

Article<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Wu, Y., Zhong, L. & Puri, S. Hypergraph minimum-weight parity factor decoder for QEC. In Proc. 2024 APS March Meeting (American Physical Society, 2024).<\/p>\n

Bomb\u00edn, H. Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes. New J. Phys. 17, 083002 (2013).<\/p>\n

Article<\/a>\u00a0
\n MathSciNet<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Liyanage, N., Wu, Y., Deters, A. & Zhong, L. Scalable quantum error correction for surface codes using FPGA. In Proc. 31st IEEE International Symposium on Field-Programmable Custom Computing Machine (FCCM) 217 (IEEE, 2023).<\/p>\n

Richardson, T. & Urbanke, R. Modern Coding Theory (Cambridge Univ. Press, 2008).<\/p>\n

Wu, Y. & Zhong, L. Fusion Blossom: fast MWPM decoders for QEC. In Proc. 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) 928\u2013938 (IEEE, 2023).<\/p>\n

Grospellier, A. Constant Time Decoding of Quantum Expander Codes and Application to Fault-Tolerant Quantum Computation. PhD thesis, Sorbonne Univ. (2019).<\/p>\n

Tan, X., Zhang, F., Chao, R., Shi, Y. & Chen, J. Scalable surface-code decoders with parallelization in time. PRX Quantum 4, 040344 (2023).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Skoric, L., Browne, D. E., Barnes, K. M., Gillespie, N. I. & Campbell, E. T. Parallel window decoding enables scalable fault tolerant quantum computation. Nat. Commun. 14, 7040 (2023).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n PubMed Central<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Bluvstein, D. et al. A quantum processor based on coherent transport of entangled atom arrays. Nature 604, 451\u2013456 (2022).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n PubMed Central<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Pino, J. M. et al. Demonstration of the trapped-ion quantum CCD computer architecture. Nature 592, 209\u2013213 (2021).<\/p>\n

Article<\/a>\u00a0
\n ADS<\/a>\u00a0
\n CAS<\/a>\u00a0
\n PubMed<\/a>\u00a0
\n
\n Google Scholar<\/a>\u00a0\n <\/p>\n

Bartolucci, S. et al. Switch networks for photonic fusion-based quantum computing. Preprint at https:\/\/arxiv.org\/abs\/2109.13760<\/a> (2021).<\/p>\n

Zhou, H. et al. Data for \u201cLow-Overhead Transversal Fault Tolerance for Universal Quantum Computation\u201d. Zenodo https:\/\/doi.org\/10.5281\/zenodo.16552626<\/a> (2025).<\/p>\n","protected":false},"excerpt":{"rendered":"Dalzell, A. M. et al. Quantum Algorithms: A Survey of Applications and End-to-End Complexities (Cambridge Univ. Press, 2025).…\n","protected":false},"author":2,"featured_media":91518,"comment_status":"","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[21],"tags":[5477,371,1928,1929,111,139,69,8756,7836,147,145],"class_list":{"0":"post-91517","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-computing","8":"tag-computer-science","9":"tag-computing","10":"tag-humanities-and-social-sciences","11":"tag-multidisciplinary","12":"tag-new-zealand","13":"tag-newzealand","14":"tag-nz","15":"tag-quantum-information","16":"tag-quantum-mechanics","17":"tag-science","18":"tag-technology"},"_links":{"self":[{"href":"https:\/\/www.newsbeep.com\/nz\/wp-json\/wp\/v2\/posts\/91517","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.newsbeep.com\/nz\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.newsbeep.com\/nz\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.newsbeep.com\/nz\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.newsbeep.com\/nz\/wp-json\/wp\/v2\/comments?post=91517"}],"version-history":[{"count":0,"href":"https:\/\/www.newsbeep.com\/nz\/wp-json\/wp\/v2\/posts\/91517\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.newsbeep.com\/nz\/wp-json\/wp\/v2\/media\/91518"}],"wp:attachment":[{"href":"https:\/\/www.newsbeep.com\/nz\/wp-json\/wp\/v2\/media?parent=91517"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.newsbeep.com\/nz\/wp-json\/wp\/v2\/categories?post=91517"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.newsbeep.com\/nz\/wp-json\/wp\/v2\/tags?post=91517"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}