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:2601.22567

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

Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto

cs.ITquant-phSubmitted Jan 30, 2026• Announced Feb 2, 2026• 0 citations
v1 · Jan 30, 2026v2 · Jul 26, 2026
arXivHTMLPDF

Abstract

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.

Comments
19 pages, 1 table

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

Quantum (r,δ)-locally recoverable codes

Carlos Galindo, Fernando Hernando, Helena Martín-Cruz +1 more

Classical ( r , δ ) -locally recoverable codes are designed for avoiding loss of information in large scale distributed and cloud storage systems. We introduce the quantum counterpart of those codes by defining quantum ( r , δ ) -locally recoverable codes which are quantum error-correcting codes capable of correcting δ − 1 qudit erasures from sets of at most r + δ − 1 qudits. We give a necessary and sufficient condition for a quantum stabilizer code Q ( C ) to be ( r , δ ) -locally recoverable. Our condition depends only on the puncturing and shortening at suitable sets of both the symplectic self-orthogonal code C used for constructing Q ( C ) and its symplectic dual C ⊥ s . When Q ( C ) comes from a Hermitian or Euclidean dual-containing code, and under an extra condition, we show that there is an equivalence between the classical and quantum concepts of ( r , δ ) -local recoverability. A Singleton-like bound is stated in this case and examples attaining the bound are given.

arXiv:2412.16590•Finite Fields and Their Applications•Dec 30, 2025•5 citations

Entanglement assisted quantum $(r,δ)$-locally recoverable codes

Carlos Galindo, Fernando Hernando, Helena Martín-Cruz +1 more

Quantum $(r,δ)$-locally recoverable codes are quantum error-correcting codes capable of correcting $δ-1$ qudit erasures within one subset of qudits of cardinality at most $r+δ-1$. In this paper, we introduce the more general framework of entanglement-assisted quantum $(r,δ)$-locally recoverable codes, assuming that the local recovery operation is assisted by receiver-held qudits that remain unaffected by erasures. We establish necessary and sufficient conditions for these codes to satisfy this property. For codes derived from Hermitian or Euclidean constructions, we establish connections between entanglement-assisted quantum and classical notions of $(r,δ)$-local recoverability, and derive a Singleton-like bound. Furthermore, we construct optimal pure entan\-gle\-ment-assisted quantum $(r,δ)$-locally recoverable codes from several families of classical codes, including bivariate $J$-affine variety codes, BCH codes, and homothetic-BCH codes.

quant-pharXiv:2608.17118•Aug 19, 2026•0 citations

Bounds and Constructions of Quantum Locally Recoverable Codes From Quantum CSS Codes

Gaojun Luo, Bocong Chen, Martianus Frederic Ezerman +1 more

Classical locally recoverable codes (LRCs) have become indispensable in distributed storage systems. They provide efficient recovery in terms of localized errors. Quantum LRCs have very recently been introduced for their potential application in quantum data storage. In this paper, we use classical LRCs to investigate quantum LRCs. We prove that the parameters of quantum LRCs are bounded by their classical counterparts. We deduce bounds on the parameters of quantum LRCs from bounds on the parameters of the classical ones. We establish a characterization of optimal pure quantum LRCs based on classical codes with specific properties. Using well-crafted classical LRCs as ingredients in the construction of quantum CSS codes, we offer the first construction of several families of optimal pure quantum LRCs.

arXiv:2312.11115•IEEE Transactions on Information Theory•Jan 24, 2025•21 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
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.
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.
Classical ( r , δ ) -locally recoverable codes are designed for avoiding loss of information in large scale distributed and cloud storage systems. We introduce the quantum counterpart of those codes by defining quantum ( r , δ ) -locally recoverable codes which are quantum error-correcting codes capable of correcting δ − 1 qudit erasures from sets of at most r + δ − 1 qudits. We give a necessary and sufficient condition for a quantum stabilizer code Q ( C ) to be ( r , δ ) -locally recoverable. Our condition depends only on the puncturing and shortening at suitable sets of both the symplectic self-orthogonal code C used for constructing Q ( C ) and its symplectic dual C ⊥ s . When Q ( C ) comes from a Hermitian or Euclidean dual-containing code, and under an extra condition, we show that there is an equivalence between the classical and quantum concepts of ( r , δ ) -local recoverability. A Singleton-like bound is stated in this case and examples attaining the bound are given.
Entanglement assisted quantum (r,δ)(r,δ)(r,δ)-locally recoverable codes
Quantum (r,δ)(r,δ)(r,δ)-locally recoverable codes are quantum error-correcting codes capable of correcting δ−1δ-1δ−1 qudit erasures within one subset of qudits of cardinality at most r+δ−1r+δ-1r+δ−1. In this paper, we introduce the more general framework of entanglement-assisted quantum (r,δ)(r,δ)(r,δ)-locally recoverable codes, assuming that the local recovery operation is assisted by receiver-held qudits that remain unaffected by erasures. We establish necessary and sufficient conditions for these codes to satisfy this property. For codes derived from Hermitian or Euclidean constructions, we establish connections between entanglement-assisted quantum and classical notions of (r,δ)(r,δ)(r,δ)-local recoverability, and derive a Singleton-like bound. Furthermore, we construct optimal pure entan\-gle\-ment-assisted quantum (r,δ)(r,δ)(r,δ)-locally recoverable codes from several families of classical codes, including bivariate JJJ-affine variety codes, BCH codes, and homothetic-BCH codes.
Classical locally recoverable codes (LRCs) have become indispensable in distributed storage systems. They provide efficient recovery in terms of localized errors. Quantum LRCs have very recently been introduced for their potential application in quantum data storage. In this paper, we use classical LRCs to investigate quantum LRCs. We prove that the parameters of quantum LRCs are bounded by their classical counterparts. We deduce bounds on the parameters of quantum LRCs from bounds on the parameters of the classical ones. We establish a characterization of optimal pure quantum LRCs based on classical codes with specific properties. Using well-crafted classical LRCs as ingredients in the construction of quantum CSS codes, we offer the first construction of several families of optimal pure quantum LRCs.
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.