Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes
Abstract: Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance. In this work, motivated by current small-scale experimental quantum processing units, we devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes. We introduce a code construction based on algebraic manipulation of the parity-check matrix of GB codes, rather than manipulation of Tanner graphs. Our construction leads to families of quantum LDPC codes of small size, and we demonstrate numerically that their performance scales comparably to the performance of surface codes for similar sizes under a phenomenological noise model. The advantage of our code family is that they encode many logical qubits in one code, at the expense of non-local connectivity. We then explore three variants of the code construction focusing on reducing the long-range connectivity by bringing it closer to the current experimental capabilities of short-range connectivity devices.
- Peter W. Shor. “Scheme for reducing decoherence in quantum computer memory”. Physical Review A 52, R2493–R2496 (1995).
- Barbara M. Terhal. “Quantum error correction for quantum memories”. Reviews of Modern Physics 87, 307–346 (2015).
- “Quantum error correction for beginners”. Reports on Progress in Physics 76, 076001 (2013).
- “Fault-tolerant quantum computation with constant error rate” (1999).
- Robert G. Gallager. “Low-density parity-check codes”. The MIT Press. (1963).
- R. Tanner. “A recursive approach to low complexity codes”. IEEE Transactions on Information Theory 27, 533–547 (1981).
- “Near shannon limit performance of low density parity check codes”. Electronics Letters 33, 457 (1997).
- “An overview of channel coding for 5g nr cellular communications”. APSIPA Transactions on Signal and Information Processing8 (2019).
- “Application and evaluation of the ldpc codes for the next generation communication systems”. Pages 532–536. Springer Netherlands. (2008).
- Daniel Gottesman. “Fault-tolerant quantum computation with constant overhead” (2013).
- “Fault tolerance of quantum low-density parity check codes with sublinear distance scaling”. Physical Review A 87, 020304 (2013).
- “Quantum low-density parity-check codes”. PRX Quantum 2, 040101 (2021).
- “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).
- “Topological quantum memory”. Journal of Mathematical Physics 43, 4452–4505 (2002).
- “Projective plane and planar quantum codes”. Foundations of Computational Mathematics 1, 325–332 (2001).
- H. Bombin and M. A. Martin-Delgado. “Topological quantum distillation”. Physical Review Letters 97, 180501 (2006).
- “Surface codes: Towards practical large-scale quantum computation”. Physical Review A 86, 032324 (2012).
- “Decoding across the quantum low-density parity-check code landscape”. Physical Review Research 2, 043423 (2020).
- “Asymptotically good quantum and locally testable classical ldpc codes” (2021).
- “Quantum tanner codes” (2022).
- “Tradeoffs for reliable quantum information storage in 2d systems”. Physical Review Letters 104, 050503 (2010).
- “Quantifying nonlocality: How outperforming local quantum codes is expensive”. Physical Review Letters 129, 050505 (2022).
- “Constant-overhead quantum error correction with thin planar connectivity”. Physical Review Letters 129, 050504 (2022).
- “Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum ldpc codes” (2021).
- “Hierarchical memories: Simulating quantum ldpc codes with local gates” (2023).
- “Decoding quantum tanner codes” (2022).
- “Quantum kronecker sum-product low-density parity-check codes with finite rate”. Physical Review A 88, 012311 (2013).
- “Degenerate quantum ldpc codes with good finite length performance”. Quantum 5, 585 (2021).
- “Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays” (2023).
- “High-threshold and low-overhead fault-tolerant quantum memory” (2023).
- “Matching generalized-bicycle codes to neutral atoms for low-overhead fault-tolerance” (2023).
- “Sparse-graph codes for quantum error correction”. IEEE Transactions on Information Theory 50, 2315–2330 (2004).
- “Co-design quantum simulation of nanoscale nmr”. Physical Review Research 4, 043089 (2022).
- C. Monroe and J. Kim. “Scaling the ion trap quantum processor”. Science 339, 1164–1169 (2013).
- Terry Rudolph. “Why i am optimistic about the silicon-photonic route to quantum computing”. APL Photonics2 (2017).
- M. Morgado and S. Whitlock. “Quantum simulation and computing with rydberg-interacting qubits”. AVS Quantum Science3 (2021).
- “Logical quantum processor based on reconfigurable atom arrays”. Nature (2023).
- “Good quantum error-correcting codes exist”. Physical Review A 54, 1098–1105 (1996).
- A. M. Steane. “Error correcting codes in quantum theory”. Physical Review Letters 77, 793–797 (1996).
- Thomas J. Richardson. “Modern coding theory”. Cambridge University Press. (2008). url: www.cambridge.org/9780521852296.
- Ivan Djordjevic. “Quantum information processing, quantum computing, and quantum error correction an engineering approach”. Elsevier Science & Technology. (2021). url: https://doi.org/10.1016/C2019-0-04873-X.
- “Finite fields”. Page 772. Cambridge University Press. (2008). url: https://doi.org/10.1017/CBO9780511525926.
- Joschka Roffe. “Ldpc: Python tools for low density parity check codes” (2022).
- “Factor graphs and the sum-product algorithm”. IEEE Transactions on Information Theory 47, 498–519 (2001).
- David J. C. MacKay and Radford M. Neal. “Good codes based on very sparse matrices”. Pages 100–111. Springer Berlin Heidelberg. (1995).
- “Soft-decision decoding of linear block codes based on ordered statistics”. IEEE Transactions on Information Theory 41, 1379–1396 (1995).
- “Simplified variable-scaled min sum ldpc decoder for irregular ldpc codes”. In 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC). IEEE (2014).
- “The future of quantum computing with superconducting qubits”. Journal of Applied Physics132 (2022).
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.