Entanglement-Assisted Quantum Quasi-Cyclic Low-Density Parity-Check Codes
arXiv:0803.0100 · doi:10.1103/PhysRevA.79.032340
Abstract
We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasi-cyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized Calderbank-Shor-Steane (CSS) construction do not need to satisfy the dual-containing property as long as pre-shared entanglement is available to both sender and receiver. We can use this to avoid the many 4-cycles which typically arise in dual-containing LDPC codes. The advantage of such quantum codes comes from the use of efficient decoding algorithms such as sum-product algorithm (SPA). It is well known that in the SPA, cycles of length 4 make successive decoding iterations highly correlated and hence limit the decoding performance. We show the principle of constructing quantum QC-LDPC codes which require only small amounts of initial shared entanglement.
8 pages, 1 figure. Final version that will show up on PRA. Minor changes in contents and Title
References in corpus (3)
Cited by in corpus (31)
- Entanglement-assisted quantum turbo codes
- Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
- Multiplicativity of completely bounded -norms implies a strong converse for entanglement-assisted capacity
- High performance entanglement-assisted quantum LDPC codes need little entanglement
- Entanglement-assisted quantum low-density parity-check codes
- Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
- Entanglement-Assisted Quantum Error-Correcting Codes with Imperfect Ebits
- Quantum rate distortion, reverse Shannon theorems, and source-channel separation
- Enhanced Feedback Iterative Decoding of Sparse Quantum Codes
- The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
- Classical Enhancement of Quantum Error-Correcting Codes
- Dualities and Identities for Entanglement-Assisted Quantum Codes
- A characterization of entanglement-assisted quantum low-density parity-check codes
- Practical Limits of Error Correction for Quantum Metrology
- Quantum error correction via less noisy qubits
- High-rate quantum low-density parity-check codes assisted by reliable qubits
- Entanglement-assisted concatenated quantum codes
- Quantum Circuits for Stabilizer Error Correcting Codes: A Tutorial
- Asymmetric Quantum Concatenated and Tensor Product Codes with Large Z-Distances
- Systematic Design and Optimization of Quantum Circuits for Stabilizer Codes
- New constructions of CSS codes obtained by moving to higher alphabets
- Optimized Entanglement-Assisted Quantum Error Correction
- The Encoding and Decoding Complexities of Entanglement-Assisted Quantum Stabilizer Codes
- Family of Finite Geometry Low-Density Parity-Check Codes for Quantum Key Expansion
- Error Correction for Reliable Quantum Computing
- An Optimized Nearest Neighbor Compliant Quantum Circuit for 5-qubit Code
- Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q + 1
- Bounds on concatenated entanglement-assisted quantum error-correcting codes
- Practical Entanglement Distillation Scheme Using Recurrence Method And Quantum Low Density Parity Check Codes
- Apologizing Comment on `Quantum Quasi-Cyclic Low-Density Parity-Check codes"
- Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors