English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We give a construction of quantum LDPC codes of dimension <inline-formula> <tex-math notation="LaTeX">$\Theta (\log N)$ </tex-math></inline-formula> and distance <inline-formula> <tex-math notation="LaTeX">$\Theta (N/\log N)$ </tex-math></inline-formula> as the code length <inline-formula> <tex-math notation="LaTeX">$N\to \infty $ </tex-math></inline-formula>. Using a product of chain complexes this construction also provides a family of quantum LDPC codes of distance <inline-formula> <tex-math notation="LaTeX">$\Omega (N^{1-\alpha /2}/\log N)$ </tex-math></inline-formula> and dimension <inline-formula> <tex-math notation="LaTeX">$\Omega (N^\alpha \log N)$ </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">$0 \le \alpha &lt; 1$ </tex-math></inline-formula>. We also introduce and study a new operation called lifted product, which naturally generalizes the product operations for quantum codes and chain complexes. Moreover, as a simple byproduct of our results on quantum codes, we obtain a new result on classical codes. We show that for any fixed <inline-formula> <tex-math notation="LaTeX">$R &lt; 1$ </tex-math></inline-formula> there exists an asymptotically good family of classical quasi-cyclic LDPC codes of rate at least <inline-formula> <tex-math notation="LaTeX">$R$ </tex-math></inline-formula> with, in some sense, optimal circulant size <inline-formula> <tex-math notation="LaTeX">$\Omega (N/\log N)$ </tex-math></inline-formula> as the code length <inline-formula> <tex-math notation="LaTeX">$N\to \infty $ </tex-math></inline-formula>.

Quantum LDPC Codes With Almost Linear Minimum Distance