A class of quantum low-density parity check codes by combining seed graphs.

This paper proposes a new construction of quantum low-density parity check (LDPC) codes that belong to the class of general stabilizer (non-CSS) codes. The method constructs a binary check matrix $$A=(A_{1}|A_{2})$$ associated with the stabilizer generators of a quantum LDPC code. The binary check matrix is obtained from a large bipartite graph built by combining several small bipartite graphs called seed graphs. Computer simulation results show that the proposed code has similar or better performance than other quantum LDPC codes, and can be improved by exploiting the degenerate effect of quantum error-correcting codes. [ABSTRACT FROM AUTHOR]