Constructions of Pure Asymmetric Quantum Alternant Codes Based on Subclasses of Alternant Codes
arXiv:1401.3215
Abstract
In this paper, we construct asymmetric quantum error-correcting codes(AQCs) based on subclasses of Alternant codes. Firstly, We propose a new subclass of Alternant codes which can attain the classical Gilbert-Varshamov bound to construct AQCs. It is shown that when , -parts of the AQCs can attain the classical Gilbert-Varshamov bound. Then we construct AQCs based on a famous subclass of Alternant codes called Goppa codes. As an illustrative example, we get three AQCs from the well known binary Goppa code. At last, we get asymptotically good binary expansions of asymmetric quantum GRS codes, which are quantum generalizations of Retter's classical results. All the AQCs constructed in this paper are pure.
References in corpus (7)
- Fault-tolerant quantum computation against biased noise
- Asymptotically Good Quantum Codes
- Additive Asymmetric Quantum Codes
- CSS-like Constructions of Asymmetric Quantum Codes
- Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
- Error correction optimisation in the presence of X/Z asymmetry
- Analytic asymptotic performance of topological codes