- Physical Review Journals
All JournalsPhysics Magazine

PRX Quantum

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Transversal Architecture for Megaquop-Scale Quantum Simulation with Neutral Atoms

Refaat Ismail1,2,*, I-Chi Chen3,4,*, Chen Zhao1,†, Ronen Weiss5, Fangli Liu1, Hengyun Zhou1, Sheng-Tao Wang1,‡, Andrew Sornborger3,§, and Milan Kornjača1,‖

  • *These authors contributed equally. Ordering by coin flip.
  • †Contact author: czhao@quera.com
  • ‡Contact author: swang@quera.com
  • §Contact author: sornborg@lanl.gov
  • ‖Contact author: mkornjaca@quera.com
PDF

PRX Quantum 7, 020343 – Published 29 May, 2026

DOI: https://doi.org/10.1103/j2fw-ccmy

Abstract

Quantum computing experiments have made remarkable progress in demonstrating key components of error-corrected quantum computing, a prerequisite for scalable quantum computation. While we anticipate the near-term arrival of early fault-tolerant quantum hardware capable of a million reliable quantum operations, the cost of preparing low-noise “magic resource states,” which are necessary for performing universal quantum computation, presents a formidable challenge. The recently proposed partially fault-tolerant architecture based on a space-time efficient analog rotation (STAR) approach attempts to address this challenge by using postselection to prepare low-noise, arbitrary small-angle magic states. Its proposed physical implementation, however, assumes fixed qubit connectivity, resulting in implementation costs closer to leading fully fault-tolerant approaches. In this work, we propose the transversal STAR architecture and co-design it with neutral-atom quantum hardware, deriving explicit and significant savings in logical layout, time, and space overhead. Through detailed circuit-level simulations, we derive the logical noise model for surface-code-based transversal STAR gadgets and verify their composability. At its limit, the transversal STAR architecture with neutral atoms can efficiently simulate local Hamiltonians with a total simulation volume exceeding 600, defined as the product of the number of logical qubits and Hamiltonian evolution timescales. Achieving this limit would require approximately 10 000 physical qubits at a physical error rate of 10−3. This is equivalent to a fully fault-tolerant computation requiring over 106–107T gates and a potential >100× saving on space-time volume for equivalent simulation over current, state-of-the-art protocols. Finally, we extend the transversal STAR architecture to high-rate quantum low-density parity-check codes, demonstrating how a limited set of highly parallel transversal Clifford gates and generalized small-angle magic injection can be utilized for effective quantum simulation. We anticipate that the co-designed transversal STAR architecture could substantially reduce the physical resources necessary for early fault-tolerant quantum simulation at the megaquop scale.

View figure in article

Physics Subject Headings (PhySH)

Popular Summary

Quantum computing is moving toward the “megaquop” era, where machines can execute millions of reliable operations. The main obstacle is cost: current fault-tolerant approaches devote most resources to producing “magic” states, which are needed for universal computation. This overhead greatly increases hardware requirements. We propose a different route: the transversal space-time efficient analog rotation architecture, which sharply reduces this cost and brings large-scale quantum simulation much closer. Our approach combines two ingredients. For most operations, we use transversal gates, which error correction efficiently supports. For the “magic” component, we generate small-angle resource states through postselection whose errors decrease with rotation angle. We co-design this scheme with neutral-atom hardware, whose reconfigurable connectivity enables fast transversal operations and routing. Circuit-level simulations show that the architecture reduces space-time cost by more than 100x versus leading fully fault-tolerant methods, while maintaining low error rates. We extend our approach to high-rate quantum codes with parallel, fast operations designed for specific quantum simulation tasks, further compressing the computational space. Together, these advances chart a realistic route to early fault-tolerant quantum simulation of materials and nonequilibrium physics.

Article Text

