High-rate quantum LDPC codes for long-range-connected neutral atom registers
Abstract: High-rate quantum error correcting (QEC) codes with moderate overheads in qubit number and control complexity are highly desirable for achieving fault-tolerant quantum computing. Recently, quantum error correction has experienced significant progress both in code development and experimental realizations, with neutral atom qubit architecture rapidly establishing itself as a leading platform in the field. Scalable quantum computing will require processing with QEC codes that have low qubit overhead and large error suppression, and while such codes do exist, they involve a degree of non-locality that has yet to be integrated into experimental platforms. In this work, we analyze a family of high-rate Low-Density Parity-Check (LDPC) codes with limited long-range interactions and outline a near-term implementation in neutral atom registers. By means of circuit-level simulations, we find that these codes outperform surface codes in all respects when the two-qubit nearest neighbour gate error probability is below $\sim 0.1\%$. By using multiple laser colors, we show how these codes can be natively integrated in two-dimensional static neutral atom qubit architectures with open boundaries, where the desired long-range connectivity can be targeted via the Rydberg blockade interaction.
- A. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303, 2–30 (2003).
- N. P. Breuckmann and J. N. Eberhardt, Quantum low-density parity-check codes, PRX Quantum 2, 10.1103/prxquantum.2.040101 (2021).
- D. Gottesman, Fault-tolerant quantum computation with constant overhead (2014), arXiv:1310.2984 [quant-ph] .
- J.-P. Tillich and G. Zemor, Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Transactions on Information Theory 60, 1193–1202 (2014).
- A. A. Kovalev and L. P. Pryadko, Improved quantum hypergraph-product ldpc codes, in 2012 IEEE International Symposium on Information Theory Proceedings (IEEE, 2012).
- A. A. Kovalev and L. P. Pryadko, Quantum kronecker sum-product low-density parity-check codes with finite rate, Physical Review A 88, 10.1103/physreva.88.012311 (2013).
- R. Wang and L. P. Pryadko, Distance bounds for generalized bicycle codes (2022), arXiv:2203.17216 [quant-ph] .
- I. Bloch, J. Dalibard, and W. Zwerger, Many-body physics with ultracold gases, Reviews of Modern Physics 80, 885–964 (2008).
- M. Saffman, T. G. Walker, and K. Mølmer, Quantum information with rydberg atoms, Reviews of Modern Physics 82, 2313–2363 (2010).
- A. Browaeys and T. Lahaye, Many-body physics with individually controlled rydberg atoms, Nature Physics 16, 132–142 (2020).
- M. Morgado and S. Whitlock, Quantum simulation and computing with rydberg-interacting qubits, AVS Quantum Science 3, 10.1116/5.0036562 (2021).
- Y. Tomita and K. M. Svore, Low-distance surface codes under realistic quantum noise, Physical Review A 90, 10.1103/physreva.90.062320 (2014).
- C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5, 497 (2021).
- J. Roffe, LDPC: Python tools for low density parity check codes (2022).
- S. Jandura and G. Pupillo, Time-optimal two- and three-qubit gates for rydberg atoms, Quantum 6, 712 (2022).
- S. Jandura, J. D. Thompson, and G. Pupillo, Optimizing rydberg gates for logical-qubit performance, PRX Quantum 4, 020336 (2023b).
- T. F. Gallagher, Rydberg atoms, Reports on Progress in Physics 51, 143 (1988).
- A. O. Quintavalle, P. Webster, and M. Vasmer, Partitioning qubits in hypergraph product codes to implement logical gates, Quantum 7, 1153 (2023).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
