Quantum Reed-Solomon Codes

Abstract

After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about the position of errors. This error model - the quantum erasure channel - is discussed. Finally, parameters of quantum BCH codes are provided.

Summary only (2 pages), for the full version see: Proceedings Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-13), Lecture Notes in Computer Science 1719, Springer, 1999

References in corpus (1)

• Quantum Computing

Cited by in corpus (10)

• Cyclic Quantum Error-Correcting Codes and Quantum Shift Registers
• The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
• Log-domain decoding of quantum LDPC codes over binary finite fields
• $i$-QER: An Intelligent Approach towards Quantum Error Reduction
• Structure of CSS and CSS-T 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
• An Optimized Nearest Neighbor Compliant Quantum Circuit for 5-qubit Code
• Multiplexed Quantum Communication with Surface and Hypergraph Product Codes