Quantum locally recoverable code with intersecting recovery sets

2025/01/17 by Kaifeng Bu, Bu, Kaifeng, Weichen Gu +3 · 2 citations
Computer Science · #Advanced Data Storage Technologies #Cloud Computing and Resource Management #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2501.10354

openalex publication_date 2025/01/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We introduce the concept of quantum locally recoverable codes (qLRCs) with intersecting recovery sets. We derive a singleton-like bound for these codes by leveraging the additional information provided by the intersecting recovery sets. Furthermore, we provide a construction for qLRCs with intersecting recovery sets by introducing a variation of the hypergraph product. Finally, we apply our qLRC methods to obtain improved results for classical LRCs. These results may provide new insights into the locality of quantum error correction code.

Cited by

• Reducing measurements in quantum erasure correction by quantum local recovery
• On optimal quantum LRCs from the Hermitian construction and t-designs

Related

• Quantum Locally Recoverable Codes
• Improved bounds and optimal constructions of pure quantum locally recoverable codes
• Optimal quantum locally recoverable codes from matrix-product construction
• Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions
• Quantum (r,δ)-locally recoverable codes