A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Fault-tolerant quantum computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
IEEE Transactions on Information Theory
Efficient quantum stabilizer codes: LDPC and LDPC-convolutional constructions
IEEE Transactions on Information Theory
On the iterative decoding of sparse quantum codes
Quantum Information & Computation
Quantum error correction via codes over GF(4)
IEEE Transactions on Information Theory
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
A recursive approach to low complexity codes
IEEE Transactions on Information Theory
Sparse-graph codes for quantum error correction
IEEE Transactions on Information Theory
High Performance Entanglement-Assisted Quantum LDPC Codes Need Little Entanglement
IEEE Transactions on Information Theory
Enhanced Feedback Iterative Decoding of Sparse Quantum Codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.