Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

Details Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

2006-10-23

arxiv.org/abs/quant-ph/0610195v4

IEEE Trans. on Information Theory, vol. 54, no. 12, pp. 5689--5704, 2008

Physics

Quantum Physics

16 pages, 3 figures. Ver.4: Title changed. Ver.3: Due to a request of the AE of the journal, the present version has become a

Scientific paper

A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.

Affiliated with

Also associated with

No associations

Rating

Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction 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 Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-277478