Computer Science – Information Theory
Scientific paper
2011-02-15
Computer Science
Information Theory
Scientific paper
We face the following dilemma for designing low-density parity-check codes (LDPC) for quantum error correction. 1) The row weights of parity-check should be large: The minimum distances are bounded above by the minimum row weights of parity-check matrices of constituent classical codes. Small minimum distance tends to result in poor decoding performance at the error-floor region. 2) The row weights of parity-check matrices should not be large: The sum-product decoding performance at the water-fall region is degraded as the row weight increases. Recently, Kudekar et al. showed spatially-coupled (SC) LDPC codes exhibit capacity-achieving performance for classical channels. SC LDPC codes have both large row weight and capacity-achieving error-floor and water-fall performance. In this paper, we design SC LDPC-CSS (Calderbank, Shor and Steane) codes for quantum error correction over the depolarizing channels.
Hagiwara Manabu
Imai Hideki
Kasai Kenta
Sakaniwa Kohichi
No associations
LandOfFree
Spatially Coupled Quasi-Cyclic Quantum LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Spatially Coupled Quasi-Cyclic Quantum LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spatially Coupled Quasi-Cyclic Quantum LDPC Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-416193