Quantum "hyperbicycle" low-density parity check codes with finite rate

Abstract: We introduce a "hyperbicycle" ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Z\'emor and generalized bicycle codes by MacKay et al. as limiting cases. The construction allows for both the lower and the upper bounds on the minimum distance; they scale as a square root of the block length. Many of thus defined codes have finite rate and a limited-weight stabilizer generators, an analog of classical low-density parity check (LDPC) codes. Compared to the hypergraph-product codes, hyperbicycle codes generally have wider range of parameters; in particular, they can have higher rate while preserving the (estimated) error threshold.