Quantum Locally Recoverable Codes
Louis Golowich, Venkatesan Guruswami
Abstract
Classical locally recoverable codes, which permit highly efficient recovery from localized errors as well as global recovery from larger errors, provide some of the most useful codes for distributed data storage in practice. In this paper, we initiate the study of quantum locally recoverable codes (qLRCs). In the long term, like their classical counterparts, such qLRCs may be used for large-scale quantum data storage. Furthermore, our results have concrete implications for quantum LDPC codes, which are widely applicable to near-term quantum errorcorrection, as local recoverability is a weakening of the LDPC property.
After defining quantum local recoverability, we provide an explicit construction of qLRCs based on the classical LRCs of Tamo and Barg (2014), which we show have (1) a close-to-optimal rate-distance tradeoff (i.e. near the Singleton bound), (2) an efficient decoder, and (3) permit good spatial locality in a physical implementation. The analysis for both the distance and the efficient decoding of these quantum Tamo-Barg (qTB) codes is significantly more involved than in the classical case. Nevertheless, we obtain close-to-optimal parameters by introducing a "folded" version of these qTB codes, which we then analyze using a combination of algebraic techniques. We furthermore present and analyze two additional constructions using more basic techniques, namely random qLRCs, and qLRCs from AEL distance amplification. Each of these constructions has some advantages, but neither achieves all 3 properties of our folded qTB codes described above.
We complement these constructions with Singleton-like bounds that show our qLRC constructions achieve close-to-optimal parameters. We also apply these results to obtain Singletonlike bounds for qLDPC codes, which to the best of our knowledge are novel. We then show that even the weakest form of a stronger locality property called local correctability, which permits more robust local recovery and is achieved by certain classical codes, is impossible quantumly.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext bdad1f66-304f-4ffa-acdc-1ac462b14ac2Builds on6
- Asymptotically good Quantum and locally testable classical LDPC codesPavel Panteleev, Gleb KalachevSTOC 2022 · 214 citations
- Quantum Tanner codesAnthony Leverrier, Gilles ZémorFOCS 2022 · 121 citations
- Good Quantum LDPC Codes with Linear Time DecodersIrit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas VidickSTOC 2023 · 83 citations
- Explicit near-Ramanujan graphs of every degreeSidhanth Mohanty, Ryan O'Donnell, Pedro ParedesSTOC 2020 · 40 citations
- Approaching the Quantum Singleton Bound with Approximate Error CorrectionThiago Bergamaschi, Louis Golowich, Sam GunnSTOC 2024 · 6 citations
Related papers
- An Efficient Decoder for a Linear Distance Quantum LDPC CodeShouzhen Gu, Christopher A. Pattison, Eugene TangSTOC 2023 · 27 citations
- On the Power of Relaxed Local Decoding AlgorithmsTom Gur, Oded LachishSODA 2020 · 6 citations
- Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear CodesElena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey MonSTOC 2026 · 4 citations
- Decoding Quasi-Cyclic Quantum LDPC CodesLouis Golowich, Venkatesan GuruswamiFOCS 2024 · 1 citation
- Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear CodesFernando Granha Jeronimo, Nikhil ShagrithayaSTOC 2026 · 10 citations
