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

DOI10.1109/TIT.2008.2006416MaRDI QIDQ3604850zbMATH OpenFDO

Authors Mitsuru Hamada

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0610195

Mathematics Subject Classification ID

Quantum coding (general) (81P70) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

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.

Recommendations

• Optimal correction of concatenated fault-tolerant quantum codes
• Quantum error-correcting codes: the unit design strategy
• Quantum Codes From Concatenated Algebraic-Geometric Codes
• Quantum error-correcting codes
• EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES

Cited in

(26)

• QEC and EAQEC codes from cyclic codes over non-chain rings
• On quantum SPC product codes
• Asymmetric quantum Reed-Solomon and generalized Reed-Solomon codes
• On the construction of asymmetric quantum codes
• Good rate QECCs from the quantum construction \(X\)
• New quantum codes from two linear codes
• On the distance of stabilizer quantum codes from \(J\)-affine variety codes
• Constructions of new families of nonbinary CSS codes
• On steane-enlargement of quantum codes from Cartesian product point sets
• Constructions of quantum MDS codes
• On the hardnesses of several quantum decoding problems
• On non-binary quantum repeated-root cyclic codes
• Three families of self-orthogonal codes and their application in optimal quantum codes
• New quantum codes from evaluation and matrix-product codes
• Optimal correction of concatenated fault-tolerant quantum codes
• NEW QUANTUM CODES CONSTRUCTED FROM A CLASS OF IMPRIMITIVE BCH CODES
• Self-orthogonal codes with dual distance three and quantum codes with distance three over \(\mathbb F_5\)
• THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
• Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
• A class of constacyclic BCH codes and new quantum codes
• Steane enlargement of entanglement-assisted quantum error-correcting codes
• New stabilizer codes from the construction of dual-containing matrix-product codes
• Steane-enlargement of quantum codes from the Hermitian function field
• Ternary self-orthogonal codes of dual distance three and ternary quantum codes of distance three
• CONCATENATION OF ERROR AVOIDING WITH ERROR CORRECTING QUANTUM CODES FOR CORRELATED NOISE MODELS
• On dual-containing, almost dual-containing matrix-product codes and related quantum codes

This page was built for publication: Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604850)