Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.22503

Optimal Pure Quantum $(r,δ)$-LRCs from Euclidean and Hermitian Dual-Containing Cyclic Codes

Astha Agrawal, Shayan Srinivasa Garani

Published Sep 18, 2026• 0 citations
arXivHTMLPDF

Abstract

Locally recoverable codes (LRCs) combine global error correction with the ability to repair a small number of erased coordinates by accessing only a limited number of other coordinates. Motivated by their quantum counterparts, we construct several families of optimal cyclic $(r,δ)$-LRCs that are Euclidean or Hermitian dual-containing. In the Euclidean case, we obtain four families of optimal dual-containing cyclic $(r,δ)$-LRCs over $\mathbb{F}_q$ with a range of minimum distances extending beyond the local distance $δ$. In the Hermitian case, we derive analogous families over $\mathbb{F}_{q^2}$ that are Hermitian dual-containing, when $(r+δ-1)\mid(q^2-1)$. In addition, we develop a distinct construction for the case $(r+δ-1)\mid(q^2+1)$ using symmetric defining sets and odd $δ$, which yields optimal codes with minimum distances $\ell+2$, $δ+2$, $2δ-2$, and $2δ$. The Euclidean Calderbank-Shor-Steane (CSS) and Hermitian stabilizer constructions then give corresponding quantum cyclic $(r,δ)$-LRCs over~$\mathbb{F}_q$. Further, the resulting stabilizer codes are pure; they meet the relevant quantum Singleton-type bound, and are therefore \textit{optimal}. We also provide a comparison with previous works, highlighting the parameter regimes and minimum distance ranges covered by our results that are not attained by existing constructions. Explicit examples illustrate the constructions and verify the dual-containment and purity conditions.

DOI
10.48550/arxiv.2609.22503

Related papers

Optimal pure quantum $(r,δ)$-locally recoverable codes from matrix-product construction

Galindo, Carlos, Fernando Hernando, Carlos Munuera +1 more

Locally recoverable codes (LRCs) are classical error-correcting codes widely used in large-scale distributed and cloud storage systems. Quantum locally recoverable codes of locality $(r,δ)$ (quantum $(r,δ)$-LRCs) are the quantum counterpart of classical $(r,δ)$-LRCs. They allow us to correct erasures at several positions using a trace-preserving quantum operation acting on qudits of a larger set of positions. Quantum $(r,δ)$-LRCs, $\mathcal{Q}(\mathcal{C})$, can be constructed from classical Euclidean (or Hermitian) dual-containing codes $\mathcal{C}$, and their recovery abilities are upper bounded by the minimum distance of the Euclidean (or Hermitian) dual of those codes. Parameters and localities of pure quantum $(r,δ)$-LRCs satisfy a Singleton-like bound; codes attaining equality are referred to as optimal. We consider matrix-product codes (MPCs) $\mathcal{C}$ and give constituent (or defining) matrices and conditions on the constituent codes such that the codes $\mathcal{C}$ satisfy the conditions to provide quantum $(r,δ)$-LRCs. As a consequence, we are able to determine their locality and parameters. Furthermore, we determine families of optimal pure quantum $(r,δ)$-LRCs derived from them.

arXiv:2310.15703•Oct 24, 2023•1 citation

Constructions of Quantum $(r,δ)$-LRCs from cyclic codes

Rajendra Prasad Rajpurohit, Maheshanand Bhaintwal

Classical $(r,δ)$ locally recoverable codes (LRCs) play a central role in distributed data storage systems as they enable an efficient recovery from erasures by accessing a small number of surviving symbols. Motivated by their prospective use in future quantum data storage and by recent theoretical progress on quantum locally recoverable codes (qLRCs), we investigate the construction of qLRCs from classical cyclic $(r,δ)$-LRCs. Our approach identifies cyclic LRCs whose defining sets satisfy a dual-containing condition, allowing them to serve as valid CSS ingredients. We present three explicit families of $(r,δ)$-qLRCs, two of which are optimal with respect to the quantum Singleton-like bound, whenever the codes are pure, thereby providing optimal examples. Additionally, the codes presented in Constructions 2 and 3 have no bound on their lengths with respect to the field size required to obtain these codes.

arXiv:2606.09522•Jun 8, 2026•0 citations

On Optimal Quantum LRCs From the Hermitian Construction and t -Designs

Yang Li, Shitao Li, Huimin Lao +2 more

In a recent work, quantum locally recoverable codes (qLRCs) have been introduced for their potential application in large-scale quantum data storage and implication for quantum LDPC codes. This work focuses on the bounds and constructions of qLRCs derived from the Hermitian construction, which solves an open problem proposed by Luo $et~al.$ (IEEE Trans. Inf. Theory, 71 (3): 1794-1802, 2025). We present four bounds for qLRCs and give comparisons in terms of their asymptotic formulas. We construct several new infinite families of NMDS codes, with general and flexible dimensions, that support t-designs for $t\in \{2,3\}$, and apply them to obtain Hermitian dual-containing classical LRCs (cLRCs). As a result, we derive three explicit families of optimal qLRCs. Compared to the known qLRCs obtained by the CSS construction, our optimal qLRCs offer new and more flexible parameters. It is also worth noting that the constructed cLRCs themselves are interesting as they are optimal with respect to four distinct bounds for cLRCs.

arXiv:2508.13553•IEEE Transactions on Information Theory•May 26, 2026•3 citations

CSS Quantum LRCs with Intersecting Recovery Sets: Constructions and Bounds

Evagoras Stylianou, Vinayak Ramkumar, Holger Boche +1 more

In this work, we study $(r,t,x)$ quantum locally recoverable codes (qLRCs) with locality $r$, $t$ recovery sets per qudit, and intersection parameter $x$. We first show that, assuming the underlying classical codes have dual minimum distance at least two, a CSS code is an $(r,t,x)$-qLRC if and only if the underlying classical codes are $(r,t,x)$ classical LRCs (cLRCs) with common recovery sets. We then use subset-inclusion matrices to construct families of binary dual-containing $(r,t,x)$-cLRCs, which yield binary $(r,t,x)$-qLRCs via the CSS construction. For CSS $(r,t,x)$-qLRCs, we derive upper bounds on the dimension and rate, minimum-distance bounds in the pure case, and a Singleton-like dimension bound in the exact case. Finally, we show that these families attain high rates and nontrivial minimum distances.

cs.ITCross-listedarXiv:2608.10912•Aug 12, 2026•0 citations

Quantum $(r,δ)$-Locally Recoverable BCH and Homothetic-BCH Codes

Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto

Quantum $(r,δ)$-locally recoverable codes ($(r,δ)$-LRCs) are the quantum version of classical $(r,δ)$-LRCs designed to recover multiple failures in large-scale distributed and cloud storage systems. A quantum $(r,δ)$-LRC, $Q(C)$, can be constructed from an $(r,δ)$-LRC, $C$, which is Euclidean or Hermitian dual-containing. This article is devoted to studying how to get quantum $(r,δ)$-LRCs from BCH and homothetic-BCH codes. As a consequence, we give pure quantum $(r,δ)$-LRCs which are optimal for the Singleton-like bound.

cs.ITCross-listedarXiv:2601.22567•Feb 2, 2026•0 citations

Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions

Yang Li, San Ling, Zhenliang Lu +2 more

Quantum locally recoverable codes (qLRCs) allow a single qudit erasure to be corrected by accessing only a small number of other qudits. Standard CSS and Hermitian constructions, however, impose dual-containing or self-orthogonal constraints on the underlying classical codes, thereby restricting the well-structured classical LRCs (cLRCs) that can be used to construct qLRCs. To relax these constraints, we introduce entanglement-assisted quantum locally recoverable codes (EAQLRCs) by assuming that halves of the pre-shared maximally entangled pairs are noiseless. We characterize sufficient support conditions on extended stabilizers under which entanglement-assisted stabilizer codes have locality $r$ and derive a CSS-like construction from two classical codes without imposing the ordinary dual-containing condition. We further establish an upper bound on locality and a Singleton-like bound for arbitrary CSS-like EAQLRCs, and characterize the pure codes attaining equality in the latter bound. These results yield a general framework for constructing optimal pure EAQLRCs from pairs of cLRCs. Applying this framework to $\ell$-intersection pairs of MDS codes and block parity-check matrices, we obtain two families of optimal pure CSS-like EAQLRCs with flexible parameters and nontrivial localities. To the best of our knowledge, these represent the first explicit families of EAQLRCs.

arXiv:2607.27091•Jul 29, 2026•0 citations
Optimal Pure Quantum (r,δ)(r,δ)(r,δ)-LRCs from Euclidean and Hermitian Dual-Containing Cyclic Codes
Locally recoverable codes (LRCs) combine global error correction with the ability to repair a small number of erased coordinates by accessing only a limited number of other coordinates. Motivated by their quantum counterparts, we construct several families of optimal cyclic (r,δ)(r,δ)(r,δ)-LRCs that are Euclidean or Hermitian dual-containing. In the Euclidean case, we obtain four families of optimal dual-containing cyclic (r,δ)(r,δ)(r,δ)-LRCs over Fq\mathbb{F}_qFq​ with a range of minimum distances extending beyond the local distance δδδ. In the Hermitian case, we derive analogous families over Fq2\mathbb{F}_{q^2}Fq2​ that are Hermitian dual-containing, when (r+δ−1)∣(q2−1)(r+δ-1)\mid(q^2-1)(r+δ−1)∣(q2−1). In addition, we develop a distinct construction for the case (r+δ−1)∣(q2+1)(r+δ-1)\mid(q^2+1)(r+δ−1)∣(q2+1) using symmetric defining sets and odd δδδ, which yields optimal codes with minimum distances ℓ+2\ell+2ℓ+2, δ+2δ+2δ+2, 2δ−22δ-22δ−2, and 2δ2δ2δ. The Euclidean Calderbank-Shor-Steane (CSS) and Hermitian stabilizer constructions then give corresponding quantum cyclic (r,δ)(r,δ)(r,δ)-LRCs over~Fq\mathbb{F}_qFq​. Further, the resulting stabilizer codes are pure; they meet the relevant quantum Singleton-type bound, and are therefore \textit{optimal}. We also provide a comparison with previous works, highlighting the parameter regimes and minimum distance ranges covered by our results that are not attained by existing constructions. Explicit examples illustrate the constructions and verify the dual-containment and purity conditions.
Optimal pure quantum (r,δ)(r,δ)(r,δ)-locally recoverable codes from matrix-product construction
Locally recoverable codes (LRCs) are classical error-correcting codes widely used in large-scale distributed and cloud storage systems. Quantum locally recoverable codes of locality (r,δ)(r,δ)(r,δ) (quantum (r,δ)(r,δ)(r,δ)-LRCs) are the quantum counterpart of classical (r,δ)(r,δ)(r,δ)-LRCs. They allow us to correct erasures at several positions using a trace-preserving quantum operation acting on qudits of a larger set of positions. Quantum (r,δ)(r,δ)(r,δ)-LRCs, Q(C)\mathcal{Q}(\mathcal{C})Q(C), can be constructed from classical Euclidean (or Hermitian) dual-containing codes C\mathcal{C}C, and their recovery abilities are upper bounded by the minimum distance of the Euclidean (or Hermitian) dual of those codes. Parameters and localities of pure quantum (r,δ)(r,δ)(r,δ)-LRCs satisfy a Singleton-like bound; codes attaining equality are referred to as optimal. We consider matrix-product codes (MPCs) C\mathcal{C}C and give constituent (or defining) matrices and conditions on the constituent codes such that the codes C\mathcal{C}C satisfy the conditions to provide quantum (r,δ)(r,δ)(r,δ)-LRCs. As a consequence, we are able to determine their locality and parameters. Furthermore, we determine families of optimal pure quantum (r,δ)(r,δ)(r,δ)-LRCs derived from them.
Constructions of Quantum (r,δ)(r,δ)(r,δ)-LRCs from cyclic codes
Classical (r,δ)(r,δ)(r,δ) locally recoverable codes (LRCs) play a central role in distributed data storage systems as they enable an efficient recovery from erasures by accessing a small number of surviving symbols. Motivated by their prospective use in future quantum data storage and by recent theoretical progress on quantum locally recoverable codes (qLRCs), we investigate the construction of qLRCs from classical cyclic (r,δ)(r,δ)(r,δ)-LRCs. Our approach identifies cyclic LRCs whose defining sets satisfy a dual-containing condition, allowing them to serve as valid CSS ingredients. We present three explicit families of (r,δ)(r,δ)(r,δ)-qLRCs, two of which are optimal with respect to the quantum Singleton-like bound, whenever the codes are pure, thereby providing optimal examples. Additionally, the codes presented in Constructions 2 and 3 have no bound on their lengths with respect to the field size required to obtain these codes.
In a recent work, quantum locally recoverable codes (qLRCs) have been introduced for their potential application in large-scale quantum data storage and implication for quantum LDPC codes. This work focuses on the bounds and constructions of qLRCs derived from the Hermitian construction, which solves an open problem proposed by Luo et al.et~al.et al. (IEEE Trans. Inf. Theory, 71 (3): 1794-1802, 2025). We present four bounds for qLRCs and give comparisons in terms of their asymptotic formulas. We construct several new infinite families of NMDS codes, with general and flexible dimensions, that support t-designs for t∈{2,3}t\in \{2,3\}t∈{2,3}, and apply them to obtain Hermitian dual-containing classical LRCs (cLRCs). As a result, we derive three explicit families of optimal qLRCs. Compared to the known qLRCs obtained by the CSS construction, our optimal qLRCs offer new and more flexible parameters. It is also worth noting that the constructed cLRCs themselves are interesting as they are optimal with respect to four distinct bounds for cLRCs.
In this work, we study (r,t,x)(r,t,x)(r,t,x) quantum locally recoverable codes (qLRCs) with locality rrr, ttt recovery sets per qudit, and intersection parameter xxx. We first show that, assuming the underlying classical codes have dual minimum distance at least two, a CSS code is an (r,t,x)(r,t,x)(r,t,x)-qLRC if and only if the underlying classical codes are (r,t,x)(r,t,x)(r,t,x) classical LRCs (cLRCs) with common recovery sets. We then use subset-inclusion matrices to construct families of binary dual-containing (r,t,x)(r,t,x)(r,t,x)-cLRCs, which yield binary (r,t,x)(r,t,x)(r,t,x)-qLRCs via the CSS construction. For CSS (r,t,x)(r,t,x)(r,t,x)-qLRCs, we derive upper bounds on the dimension and rate, minimum-distance bounds in the pure case, and a Singleton-like dimension bound in the exact case. Finally, we show that these families attain high rates and nontrivial minimum distances.
Quantum (r,δ)(r,δ)(r,δ)-Locally Recoverable BCH and Homothetic-BCH Codes
Quantum (r,δ)(r,δ)(r,δ)-locally recoverable codes ((r,δ)(r,δ)(r,δ)-LRCs) are the quantum version of classical (r,δ)(r,δ)(r,δ)-LRCs designed to recover multiple failures in large-scale distributed and cloud storage systems. A quantum (r,δ)(r,δ)(r,δ)-LRC, Q(C)Q(C)Q(C), can be constructed from an (r,δ)(r,δ)(r,δ)-LRC, CCC, which is Euclidean or Hermitian dual-containing. This article is devoted to studying how to get quantum (r,δ)(r,δ)(r,δ)-LRCs from BCH and homothetic-BCH codes. As a consequence, we give pure quantum (r,δ)(r,δ)(r,δ)-LRCs which are optimal for the Singleton-like bound.
Quantum locally recoverable codes (qLRCs) allow a single qudit erasure to be corrected by accessing only a small number of other qudits. Standard CSS and Hermitian constructions, however, impose dual-containing or self-orthogonal constraints on the underlying classical codes, thereby restricting the well-structured classical LRCs (cLRCs) that can be used to construct qLRCs. To relax these constraints, we introduce entanglement-assisted quantum locally recoverable codes (EAQLRCs) by assuming that halves of the pre-shared maximally entangled pairs are noiseless. We characterize sufficient support conditions on extended stabilizers under which entanglement-assisted stabilizer codes have locality rrr and derive a CSS-like construction from two classical codes without imposing the ordinary dual-containing condition. We further establish an upper bound on locality and a Singleton-like bound for arbitrary CSS-like EAQLRCs, and characterize the pure codes attaining equality in the latter bound. These results yield a general framework for constructing optimal pure EAQLRCs from pairs of cLRCs. Applying this framework to ℓ\ellℓ-intersection pairs of MDS codes and block parity-check matrices, we obtain two families of optimal pure CSS-like EAQLRCs with flexible parameters and nontrivial localities. To the best of our knowledge, these represent the first explicit families of EAQLRCs.