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

• URL: http://arxiv.org/abs/2608.17118v1
• Date: Mon, 17 Aug 2026 20:54:41 GMT
• Title: Entanglement assisted quantum $(r,δ)$-locally recoverable codes
• Abstract summary: We introduce the more general framework of entanglement-assisted quantum $(r,)$-locally recoverable codes.<n>For codes derived from Hermitian or Euclidean constructions, we establish connections between entanglement-assisted quantum and classical notions of $(r,)$-local recoverability.<n>We construct optimal pure entan-gle-ment-assisted quantum $(r,)$-locally recoverable codes from several families of classical codes.
• Score: 37.306043163932905
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Entanglement-assisted quantum locally recoverable codes: bounds and constructions with availability [3.3135760457470713]
  We define entanglement-assisted quantum locally recoverable codes with availability.<n>Any set of up to $-1$ erased qudits can be recovered from any one of $t$ local recovery sets.
  arXiv  Detail & Related papers  (2026-08-10T17:37:21Z)
• Information locality of a quantum locally recoverable code [0.0]
  A classical linear code $C$ of length $n$ is said to have symbol locality $(r, )$ if for any index $j$ there exists a repair group $J_j subseteq 1, ldots, n$ with $jin J_j$ and $|J_j| leq r+-1$.<n>We demonstrate that the previously proposed definition of quantum locality $(r,)$ has the same drawback of overestimating the number of necessary codeword symbols for erasure correction.
  arXiv  Detail & Related papers  (2026-08-05T03:15:44Z)
• Quantum $(r,δ)$-Locally Recoverable BCH and Homothetic-BCH Codes [39.53007356735723]
  A quantum $(r,)$-LRC, $Q(C)$, can be constructed from an $(r,)$-LRC, $C$, which is Euclidean or Hermitian dual-containing.<n>This article is devoted to studying how to get quantum $(r,)$-LRCs from BCH and homothetic-BCH codes.
  arXiv  Detail & Related papers  (2026-01-30T05:08:59Z)
• Quantum error correction beyond $SU(2)$: spin, bosonic, and permutation-invariant codes from convex geometry [48.254879700836376]
  We develop a framework for constructing quantum error-correcting codes and logical gates for three types of spaces.<n>We prove that many codes and their gates in $SU(q)$ can be inter-converted between the three state spaces.<n>We present explicit constructions of codes with shorter length or lower total spin/excitation than known codes with similar parameters.
  arXiv  Detail & Related papers  (2025-09-24T20:21:30Z)
• Optimal Quantum $(r,δ)$-Locally Repairable Codes From Matrix-Product Codes [52.3857155901121]
  We study optimal quantum $(r,delta)$-LRCs from matrix-product (MP) codes.<n>We present five infinite families of optimal quantum $(r,delta)$-LRCs with flexible parameters.
  arXiv  Detail & Related papers  (2025-08-05T16:05:14Z)
• Quantum $(r,δ)$-locally recoverable codes [37.306043163932905]
  We introduce the quantum counterpart of those codes by defining quantum $(r,delta)$-locally recoverable codes.<n>We show that there is an equivalence between the classical and quantum concepts of $(r,delta)$-local recoverability.
  arXiv  Detail & Related papers  (2024-12-21T11:45:32Z)
• Characterization of $n$-Dimensional Toric and Burst-Error-Correcting Quantum Codes from Lattice Codes [2.2657086779504017]
  We introduce a generalization of a quantum interleaving method for combating clusters of errors in toric quantum error-correcting codes. We present new $n$-dimensional toric quantum codes, where $ngeq 5$ are featured by lattice codes. We derive new $n$-dimensional quantum burst-error-correcting codes.
  arXiv  Detail & Related papers  (2024-10-26T17:29:20Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• A family of permutationally invariant quantum codes [54.835469342984354]
  We show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes. For small $t$, these conditions can be used to construct new examples of codes by computer.
  arXiv  Detail & Related papers  (2023-10-09T02:37:23Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.