References (113)

  1. P. Shor, in Proceedings of 37th Conference on Foundations of Computer Science (IEEE, Los Alamitos, CA, USA, 1996), p. 56.
  2. E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature 549, 172 (2017).
  3. D. Bluvstein et al., Logical quantum processor based on reconfigurable atom arrays, Nature 626, 58 (2024).
  4. P. Sales Rodriguez et al., Experimental demonstration of logical magic state distillation, Nature 645, 620 (2025).
  5. A. Paetznick et al., Demonstration of logical qubits and repeated error correction with better-than-physical error rates, ArXiv:2404.02280.
  6. W. van Dam, H. Liu, G. H. Low, A. Paetznick, A. Paz, M. Silva, A. Sundaram, K. Svore, and M. Troyer, End-to-end quantum simulation of a chemical system, ArXiv:2409.05835.
  7. R. Acharya et al., Google Quantum AI and Collaborators, Quantum error correction below the surface code thresholdNature 638, 920 (2025).
  8. D. Bluvstein et al., Architectural mechanisms of a universal fault-tolerant quantum computer, Nature 649, 39 (2026).
  9. J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2, 79 (2018).
  10. J. Preskill, Beyond NISQ: The megaquop machine, ACM Trans. Quantum Comput. 6, 18 (2025).
  11. E. T. Campbell, Early fault-tolerant simulations of the Hubbard model, Quantum Sci. Technol. 7, 015007 (2022).
  12. A. J. Daley, I. Bloch, C. Kokail, S. Flannigan, N. Pearson, M. Troyer, and P. Zoller, Practical quantum advantage in quantum simulation, Nature 607, 667 (2022).
  13. L. Lin and Y. Tong, Heisenberg-limited ground-state energy estimation for early fault-tolerant quantum computers, PRX Quantum 3, 010318 (2022).
  14. R. Weiss, A. Baroni, J. Carlson, and I. Stetcu, Solving reaction dynamics with quantum computing algorithms, Phys. Rev. C 111, 064004 (2025).
  15. X. Zhou, D. W. Leung, and I. L. Chuang, Methodology for quantum logic gate construction, Phys. Rev. A 62, 052316 (2000).
  16. B. Eastin and E. Knill, Restrictions on transversal encoded quantum gate sets, Phys. Rev. Lett. 102, 110502 (2009).
  17. T. J. Yoder, R. Takagi, and I. L. Chuang, Universal fault-tolerant gates on concatenated stabilizer codes, Phys. Rev. X 6, 031039 (2016).
  18. M. E. Beverland, A. Kubica, and K. M. Svore, Cost of universality: A comparative study of the overhead of state distillation and code switching with color codes, PRX Quantum 2, 020341 (2021).
  19. N. J. Ross and P. Selinger, Optimal ancilla-free Clifford + T approximation of z-rotations, Quantum Inf. Comput. 16, 901 (2016).
  20. V. Kliuchnikov, D. Maslov, and M. Mosca, Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits, IEEE Trans. Comput. 65, 161 (2016).
  21. K. Yin, X. Fang, Z. Chen, A. Li, D. Hayes, E. Kaur, R. Nejabati, H. Haeffner, W. Campbell, E. Hudson, J. Palsberg, T. Humble, and Y. Ding, Flexion: Adaptive in-situ encoding for on-demand QEC in ion trap systems, ArXiv:2504.16303.
  22. S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Phys. Rev. A 71, 022316 (2005).
  23. C. Gidney, N. Shutty, and C. Jones, Magic state cultivation: Growing T states as cheap as cnot gates, ArXiv:2409.17595.
  24. Z.-H. Chen, M.-C. Chen, C.-Y. Lu, and J.-W. Pan, Efficient magic state cultivation on RP2, ArXiv:2503.18657.
  25. S. Bravyi and R. König, Classification of topologically protected gates for local stabilizer codes, Phys. Rev. Lett. 110, 170503 (2013).
  26. H. Zhou, C. Zhao, M. Cain, D. Bluvstein, C. Duckering, H.-Y. Hu, S.-T. Wang, A. Kubica, and M. D. Lukin, Algorithmic fault tolerance for fast quantum computing, Nature 646, 303 (2025).
  27. Y. Akahoshi, K. Maruyama, H. Oshima, S. Sato, and K. Fujii, Partially fault-tolerant quantum computing architecture with error-corrected Clifford gates and space-time efficient analog rotations, PRX Quantum 5, 010337 (2024).
  28. R. Toshio, Y. Akahoshi, J. Fujisaki, H. Oshima, S. Sato, and K. Fujii, Practical quantum advantage on partially fault-tolerant quantum computer, Phys. Rev. X 15, 021057 (2025).
  29. Y. Akahoshi, R. Toshio, J. Fujisaki, H. Oshima, S. Sato, and K. Fujii, Compilation of trotter-based time evolution for partially fault-tolerant quantum computing architecture, PRX Quantum 6, 040319 (2025).
  30. H. Choi, F. T. Chong, D. Englund, and Y. Ding, Fault tolerant non-Clifford state preparation for arbitrary rotations, ArXiv:2303.17380.
  31. J. Gavriel, D. Herr, A. Shaw, M. J. Bremner, A. Paler, and S. J. Devitt, Transversal injection for direct encoding of ancilla states for non-Clifford gates using stabilizer codes, Phys. Rev. Res. 5, 033019 (2023).
  32. Z.-C. He and Z.-Y. Xue, High-fidelity initialization a logical qubit with multiple injections, Phys. Rev. A 111, 052419 (2025).
  33. S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary, ArXiv:quant-ph/9811052.
  34. A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A 86, 032324 (2012).
  35. A. M. Stephens, Fault-tolerant thresholds for quantum error correction with the surface code, Phys. Rev. A 89, 022321 (2014).
  36. D. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New J. Phys. 14, 123011 (2012).
  37. D. Litinski, A game of surface codes: Large-scale quantum computing with lattice surgery, Quantum 3, 128 (2019).
  38. H. Bernien, S. Schwartz, A. Keesling, H. Levine, A. Omran, H. Pichler, S. Choi, A. S. Zibrov, M. Endres, M. Greiner, V. Vuletić, and M. D. Lukin, Probing many-body dynamics on a 51-atom quantum simulator, Nature 551, 579 (2017).
  39. S. Ebadi, T. T. Wang, H. Levine, A. Keesling, G. Semeghini, A. Omran, D. Bluvstein, R. Samajdar, H. Pichler, W. W. Ho, S. Choi, S. Sachdev, M. Greiner, V. Vuletić, and M. D. Lukin, Quantum phases of matter on a 256-atom programmable quantum simulator, Nature 595, 227 (2021).
  40. D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner, V. Vuletić, and M. D. Lukin, A quantum processor based on coherent transport of entangled atom arrays, Nature 604, 451 (2022).
  41. J. Wurtz, A. Bylinskii, B. Braverman, J. Amato-Grill, S. H. Cantu, F. Huber, A. Lukin, F. Liu, P. Weinberg, J. Long, S.-T. Wang, N. Gemelke, and A. Keesling, Aquila: Quera’s 256-qubit neutral-atom quantum computer, ArXiv:2306.11727.
  42. N.-C. Chiu, E. C. Trapp, J. Guo, M. H. Abobeih, L. M. Stewart, S. Hollerith, P. Stroganov, M. Kalinowski, A. A. Geim, S. J. Evered, S. H. Li, L. M. Peters, D. Bluvstein, T. T. Wang, M. Greiner, V. Vuletić, and M. D. Lukin, Continuous operation of a coherent 3000-qubit system, Nature 646, 1075 (2025).
  43. S. J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara, H. Levine, G. Semeghini, M. Greiner, V. Vuletić, and M. D. Lukin, High-fidelity parallel entangling gates on a neutral-atom quantum computer, Nature 622, 268 (2023).
  44. M. Cain, C. Zhao, H. Zhou, N. Meister, J. P. B. Ataides, A. Jaffe, D. Bluvstein, and M. D. Lukin, Correlated decoding of logical algorithms with transversal gates, Phys. Rev. Lett. 133, 240602 (2024).
  45. N. P. Breuckmann and S. Burton, Fold-transversal Clifford gates for quantum codes, Quantum 8, 1372 (2024).
  46. Z.-H. Chen, M.-C. Chen, C.-Y. Lu, and J.-W. Pan, Transversal logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays, ArXiv:2412.01391.
  47. N. P. Breuckmann and J. N. Eberhardt, Quantum low-density parity-check codes, PRX Quantum 2, 040101 (2021).
  48. L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, Low-overhead fault-tolerant quantum computing using long-range connectivity, Sci. Adv. 8, eabn1717 (2022).
  49. A. O. Quintavalle, P. Webster, and M. Vasmer, Partitioning qubits in hypergraph product codes to implement logical gates, Quantum 7, 1153 (2023).
  50. S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, High-threshold and low-overhead fault-tolerant quantum memory, Nature 627, 778 (2024).
  51. Q. Xu, J. P. Bonilla Ataides, C. A. Pattison, N. Raveendran, D. Bluvstein, J. Wurtz, B. Vasić, M. D. Lukin, L. Jiang, and H. Zhou, Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays, Nat. Phys. 20, 1084 (2024).
  52. S. A. Moses et al., A race-track trapped-ion quantum processor, Phys. Rev. X 13, 041052 (2023).
  53. J. N. Eberhardt and V. Steffan, Logical operators and fold-transversal gates of bivariate bicycle codes, ArXiv:2407.03973.
  54. A. G. Fowler and C. Gidney, Low overhead quantum computation using lattice surgery, ArXiv:1808.06709.
  55. M. Cain, D. Bluvstein, C. Zhao, S. Gu, N. Maskara, M. Kalinowski, A. A. Geim, A. Kubica, M. D. Lukin, and H. Zhou, Fast correlated decoding of transversal logical algorithms, ArXiv:2505.13587.
  56. A. A. Kovalev and L. P. Pryadko, Quantum Kronecker sum-product low-density parity-check codes with finite rate, Phys. Rev. A 88, 012311 (2013).
  57. H. Zhou, C. Duckering, C. Zhao, D. Bluvstein, M. Cain, A. Kubica, S.-T. Wang, and M. D. Lukin, in Proceedings of the 52nd Annual International Symposium on Computer Architecture, ISCA ’25 (Association for Computing Machinery, New York, NY, USA, 2025), p. 1432.
  58. G. Baranes, M. Cain, J. P. B. Ataides, D. Bluvstein, J. Sinclair, V. Vuletic, H. Zhou, and M. D. Lukin, Leveraging atom loss errors in fault tolerant quantum algorithms, Phys. Rev. X 16, 011002 (2026).
  59. Y. Wu, B. Li, K. Chang, S. Puri, and L. Zhong, Minimum-weight parity factor decoder for quantum error correction, ArXiv:2508.04969.
  60. J. Roffe, D. R. White, S. Burton, and E. Campbell, Decoding across the quantum low-density parity-check code landscape, Phys. Rev. Res. 2, 043423 (2020).
  61. J. Roffe, LDPC: Python tools for low density parity check codes, https://pypi.org/project/ldpc/ (2022).
  62. N. Delfosse, V. Londe, and M. E. Beverland, Toward a union-find decoder for quantum LDPC codes, IEEE Trans. Inf. Theory 68, 3187 (2022).
  63. M. Serra-Peralta, M. H. Shaw, and B. M. Terhal, Decoding across transversal Clifford gates in the surface code, PRX Quantum 7, 010335 (2026).
  64. O. Higgott, T. C. Bohdanowicz, A. Kubica, S. T. Flammia, and E. T. Campbell, Improved decoding of circuit noise and fragile boundaries of tailored surface codes, Phys. Rev. X 13, 031007 (2023).
  65. A. Calderbank, E. Rains, P. Shor, and N. Sloane, in Proceedings of IEEE International Symposium on Information Theory (IEEE, Los Alamitos, CA, USA, 1997), p. 292.
  66. R. Acharya et al., Suppressing quantum errors by scaling a surface code logical qubit, Nature 624, 289 (2024).
  67. E. Campbell, Random compiler for fast Hamiltonian simulation, Phys. Rev. Lett. 123, 070503 (2019).
  68. I. D. Kivlichan, J. McClean, N. Wiebe, C. Gidney, A. Aspuru-Guzik, G. K.-L. Chan, and R. Babbush, Quantum simulation of electronic structure with linear depth and connectivity, Phys. Rev. Lett. 120, 110501 (2018).
  69. A. Bocharov, M. Roetteler, and K. M. Svore, Efficient synthesis of universal repeat-until-success quantum circuits, Phys. Rev. Lett. 114, 080502 (2015).
  70. C. Gidney, Halving the cost of quantum addition, Quantum 2, 74 (2018).
  71. A. Kan and B. Symons, Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models, npj Quantum Inf. 11, 138 (2025).
  72. A. M. Childs, D. Maslov, Y. Nam, N. J. Ross, and Y. Su, Toward the first quantum simulation with quantum speedup, Proc. Natl. Acad. Sci. 115, 9456 (2018).
  73. L. A. Martínez-Martínez, P. D. Kamath, and A. F. Izmaylov, Estimating trotter approximation errors to optimize hamiltonian partitioning for lower eigenvalue errors, ArXiv:2312.13282.
  74. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland Mathematical Library (North-Holland, Amsterdam, 1977), Vol. 16.
  75. Q. Xu, H. Zhou, G. Zheng, D. Bluvstein, J. P. B. Ataides, M. D. Lukin, and L. Jiang, Fast and parallelizable logical computation with homological product codes, Phys. Rev. X 15, 021065 (2025).
  76. J.-P. Tillich and G. Zemor, Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Trans. Inf. Theory 60, 1193 (2014).
  77. N. Berthusen, M. J. Gullans, Y. Hong, M. Mudassar, and S. J. S. Tan, Automorphism gadgets in homological product codes, ArXiv:2508.04794.
  78. R. C. Bose and D. K. Ray-Chaudhuri, On a class of error correcting binary group codes, Inf. Control 3, 68 (1960).
  79. A. Hocquenghem, Codes correcteurs d’erreurs, Chiffres 2, 147 (1959).
  80. A. A. Kovalev and L. P. Pryadko, in 2012 IEEE International Symposium on Information Theory Proceedings (IEEE, Los Alamitos, CA, USA, 2012), p. 348.
  81. A. Aydin, N. Delfosse, and E. Tham, Cyclic hypergraph product code, ArXiv:2511.09683.
  82. Q. Xu, H. Zhou, D. Bluvstein, M. Cain, M. Kalinowski, J. Preskill, M. D. Lukin, and N. Maskara, Batched high-rate logical operations for quantum LDPC codes, ArXiv:2510.06159.
  83. P. Jordan and E. Wigner, Über das paulische Äquivalenzverbot, Z. Phys. 47, 631 (1928).
  84. F. Verstraete and J. I. Cirac, Mapping local Hamiltonians of fermions to local Hamiltonians of spins, J. Stat. Mech.: Theory Exp. 2005, P09012 (2005).
  85. S. J. Evered, M. Kalinowski, A. A. Geim, T. Manovitz, D. Bluvstein, S. H. Li, N. Maskara, H. Zhou, S. Ebadi, M. Xu, J. Campo, M. Cain, S. Ostermann, S. F. Yelin, S. Sachdev, M. Greiner, V. Vuletić, and M. D. Lukin, Probing topological matter and fermion dynamics on a neutral-atom quantum computer, Nature 645, 341 (2025).
  86. S. B. Bravyi and A. Y. Kitaev, Fermionic quantum computation, Ann. Phys. (N. Y.) 298, 210 (2002).
  87. C. Derby, J. Klassen, J. Bausch, and T. Cubitt, Compact fermion to qubit mappings, Phys. Rev. B 104, 035118 (2021).
  88. T. J. Yoder, E. Schoute, P. Rall, E. Pritchett, J. M. Gambetta, A. W. Cross, M. Carroll, and M. E. Beverland, Tour de gross: A modular quantum computer based on bivariate bicycle codes, ArXiv:2506.03094.
  89. J. P. B. Ataides, H. Zhou, Q. Xu, G. Baranes, B. Li, M. D. Lukin, and L. Jiang, Constant-overhead fault-tolerant bell-pair distillation using high-rate codes, Phys. Rev. Lett. 135, 130804 (2025).
  90. S. Yang and R. Calderbank, Spatially-coupled QLDPC codes, Quantum 9, 1693 (2025).
  91. R. Haghshenas et al., Digital quantum magnetism on a trapped-ion quantum computer, Nature 653, 56 (2026).
  92. Z. Ding and L. Lin, Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation, PRX Quantum 4, 020331 (2023).
  93. X. Mi et al., Stable quantum-correlated many-body states through engineered dissipation, Science 383, 1332 (2024).
  94. E. N. Epperly, L. Lin, and Y. Nakatsukasa, A theory of quantum subspace diagonalization, SIAM J. Matrix Anal. Appl. 43, 1263 (2022).
  95. Y. Shen, K. Klymko, J. Sud, D. B. Williams-Young, W. A. de Jong, and N. M. Tubman, Real-time Krylov theory for quantum computing algorithms, Quantum 7, 1066 (2023).
  96. N. Yoshioka, M. Amico, W. Kirby, P. Jurcevic, A. Dutt, B. Fuller, S. Garion, H. Haas, I. Hamamura, A. Ivrii, R. Majumdar, Z. Minev, M. Motta, B. Pokharel, P. Rivero, K. Sharma, C. J. Wood, A. Javadi-Abhari, and A. Mezzacapo, Diagonalization of large many-body Hamiltonians on a quantum processor, Nat. Commun. 16, 5014 (2025).
  97. K. Klymko, C. Mejuto-Zaera, S. J. Cotton, F. Wudarski, M. Urbanek, D. Hait, M. Head-Gordon, K. B. Whaley, J. Moussa, N. Wiebe, W. A. de Jong, and N. M. Tubman, Real time evolution for ultracompact hamiltonian eigenstates on quantum hardware, PRX Quantum 3, 020323 (2022).
  98. J. Yu, J. R. Moreno, J. T. Iosue, L. Bertels, D. Claudino, B. Fuller, P. Groszkowski, T. S. Humble, P. Jurcevic, W. Kirby, T. A. Maier, M. Motta, B. Pokharel, A. Seif, A. Shehata, K. J. Sung, M. C. Tran, V. Tripathi, A. Mezzacapo, and K. Sharma, Quantum-centric algorithm for sample-based Krylov diagonalization, ArXiv:2501.09702.
  99. J. Robledo-Moreno, M. Motta, H. Haas, A. Javadi-Abhari, P. Jurcevic, W. Kirby, S. Martiel, K. Sharma, S. Sharma, T. Shirakawa, I. Sitdikov, R.-Y. Sun, K. J. Sung, M. Takita, M. C. Tran, S. Yunoki, and A. Mezzacapo, Chemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer, Sci. Adv. 11, eadu9991 (2025).
  100. J. Günther, F. Witteveen, A. Schmidhuber, M. Miller, M. Christandl, and A. Harrow, Phase estimation with partially randomized time evolution, ArXiv:2503.05647.
  101. S. Luthra, A. E. Moylett, D. E. Browne, and E. T. Campbell, Unlocking early fault-tolerant quantum computing with mitigated magic dilution, Quantum Sci. Technol. 10, 045066 (2025).
  102. O. Higgott and C. Gidney, Sparse blossom: Correcting a million errors per core second with minimum-weight matching, Quantum 9, 1600 (2025).
  103. L. Yang, Y. Wu, and L. Zhong, in 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE Computer Society, Los Alamitos, CA, USA, 2024), p. 581.
  104. J. P. B. Ataides, A. Gu, S. F. Yelin, and M. D. Lukin, Neural decoders for universal quantum algorithms, ArXiv:2509.11370.
  105. Y. Wu and L. Zhong, in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE, Los Alamitos, CA, USA, 2023), Vol. 1, p. 928.
  106. T. Maurer, M. Bühler, M. Kröner, F. Haverkamp, T. Müller, D. Vandeth, and B. R. Johnson, Real-time decoding of the gross code memory with FPGAs, ArXiv:2510.21600.
  107. C. Gidney, Stim: A fast stabilizer circuit simulator, Quantum 5, 497 (2021).
  108. Gurobi Optimization, LLC, Gurobi Optimizer Reference Manual, https://www.gurobi.com (2026).
  109. M. J. Gibbons, C. D. Hamley, C.-Y. Shih, and M. S. Chapman, Nondestructive fluorescent state detection of single neutral atom qubits, Phys. Rev. Lett. 106, 133002 (2011).
  110. H. J. Manetsch, G. Nomura, E. Bataille, X. Lv, K. H. Leung, and M. Endres, A tweezer array with 6100 highly coherent atomic qubits, Nature 647, 60 (2025).
  111. C. Gross, Qubit readout boost, Nat. Phys. 15, 523 (2019).
  112. F. Gyger, M. Ammenwerth, R. Tao, H. Timme, S. Snigirev, I. Bloch, and J. Zeiher, Continuous operation of large-scale atom arrays in optical lattices, Phys. Rev. Res. 6, 033104 (2024).
  113. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems (Prentice-Hall, Englewood Cliffs, NJ, 1974), p. 161, chapter 23.

Outline

Information

PRX Quantum 7, 020343– Published 29 May, 2026
  • Received 2 October 2025
  • Revised 18 February 2026
  • Accepted 13 April 2026
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation