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,
Q(C), can be constructed from classical Euclidean (or Hermitian) dual-containing codes
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)
Cand give constituent (or defining) matrices and conditions on the constituent codes such that the codes
Csatisfy 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.
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
Fq with a range of minimum distances extending beyond the local distance
δ. In the Hermitian case, we derive analogous families over
Fq2 that are Hermitian dual-containing, when
(r+δ−1)∣(q2−1). In addition, we develop a distinct construction for the case
(r+δ−1)∣(q2+1) using symmetric defining sets and odd
δ, which yields optimal codes with minimum distances
ℓ+2,
δ+2,
2δ−2, and
2δ. The Euclidean Calderbank-Shor-Steane (CSS) and Hermitian stabilizer constructions then give corresponding quantum cyclic
(r,δ)-LRCs over~
Fq. 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.
In this paper, we employ MP codes whose defining matrices are
τ-optimal defining (
τ-OD) matrices to construct new quantum codes and quantum
(r,δ)-LRCs. Specifically, we report the following results: We establish a unified
τ-monomial decomposition theorem for invertible self-adjoint matrices over finite fields of arbitrary characteristic, which generalizes the result in "Quantum codes using the
τ-OD MP construction" where the characteristic was required to be odd. Based on this theorem, we prove the existence of
τ-OD matrices over
Fq2 for any characteristic and demonstrate that there exist several new infinite families of
τ-OD matrices over
Fq2 of characteristic
2. As an application of MP codes involving
τ-OD matrices, we construct several infinite families of quantum codes with flexible parameters. Within this framework, we present
222 record-breaking quantum codes that surpass the best-known records maintained in Grassl's database.
We propose two effective schemes for constructing optimal pure quantum
(r,δ)-LRCs via MP codes. Accordingly, we construct four new infinite families of optimal pure quantum
(r,δ)-LRCs with flexible parameters. Notably, we report an interesting phenomenon by exhibiting
30 optimal pure quantum
(r,δ)-LRCs derived from our framework; that is, there exist quantum codes that are not only optimal pure quantum
(r,δ)-LRCs but also, according to Grassl's database, best-known, optimal, or record-breaking quantum codes. To the best of our knowledge, the new discovery that quantum codes are simultaneously optimal pure quantum
(r,δ)-LRCs and record-breaking quantum codes has not been previously reported in the literature.
Matrix-product (MP) codes provide an efficient approach for constructing long classical codes by combining a defining matrix with several shorter constituent codes. Employing non-singular by columns (NSC) quasi-unitary matrices as the defining matrices of MP codes enables the construction of various types of quantum codes. The existence of infinite families ofN×NNSC quasi-unitary matrices over Fq2forN = qorq+2 ≤ N ≤q2, whereq≠ 2 is a prime power, was posed as an open problem in the literature and remains largely unresolved. In this paper, we introduce a novel method for constructing NSC quasi-unitary matrices based on a generalized orthogonality relation for cyclic groups. We prove that (2m+ 1) × (2m+ 1) NSC quasi-unitary matrices always exist over Fq2whenever 2m| (q2–1). This result establishes, for the first time, the existence of six new infinite families of NSC quasi-unitary matrices, providing solutions to the aforementioned open problem. The number of such matrices within our framework is also determined. As a key application, we leverage NSC quasi-unitary matrices to construct optimal pure quantum (r; δ)-locally repairable codes (LRCs). We propose an effective method for constructing optimal pure quantum (r; δ)- LRCs from MP codes whose defining matrices are NSC quasiunitary matrices. Based on this method, we explicitly construct two new infinite families of optimal pure quantum (r; δ)-LRCs with flexible parameters.
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.
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∈{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.