Metraipolis › archive › dc_7ee95685aa5b
Information locality of a quantum locally recoverable code — arXiv:2608.04403
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.04403
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T11:46:15.848Z
- SHA-256 of the archived text
dbc10b5ee8db78a6f16e2aeef7aade11913a4bed6a823160a591c2e6cf53cf82- Stable URL of this page
https://metraipolis.com/documento/dc_7ee95685aa5b
How to cite
Information locality of a quantum locally recoverable code — arXiv:2608.04403 — arXiv (en), https://arxiv.org/abs/2608.04403 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7ee95685aa5b (Metraipolis archive dc_7ee95685aa5b, sha256 dbc10b5ee8db78a6f16e2aeef7aade11913a4bed6a823160a591c2e6cf53cf82)
BibTeX
@misc{dc7ee95685aa5b,
title = {Information locality of a quantum locally recoverable code — arXiv:2608.04403},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.04403},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7ee95685aa5b; sha256 dbc10b5ee8db78a6f16e2aeef7aade11913a4bed6a823160a591c2e6cf53cf82},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04403. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A classical linear code $C$ of length $n$ is said to have symbol locality $(r, \delta)$ 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+\delta-1$ such that any $\delta-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,\delta)$ was proposed for quantum error-correcting codes by following the original definition of symbol locality $(r, \delta)$. 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,\delta)$ 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.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2608.04403 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T11:35:59.986Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).