Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
arXiv:quant-ph/0610195 · doi:10.1109/TIT.2008.2006416
Abstract
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.
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 combination of (thoroughly revised) quant-ph/0610194 and the former quant-ph/0610195. Problem formulations of polynomial complexity are strictly followed. An erroneous instance of a lower bound on minimum distance was removed
Cited by in corpus (11)
- On the Construction of Nonbinary Quantum BCH Codes
- New Quantum Codes from Evaluation and Matrix-Product Codes
- Stabilizer quantum codes from -affine variety codes and a new Steane-like enlargement
- On Classical and Quantum MDS-Convolutional BCH Codes
- On the distance of stabilizer quantum codes from -affine variety codes
- Concatenated quantum codes can attain the quantum Gilbert-Varshamov bound
- The Physics of Quantum Information: Complementarity, Uncertainty, and Entanglement
- On Steane-Enlargement of Quantum Codes from Cartesian Product Point Sets
- Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically
- Steane-Enlargement of Quantum Codes from the Hermitian Curve
- Steane enlargement of Entanglement-Assisted Quantum Error-Correcting Codes