A family of asymptotically good quantum codes based on code concatenation

Authors:
Zhuo Li;Lijuan Xing;Xinmei Wang
Affiliations:
State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, Shannxi, China;State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, Shannxi, China;State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, Shannxi, China
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 6
Cited 2

Quantum error correction via codes over GF(4)

IEEE Transactions on Information Theory
Quantum weight enumerators

IEEE Transactions on Information Theory
Nonbinary quantum codes

IEEE Transactions on Information Theory
Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound

IEEE Transactions on Information Theory
Nonbinary quantum stabilizer codes

IEEE Transactions on Information Theory
Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes

IEEE Transactions on Information Theory

On a problem concerning the quantum hamming bound for impure quantum codes

IEEE Transactions on Information Theory
Application of classical hermitian self-orthogonal MDS codes to quantum MDS codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.96

Visualization

Abstract

We explicitly construct an infinite family of asymptotically good concatenated quantum stabilizer codes where the outer codes use quantum Reed-Solomon codes and the inner codes use a set of special quantum codes. In the field of quantum error-correcting codes, this is the first time that a family of asymptotically good quantum codes is derived from bad codes. Its occurrence supplies a gap in quantum coding theory.