Abstract

Classical (r,δ)(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,δ)(r,δ)-locally recoverable codes which are quantum error-correcting codes capable of correcting δ−1δ-1 qudit erasures from sets of at most r+δ−1r+ δ-1 qudits. We give a necessary and sufficient condition for a quantum stabilizer code Q(C)Q(C) to be (r,δ)(r,δ)-locally recoverable. Our condition depends only on the puncturing and shortening at suitable sets of both the symplectic self-orthogonal code CC used for constructing Q(C)Q(C) and its symplectic dual C⊥sC^{\perp_s}. When Q(C)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,δ)(r,δ)-local recoverability. A Singleton-like bound is stated in this case and examples attaining the bound are given.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.