2000 character limit reached
Improved quantum hypergraph-product LDPC codes
Published 5 Feb 2012 in quant-ph | (1202.0928v3)
Abstract: 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\'emor. 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=t2+(t+1)2$ and distance $d=2t+1$, $t=1,2,...$. We also suggest several related algebraic constructions which nearly quadruple the rate of the existing hypergraph-product codes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.