Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR23-173 | 15th November 2023 04:32

Quantum Locally Recoverable Codes

RSS-Feed




TR23-173
Authors: Louis Golowich, Venkatesan Guruswami
Publication: 15th November 2023 06:24
Downloads: 166
Keywords: 


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 error-correction, 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 Singleton-like 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.



ISSN 1433-8092 | Imprint