Improved quantum hypergraph-product LDPC codes

Alexey A. Kovalev, Leonid P. Pryadko · 2012 · ISIT 2012

| 编号 QE114 | 主题 qLDPC 码 | 链接 arXiv:1202.0928 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

We suggest several techniques to improve the toric codes and the finite-rate generalized toric codes (quantum hypergraph-product codes) recently introduced by Tillich and Zémor. For the usual toric codes, we introduce the rotated lattices specified by two integer-valued periodicity vectors. These codes include the checkerboard codes, and the family of minimal single-qubit-encoding toric codes with block length $n=t^2+(t+1{)}^2$ and distance $d=2t+1$, $t=1,2,\dots$. We also suggest several related algebraic constructions which nearly quadruple the rate of the existing hypergraph-product codes.

本站词条在引用该文献时，会以 wikilink（sources/QE114）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。