Quantum $(r,\delta )$-locally recoverable codes

Abstract

Classical $(r,\delta )$-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,\delta )$-locally recoverable codes which are quantum error-correcting codes capable of correcting $\delta -1$ qudit erasures from sets of at most $r+\delta -1$ qudits. We give a necessary and sufficient condition for a quantum stabilizer code $Q(C)$ to be $(r,\delta )$-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^{{\perp }_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,\delta )$-local recoverability. A Singleton-like bound is stated in this case and examples attaining the bound are given.

arXiv commentVersion 3 is publisher's open access PDF whose copyright is held by the authors. No essential changes between versions 2 and 3

References in corpus (13)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Good Quantum Error-Correcting Codes Exist
• Quantum computational advantage using photons
• A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
• Quantum Error Correction and Orthogonal Geometry
• Entanglement-assisted quantum error-correcting codes over arbitrary finite fields
• On the Construction of Nonbinary Quantum BCH Codes
• Constructions of Locally Recoverable Codes which are Optimal
• On the distance of stabilizer quantum codes from $J$-affine variety codes
• Unitary Reconstruction of Secret for Stabilizer Based Quantum Secret Sharing
• On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes
• Classical Access Structures of Ramp Secret Sharing Based on Quantum Stabilizer Codes
• Optimal $(r,\delta )$-LRCs from monomial-Cartesian codes and their subfield-subcodes

Cited by in corpus (1)

• Impure codes exceeding the pure bounds for quantum local recovery