跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.25859 · v1

Optimal Impure $(r,δ)$-Quantum Locally Recoverable Codes with Explicit Minimum Localities

首次提交 2026-11-19 18:10
版本更新 2026-11-19 18:10
雷达观测 2026-11-20 19:57
arXiv ↗PDF ↗

摘要

Quantum locally recoverable codes with (r,δ)(r,δ)-locality ((r,δ)(r,δ)-qLRCs) are quantum error-correcting codes in which δ−1δ-1 erased qudits can be recovered by accessing only rr other qudits. The minimum locality of a qLRC is the least rr such that it has (r,δ)(r,δ)-locality. This paper aims to construct optimal impure (r,δ)(r,δ)-qLRCs with disjoint recovering sets and explicit minimum localities, where the optimality is measured by the Singleton-like bound of Guruswami, Kshirsagar, and Trivedi (GKT-optimal). Such qLRCs have particular advantages in recovering as many quantum erasures as possible while operating in parallel and with minimal qudit access overhead. We first characterize the recovering sets and the minimum locality of any CSS code by local relative distances, which are relative minimum distances of punctured codes with respect to shortened codes. We then construct impure qLRCs as CSS codes from nested pairs of generalized monomial-Cartesian codes. Grouping the monomials by their degree in the last variable, we reduce both their minimum distances and their local recovery to nested pairs of codes in the remaining variables, and the coordinates with the same values of these variables form disjoint recovering sets. In this way, we obtain four infinite families of GKT-optimal impure (r,δ)(r,δ)-qLRCs with disjoint recovering sets, and determine their minimum localities and the recovering sets attaining them for every admissible δδ, except for a partial range of δδ in one family. These minimum localities need not be monotone in δδ. In particular, two of the families contain GKT-optimal impure subfamilies of CSS codes CSS(C,C)(\mathcal{C},\mathcal{C}) with (r,δ)(r,δ)-locality for some r<n−δ+1r<n-δ+1 at values of δδ for which C\mathcal{C} has no classical (r′,δ)(r',δ)-locality for any 0<r′<n0<r'<n, where nn is the length of C\mathcal{C}.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 18:10 · 最新观测版本

Optimal Impure $(r,δ)$-Quantum Locally Recoverable Codes with Explicit Minimum Localities

Quantum locally recoverable codes with (r,δ)(r,δ)-locality ((r,δ)(r,δ)-qLRCs) are quantum error-correcting codes in which δ−1δ-1 erased qudits can be recovered by accessing only rr other qudits. The minimum locality of a qLRC is the least rr such that it has (r,δ)(r,δ)-locality. This paper aims to construct optimal impure (r,δ)(r,δ)-qLRCs with disjoint recovering sets and explicit minimum localities, where the optimality is measured by the Singleton-like bound of Guruswami, Kshirsagar, and Trivedi (GKT-optimal). Such qLRCs have particular advantages in recovering as many quantum erasures as possible while operating in parallel and with minimal qudit access overhead. We first characterize the recovering sets and the minimum locality of any CSS code by local relative distances, which are relative minimum distances of punctured codes with respect to shortened codes. We then construct impure qLRCs as CSS codes from nested pairs of generalized monomial-Cartesian codes. Grouping the monomials by their degree in the last variable, we reduce both their minimum distances and their local recovery to nested pairs of codes in the remaining variables, and the coordinates with the same values of these variables form disjoint recovering sets. In this way, we obtain four infinite families of GKT-optimal impure (r,δ)(r,δ)-qLRCs with disjoint recovering sets, and determine their minimum localities and the recovering sets attaining them for every admissible δδ, except for a partial range of δδ in one family. These minimum localities need not be monotone in δδ. In particular, two of the families contain GKT-optimal impure subfamilies of CSS codes CSS(C,C)(\mathcal{C},\mathcal{C}) with (r,δ)(r,δ)-locality for some r<n−δ+1r<n-δ+1 at values of δδ for which C\mathcal{C} has no classical (r′,δ)(r',δ)-locality for any 0<r′<n0<r'<n, where nn is the length of C\mathcal{C}.

查看此版本解读 →查看此版本原文 ↗