Journal article · 2026 · Open access
Improved bounds and optimal constructions of pure quantum locally recoverable codes
IEEE Transactions on Information Theory, 1 · Published 1 January 2026 · DOI 10.1109/tit.2026.3734348
In brief
“Improved bounds and optimal constructions of pure quantum locally recoverable codes” is a 2026 journal article by Yang Li and 3 co-authors, published in IEEE Transactions on Information Theory. OpenAlex counts 19 citations as of 17 November 2026, which puts it in the top 1% of works published in 2026 by citations. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 19
- Most cited in
- 2026 (19)
- Field-weighted impact
- 28.12
- References
- 37
- Authors
- 4
Abstract
By incorporating the concept of locality into quantum information theory, quantum locally recoverable codes (qLRCs) have been proposed, motivated by their potential applications in large-scale quantum data storage and their relevance to quantum LDPC codes. Despite the progress in optimal quantum error-correcting codes (QECCs), optimal constructions of qLRCs remain largely unexplored, partly due to the fact that the existing bounds for qLRCs are not sufficiently tight. In this paper, we focus on pure qLRCs derived from the Hermitian construction. We provide several new bounds for pure qLRCs and demonstrate that they are tighter than previously known bounds. Moreover, we show that a variety of classical QECCs, including quantum Hamming codes, quantum GRM codes, and quantum Solomon-Stiffler codes, give rise to pure qLRCs with explicit parameters. Based on these constructions, we further identify many infinite families of optimal qLRCs with respect to different bounds, achieving code lengths much larger than those of known optimal qLRCs.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Li, Y., Li, S., Luo, G., & Ling, S. (2026). Improved bounds and optimal constructions of pure quantum locally recoverable codes. IEEE Transactions on Information Theory, 1. https://doi.org/10.1109/tit.2026.3734348
MLA 9
Li, Yang, et al. “Improved bounds and optimal constructions of pure quantum locally recoverable codes.” IEEE Transactions on Information Theory, 2026, p. 1. https://doi.org/10.1109/tit.2026.3734348.
Chicago
Li, Yang, Shitao Li, Gaojun Luo, and San Ling. 2026. “Improved bounds and optimal constructions of pure quantum locally recoverable codes.” IEEE Transactions on Information Theory: 1. https://doi.org/10.1109/tit.2026.3734348.
Harvard
Li, Y. et al. (2026) ‘Improved bounds and optimal constructions of pure quantum locally recoverable codes’, IEEE Transactions on Information Theory, p. 1. doi:10.1109/tit.2026.3734348.
IEEE
Y. Li, S. Li, G. Luo, and S. Ling, “Improved bounds and optimal constructions of pure quantum locally recoverable codes,” IEEE Transactions on Information Theory, p. 1, 2026, doi: 10.1109/tit.2026.3734348.
BibTeX
@article{li2026improved,
title = {{Improved bounds and optimal constructions of pure quantum locally recoverable codes}},
author = {Li, Yang and Li, Shitao and Luo, Gaojun and Ling, San},
journal = {IEEE Transactions on Information Theory},
year = {2026},
pages = {1},
doi = {10.1109/tit.2026.3734348},
url = {https://doi.org/10.1109/tit.2026.3734348}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- quantum error-correcting codes
- locality
- quantum LDPC codes
- code bounds
- optimal code construction
- quantum data storage
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Li, Y., Li, S., Luo, G., & Ling, S. (2026). Improved bounds and optimal constructions of pure quantum locally recoverable codes. IEEE Transactions on Information Theory, 1. https://doi.org/10.1109/tit.2026.3734348
How many times has this paper been cited?
19 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Yang Li, Shitao Li, Gaojun Luo, San Ling.
What is the DOI of this paper?
10.1109/tit.2026.3734348, permanently at https://doi.org/10.1109/tit.2026.3734348. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.