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

Nonlocal resources for error correction in quantum low-density parity-check codes

Omprakash Chandra1,*, Gopikrishnan Muraleedharan1, and Gavin K. Brennen1,2

  • 1Center for Engineered Quantum Systems, School of Mathematical and Physical Sciences, Macquarie University, North Ryde, New South Wales 2109, Australia
  • 2BTQ Technologies, 16-104 555 Burrard Street, Vancouver, British Columbia, Canada V7X 1M8

  • *Contact author: omprakash.chandra@hdr.mq.edu.au

Phys. Rev. Research 7, 033247 – Published 12 September, 2025

DOI: https://doi.org/10.1103/x1rk-yg29

Abstract

Quantum low-density parity-check (qLDPC) codes with high-performance and nonlocal stabilizers are an attractive alternative to the surface code because of their relatively high code rate and distance. However, unlike the surface code that has simple, geometrically local, stabilizer checks, qLDPC codes with nonlocal stabilizers are challenging to measure. Recent advances have shown how to deterministically perform high-fidelity, cavity-mediated many-body gates, enabling the encoding and decoding of nonlocal GHZ states. We show how to use this resource for constant-depth fault-tolerant stabilizer measurements in hypergraph product and lifted product codes. Using circuit-level noise simulations, including leakage and collective error from the noise-optimized cavity-mediated gate, we find promising thresholds of 0.84%–0.60% for the hypergraph product code and pseudothreshold of 0.3%–0.4% for the lifted product codes, with cavity cooperativities in the range C∼104–106. We propose a trilayer architecture, compatible with neutral atom platforms, which enhances circuit parallelizability.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (68)

  1. P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A 52, R2493 (1995).
  2. A. Y. Kitaev, Quantum computations: Algorithms and error correction, Russ. Math. Surv. 52, 1191 (1997).
  3. S. B. Bravyi, and A. Y. Kitaev, Quantum codes on a lattice with boundary, arXiv:quant-ph/9811052.
  4. A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303, 2 (2003).
  5. E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, J. Math. Phys. 43, 4452 (2002).
  6. S. Ebadi, T. T. Wang, H. Levine, A. Keesling, G. Semeghini, A. Omran, D. Bluvstein, R. Samajdar, H. Pichler, W. W. Ho et al., Google quantum AI and collaborators, quantum computational advantage using a programmable photonic processor, Nature (London) 595, 227 (2021).
  7. D. Ristè, M. P. da Silva, C. A. Ryan, A. W. Cross, A. D. Córcoles, J. A. Smolin, J. M. Gambetta, J. M. Chow, and B. R. Johnson, Demonstration of quantum advantage in machine learning, npj Quantum Inf. 3, 16 (2017).
  8. T. H. Taminiau, J. Cramer, N. Kalb, M. S. Blok, L. Hensen, M. Markham, D. J. Twitchen, and R. Hanson, Universal control and error correction in multi-qubit spin registers in diamond, Nat. Nanotech. 9, 171 (2014).
  9. S. Bravyi, D. Poulin, and B. M. Terhal, Trade-offs for reliable quantum information storage in 2D systems, Phys. Rev. Lett. 104, 050503 (2010).
  10. N. P. Breuckmann and J. N. Eberhardt, Quantum low-density parity-check codes, PRX Quantum 2, 040101 (2021).
  11. J.-P. Tillich and G. Zémor, Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Trans. Inf. Theory 60, 1193 (2013).
  12. P. Panteleev and G. Kalachev, Quantum LDPC codes with almost linear minimum distance, IEEE Trans. Inf. Theory 68, 213 (2021).
  13. 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 (London) 627, 778 (2024).
  14. 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).
  15. T. Hillmann, L. Berent, A. O Quintavalle, J. Eisert, R. Wille, and J. Roffe, Localized statistics decoding: A parallel decoding algorithm for quantum low-density parity-check codes, arXiv:2406.18655.
  16. L. Skoric, D. E. Browne, K. M. Barnes, N. I. Gillespie, and E. T. Campbell, Parallel window decoding enables scalable fault tolerant quantum computation, Nat. Commun. 14, 7040 (2023).
  17. N. Berthusen, D. Devulapalli, E. Schoute, A. M. Childs, M. J. Gullans, A. V. Gorshkov, and D. Gottesman, Toward a 2D local implementation of quantum low-density parity-check codes, PRX Quantum 6, 010306 (2025).
  18. M. Saffman, T. G. Walker, and K. Mølmer, Quantum information with Rydberg atoms, Rev. Mod. Phys. 82, 2313 (2010).
  19. H. Levine, A. Keesling, A. Omran, H. Bernien, S. Schwartz, A. S. Zibrov, M. Endres, M. Greiner, V. Vuletic, and M. D. Lukin, High-fidelity control and entanglement of Rydberg-atom qubits, Phys. Rev. Lett. 121, 123603 (2018).
  20. A. Browaeys and T. Lahaye, Many-body physics with individually controlled Rydberg atoms, Nat. Phys. 16, 132 (2020).
  21. 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).
  22. L. Pecorari, S. Jandura, G. K. Brennen, and G. Pupillo, High-rate quantum LDPC codes for long-range-connected neutral atom registers, Nat. Commun. 16, 1111 (2025).
  23. C. Poole, T. M. Graham, M. A. Perlin, M. Otten, and M. Saffman, Architecture for fast implementation of quantum low-density parity-check codes with optimized Rydberg gates, Phys. Rev. A 111, 022433 (2025).
  24. M. Morgado and S. Whitlock, Quantum simulation and computing with Rydberg-interacting qubits, AVS Quantum Sci. 3, 023501 (2021).
  25. J. Ramette, J. Sinclair, Z. Vendeiro, A. Rudelis, M. Cetina, and V. Vuletić, Any-to-any connected cavity-mediated architecture for quantum computing with trapped ions or Rydberg arrays, PRX Quantum 3, 010344 (2022).
  26. S. Jandura, V. Srivastava, L. Pecorari, G. K. Brennen, and G. Pupillo, Nonlocal multiqubit quantum gates via a driven cavity, Phys. Rev. A 110, 062610 (2024).
  27. D. P. DiVincenzo and P. Aliferis, Effective fault-tolerant quantum computation with slow measurements, Phys. Rev. Lett. 98, 020501 (2007).
  28. B. Grinkemeyer, E. Guardado-Sanchez, I. Dimitrova, D. Shchepanovich, G. E. Mandopoulou, J. Borregaard, V. Vuletić, and M. D. Lukin, Error-detected quantum operations with neutral atoms mediated by an optical cavity, Science 387, 1301 (2025).
  29. A. Suleymanzade, A. Anferov, M. Stone, R. K. Naik, A. Oriani, J. Simon, and D. Schuster, A tunable high-Q millimeter wave cavity for hybrid circuit and cavity QED experiments, Appl. Phys. Lett. 116, 104001 (2020).
  30. P. Rabl, D. DeMille, J. M. Doyle, M. D. Lukin, R. J. Schoelkopf, and P. Zoller, Hybrid quantum processors: Molecular ensembles as quantum memory for solid state circuits, Phys. Rev. Lett. 97, 033003 (2006).
  31. I. N. Moskalenko, I. A. Simakov, N. N. Abramov, A. A. Grigorev, D. O. Moskalev, A. A. Pishchimova, N. S. Smirnov, E. V. Zikiy, I. A. Rodionov, and I. S. Besedin, High fidelity two-qubit gates on fluxoniums using a tunable coupler, npj Quantum Inf. 8, 130 (2022).
  32. Y. Wu, S. Kolkowitz, S. Puri, and J. D. Thompson, Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays, Nat. Commun. 13, 4657 (2022).
  33. N. Delfosse and B. W Reichardt, Short Shor-style syndrome sequences, arXiv:2008.05051.
  34. R. Chao and B. W. Reichardt, Flag fault-tolerant error correction for any stabilizer code, PRX Quantum 1, 010302 (2020).
  35. P. W. Shor, Fault-tolerant quantum computation, in Proceedings of 37th Conference on Foundations of Computer Science (IEEE Computer Society, USA, 1996), pp. 56–65.
  36. P. Aliferis, D. Gottesman, and J. Preskill, Quantum accuracy threshold for concatenated distance-3 codes, Quant. Info. Comput. 6, 97 (2006).
  37. D. Gottesman, Stabilizer codes and quantum error correction, PhD thesis, California Institute of Technology (IEEE Computer Society, USA, 1997).
  38. A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54, 1098 (1996).
  39. A. Steane, Multiple-particle interference and quantum error correction, Proc. R. Soc. London A 452, 2551 (1996).
  40. R. Gallager, Low-density parity-check codes, IEEE Trans. Inform. Theory 8, 21 (1962).
  41. M. Sipser and D. A. Spielman, Expander codes, IEEE Trans. Inf. Theory 42, 1710 (1996).
  42. C. Gidney, Stim: A fast stabilizer circuit simulator, Quantum 5, 497 (2021).
  43. A. O. Quintavalle, and E. T. Campbell, Reshape: A decoder for hypergraph product codes, IEEE Trans. Inf. Theory 68, 6569 (2022).
  44. 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).
  45. IQM quantum computers, iqm quantum computers achieves new technology milestones with 99.9% 2-qubit gate fidelity and 1 millisecond coherence time, 7, 2024 Press Release.
  46. 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).
  47. A. Kumar, A. Suleymanzade, M. Stone, L. Taneja, A. Anferov, D. I. Schuster, and J. Simon, Quantum-enabled millimetre wave to optical transduction using neutral atoms, Nature (London) 615, 614 (2023).
  48. T. Zhang, M. Wu, S. R. Cohen, L. Xin, D. Das, K. K. S. Multani, N. Peard, A.-M. Valente-Feliciano, P. B. Welander, A. H. Safavi-Naeini et al., Optically accessible high-finesse millimeter-wave resonator for cavity quantum electrodynamics with atom arrays, arXiv:2506.05804.
  49. T. H. Chang, T. N. Wang, J. Hsiang-Hua, and Y.-C. Chen, High-fidelity Rydberg controlled-z gates with optimized pulses, New J. Phys. 25, 123007 (2023).
  50. M. Gökduman, H. Yao, and H. D Pfister, Erasure decoding for quantum LDPC codes via belief propagation with guided decimation, in 2024 60th Annual Allerton Conference on Communication, Control, and Computing (IEEE, USA, 2024), pp. 1–8.
  51. L. Pecorari and G. Pupillo, Quantum LDPC codes for erasure-biased atomic quantum processors, arXiv:2502.20189.
  52. M. Schlosser, S. Tichelmann, D. Schäffner, D. O. de Mello, M. Hambach, J. Schütz, and G. Birkl, Scalable multilayer architecture of assembled single-atom qubit arrays in a three-dimensional Talbot tweezer lattice, Phys. Rev. Lett. 130, 180601 (2023).
  53. Y. Hong, E. Durso-Sabina, D. Hayes, and A. Lucas, Entangling four logical qubits beyond break-even in a nonlocal code, Phys. Rev. Lett. 133, 180601 (2024).
  54. J. C. Bohorquez, R. Chinnarasu, J. Isaacs, D. Booth, M. Beck, R. McDermott, and M. Saffman, Reducing Rydberg-state dc polarizability by microwave dressing, Phys. Rev. A 108, 022805 (2023).
  55. C. Cade, L. Mineh, A. Montanaro, and S. Stanisic, Strategies for solving the Fermi-Hubbard model on near-term quantum computers, Phys. Rev. B 102, 235122 (2020).
  56. J. Roffe, LDPC: Python tools for low density parity check codes, PyPI, https://pypi.org/project/ldpc, (2022).
  57. A. O. Quintavalle, P. Webster, and M. Vasmer, Partitioning qubits in hypergraph product codes to implement logical gates, Quantum 7, 1153 (2023).
  58. D. Poulin and Y. Chung, On the iterative decoding of sparse quantum codes, Quantum Info. Comput. 8, 987 (2008).
  59. N. Delfosse and N. H Nickerson, Almost-linear time decoding algorithm for topological codes, Quantum 5, 595 (2021).
  60. P. Panteleev and G. Kalachev, Degenerate quantum LDPC codes with good finite length performance, Quantum 5, 585 (2021).
  61. A. deMarti iOlius, P. Fuentes, R. Orús, P. M. Crespo, and J. E. Martinez, Decoding algorithms for surface codes, Quantum 8, 1498 (2024).
  62. P. Fuentes, J. E. Martinez, P. M. Crespo, and J. Garcia-Frías, Degeneracy and its impact on the decoding of sparse quantum codes, IEEE Access 9, 89093 (2021).
  63. P. Iyer and D. Poulin, Hardness of decoding quantum stabilizer codes, IEEE Trans. Inf. Theory 61, 5209 (2015).
  64. H. Cao, F. Pan, Y. Wang, and P. Zhang, qecGPT: Decoding quantum error-correcting codes with generative pre-trained transformers, arXiv:2307.09025.
  65. D. J. C. MacKay, Good error-correcting codes based on very sparse matrices, IEEE Trans. Inf. Theory 45, 399 (1999).
  66. S.-Y. Chung, G. D. Forney, T. J. Richardson, and R. Urbanke, On the design of low-density parity-check codes within 0.0045 db of the Shannon limit, IEEE Commun. Lett. 5, 58 (2001).
  67. N. Raveendran and B. Vasić, Trapping sets of quantum LDPC codes, Quantum 5, 562 (2021).
  68. T. Richardson, Error floors of LDPC codes, in Proceedings of the Annual Allerton Conference on Communication Control and Computing (2003), Vol. 41, pp. 1426–1435.

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation