arXiv:2610.23889
Asymmetric Entanglement-Assisted Quantum Locally Recoverable Codes
Vijay Kumar, Ramakrishna Bandi
Abstract
Locally recoverable codes (LRCs) permit reconstruction of a lost coordinate from a small subset of the remaining coordinates, a property that is a fundamental coding technique for distributed storage and, more recently, for fault-tolerant quantum memories and distributed storage systems. Existing constructions of quantum locally recoverable codes (qLRCs) and their entanglement-assisted generalizations (EA-qLRCs) impose a single locality parameter $r$ governing recovery from both bit-flip ($X$-type) and phase-flip ($Z$-type) errors, even though physical noise is rarely symmetric between the two. We introduce entanglement-assisted quantum locally recoverable codes (EA-qLRC) with \emph{asymmetric locality} $\{r_X,r_Z\}$, in which $X$-type and $Z$-type errors are corrected from recovery sets of size at most $r_X+1$ and $r_Z+1$, respectively. We extend a stabilizer sufficient condition for this property and, in particular, the CSS framework, where asymmetric locality corresponds to separate locality conditions on the two classical codes $\mathcal C_1$ and $\mathcal C_2$ underlying the construction. From this characterization we derive Singleton-, Griesmer-, Plotkin-, sphere-packing-, and Cadambe\textendash Mazumdar-like bounds for CSS-type asymmetric EA-qLRCs (AEA-qLRCs) built from Proposition~\ref{CSS-EA-qLRC-Asym}, and we characterize exactly when a pure CSS-type AEA-qLRC built from a pair of classical LRCs attains the Singleton-like bound with equality.
AI Summary
The paper asks whether entanglement assistance can be combined with separate local-recovery requirements for bit-flip and phase-flip errors. It introduces asymmetric entanglement-assisted quantum locally recoverable codes with localities $\{r_X,r_Z\}$, intended to correct known-location, single-qudit $X$- and $Z$-type errors using at most $r_X$ and $r_Z$ other channel qudits, respectively, together with the decoder’s shared entanglement. A stabilizer sufficient condition uses checks with independently bounded encoder-side supports. Its CSS specialization takes classical LRCs $\mathcal C_1,\mathcal C_2$ with localities $r_Z,r_X$, yielding logical dimension $\kappa=k_1+k_2-n+c$ and entanglement consumption $c=\operatorname{rank}(H_1H_2^T)$. By extracting shortened classical LRCs and applying classical coding bounds, the paper derives Singleton-, Griesmer-, Plotkin-, sphere-packing-, and Cadambe–Mazumdar-like bounds. The Singleton-like inequality is $d_X+d_Z\le n-\kappa+c-\lceil\kappa/r_X\rceil-\lceil\kappa/r_Z\rceil+4$. For pure CSS-type codes, it states an equality characterization requiring optimal constituent LRCs, equal distances $d_X=d_Z$, and matching locality ceilings between their dimensions and $\kappa$. Constructions use Tamo–Barg evaluation codes and cyclic LRCs, with dual intersections determining dimension and entanglement requirements. One Tamo–Barg parameter regime always encodes only one logical qudit; complementary-pair constructions give maximally entangled codes with $c=n-\kappa$. The bounds and optimality analysis are restricted to the specified CSS construction, and the locality criteria are sufficient rather than necessary. General non-CSS bounds, necessary conditions, multiple disjoint recovery sets, and families attaining the other bounds remain open.
Central claim may not hold: The stabilizer and CSS sufficient conditions establish restricted-Pauli correction but do not imply the full erasure-recovery channels required by the paper's definition of asymmetric locality. The claimed necessity of equal X and Z distances for Singleton optimality is false, as a pure F_5 CSS example attains the stated distance-sum bound with d_X=2 and d_Z=3. The general trade-off theorem and several corollaries swap the auxiliary lengths associated with the X and Z locality and distance parameters relative to their proof. The cyclic example reverses its ordered X and Z distances, reporting a Z distance of 3 despite a guaranteed Z distance of at least 4.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.