On optimal quantum LRCs from the Hermitian construction and $t$-designs
By: Yang Li , Shitao Li , Huimin Lao and more
Potential Business Impact:
Makes quantum computers store more information reliably.
In a recent work, quantum locally recoverable codes (qLRCs) have been introduced for their potential application in large-scale quantum data storage and implication for quantum LDPC codes. This work focuses on the bounds and constructions of qLRCs derived from the Hermitian construction, which solves an open problem proposed by Luo $et~al.$ (IEEE Trans. Inf. Theory, 71 (3): 1794-1802, 2025). We present four bounds for qLRCs and give comparisons in terms of their asymptotic formulas. We construct several new infinite families of NMDS codes, with general and flexible dimensions, that support t-designs for $t\in \{2,3\}$, and apply them to obtain Hermitian dual-containing classical LRCs (cLRCs). As a result, we derive three explicit families of optimal qLRCs. Compared to the known qLRCs obtained by the CSS construction, our optimal qLRCs offer new and more flexible parameters. It is also worth noting that the constructed cLRCs themselves are interesting as they are optimal with respect to four distinct bounds for cLRCs.
Similar Papers
Improved bounds and optimal constructions of pure quantum locally recoverable codes
Information Theory
Makes quantum computers store data more reliably.
New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
Information Theory
Fixes lost data in computer storage faster.
New Constructions of Optimal $(r,Ξ΄)$-LRCs via Algebraic Function Fields
Information Theory
Stores more data reliably in computers.