Reproduce “Quantum Quasi-Cyclic LDPC Codes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Manabu Hagiwara, Hideki Imai
Manabu Hagiwara and Hideki Imai present a deterministic method for constructing regular quantum quasi-cyclic low-density parity-check (QLDPC) codes designed as ingredient codes for Calderbank-Shor-Steane (CSS) quantum codes. This approach ensures high error correction performance and offers flexibility in code parameters for protecting quantum information.
Key insights
- The 'twisted condition' for CSS codes and the 'girth condition' (girth $\ge 6$) for QC-LDPC codes can be elegantly characterized by simple algebraic combinatorial properties ('multiplicity even' and 'multiplicity free') of their model matrices.
- A specific structural form for the model matrices (four-cycle codes) can deterministically guarantee the satisfaction of the quantum twisted condition.
- It is possible to achieve the same tight lower bound on circulant matrix size ($P \ge L+1$) for quantum QC-LDPC codes as for classical codes with girth $\ge 6$, implying no penalty for quantum constraints.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.