Information locality of a quantum locally recoverable code

• URL: http://arxiv.org/abs/2608.04403v1
• Date: Wed, 05 Aug 2026 03:15:44 GMT
• Title: Information locality of a quantum locally recoverable code
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 $j\in J_j$ and $|J_j| \leq r+δ-1$ such that any $δ-1$ or fewer erasures in $J_j$ can be corrected by using codeword symbols only in $J_j$. Later it turned out that this way of defining $r$ overestimates the number of necessary codeword symbols for multiple-erasure correction, and information locality was proposed to define $r$ as the dimension of the punctured code of $C$ onto $J_j$. Recently locality $(r,δ)$ was proposed for quantum error-correcting codes by following the original definition of symbol locality $(r, δ)$. We propose a quantum counterpart of the information locality for quantum stabilizer codes constructed by Hermitian orthogonality, and a linear algebraic procedure computing a smaller repair group predicted by the proposed information locality and simultaneously reducing the number of measured observables in decoding to its minimum possible value. Then 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 by providing an explicit example of a quantum stabilizer code. Finally, we will give another example of a quantum stabilizer code constructed by Euclidean orthogonality and two different linear codes, with which a natural translation of the classical information locality into the quantum setting underestimates the number of necessary codeword symbols for erasure correction.

Related papers

• Entanglement assisted quantum $(r,δ)$-locally recoverable codes [37.306043163932905]
  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.
  arXiv  Detail & Related papers  (2026-08-17T20:54:41Z)
• Quantum error correction at ultra-low overhead [0.0]
  Suppressing errors is the central challenge for useful large-scale quantum computing.<n>We introduce Cornucopia codes, a family of practical, hardware-efficient quantum low-density parity-check codes.<n>Results bring demonstrations of ultra-low overhead quantum error correction within the reach of near-term quantum processors.
  arXiv  Detail & Related papers  (2026-08-03T18:13:57Z)
• A polynomial-time approximation scheme for minimum-weight decoding of topological codes [42.44256445495892]
  Two-dimensional topological translationally in (2D TTI) stabilizer codes lie at the heart of fault-tolerant quantum computation.<n>Minimum-weight decoding of these codes was recently shown to be NP-hard, even in basic settings.
  arXiv  Detail & Related papers  (2026-06-16T16:44:08Z)
• Qudit stabiliser codes for $\mathbb{Z}_N$ lattice gauge theories with matter [42.418429168532406]
  We show that a $mathbbZ_N$ gauge theory with prime dimension $N$ coupled to dynamical matter can be expressed as a qudit stabilizer code.<n>Using the stabilizer formalism we show how to formulate an exact mapping of the encoded $mathbbZ_N$ gauge theory onto two different bosonic models.
  arXiv  Detail & Related papers  (2026-02-24T08:07:05Z)
• Uniqueness of purifications is equivalent to Haag duality [44.33169165028139]
  We show that, if the two systems are modelled by commuting von algebra Neumanns $M_A$ and $M_B$ on a Hilbert space $mathcal H$, uniqueness of purifications is equivalent to Haag duality $M_A = M_B'$.
  arXiv  Detail & Related papers  (2025-09-16T10:05:17Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Efficient and Universal Neural-Network Decoder for Stabilizer-Based Quantum Error Correction [44.698141103370546]
  GraphQEC is a code-agnostic decoder leveraging machine-learning on the graph structure of stabilizer codes with linear time complexity.<n>Our approach represents the first universal solution for real-time quantum error correction across arbitrary stabilizer codes.
  arXiv  Detail & Related papers  (2025-02-27T10:56:53Z)
• 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)
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [38.729065908701585]
  We introduce a new class of qubit codes that we call Evenbly codes.<n>Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-16T17:18:13Z)
• 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)
• Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit [5.607676459156789]
  We consider quantum polar codes of Calderbank-Shor-Steane type, encoding one logical qubit. We show that a subfamily of $mathcalQ_1$ codes is equivalent to the well-known family of Shor codes. We use Steane's error correction technique, which incorporates the proposed fault-tolerant code state preparation procedure.
  arXiv  Detail & Related papers  (2022-09-14T14:30:09Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Describing quantum metrology with erasure errors using weight distributions of classical codes [9.391375268580806]
  We consider using quantum probe states with a structure that corresponds to classical $[n,k,d]$ binary block codes of minimum distance. We obtain bounds on the ultimate precision that these probe states can give for estimating the unknown magnitude of a classical field.
  arXiv  Detail & Related papers  (2020-07-06T16:22:40Z)

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.