A class of quantum low-density parity check codes by combining seed graphs
From MaRDI portal
Publication:352913
DOI10.1007/s11128-012-0519-zzbMath1267.81124OpenAlexW2092984103MaRDI QIDQ352913
Youngjoo Chung, Yongsoo Hwang, Moongu Jeon
Publication date: 5 July 2013
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-012-0519-z
Related Items
Uses Software
Cites Work
- Catalytic Quantum Error Correction
- Correcting Quantum Errors with Entanglement
- Multiple-particle interference and quantum error correction
- Sparse-Graph Codes for Quantum Error Correction
- A recursive approach to low complexity codes
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Error Correction and Orthogonal Geometry
- The capacity of low-density parity-check codes under message-passing decoding
- Design of capacity-approaching irregular low-density parity-check codes
- Quantum error correction via codes over GF(4)
- Good error-correcting codes based on very sparse matrices
- Quantum Serial Turbo Codes
- Efficient Quantum Stabilizer Codes: LDPC and LDPC-Convolutional Constructions
- Enhanced Feedback Iterative Decoding of Sparse Quantum Codes
- High Performance Entanglement-Assisted Quantum LDPC Codes Need Little Entanglement
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item