This is the first result to break the so-called "one-half barrier" for LLR, and improves over the previous best known result, requiring $R \geq 0.668$.
We show that for any $R,\epsilon>0$ and any prime $p\geq 2$, there exists an infinite family of $p$-ary quantum low-density parity-check (QLDPC) codes, rate $R$, checks of weight $O_\epsilon(1)$, and normalized distance at least $\delta_{\mathrm{GV}}(p,R)-\epsilon$. Here, $\delta_{\mathrm{GV}}(p,R)$ denotes the quantum...
A family of codes with rate R that are deterministically list-decodable up to radius $\rho = 1 - R - \tau$ in time $N^{1 + \tau}$ and space $N^{\tau}$ with constant output list size and constant alphabet size is presented.
Dorsa Fathollahi, Noga Ron-Zewi, Mary K. Wootters· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.