We improve performance of the asymptotically good quantum codes constructed by Ashikhmin, Litsyn and Tsfasman (see Phys. Rev. A, vol.63, no.3, p.032311, 2001), by using more rational points on algebraic curves.
It is known that quantum error correction can be achieved using classical binary codes or additive codes over F/sub 4/. Asymptotically good quantum codes have been constructed from algebraic-geometry codes and a bound on (/spl delta/, R) was computed from the Tsfasman-Vladut-Zink bound of the theory of classical algebraic-geometry codes. In this correspondence, by the use of a concatenation technique we construct a family of asymptotically good quantum codes exceeding the bound in a small interval.
In classical coding theory code concatenation is successfully used to construct good errorcorrecting codes and most of the asymptotically good codes known so far are based on concatenation. In this paper we present some classes of asymptotically good concatenated quantum codes, which are a quantum analogue of classical concatenated codes, and derive lower bounds on the minimum distance and the rate of the codes. Our bounds improve on the best lower bound of Ashikhmin–Litsyn–Tsfasman and Matsumoto for rates smaller than about one half. We also give a polynomial-time decoding algorithm for the codes that can decode up to one fourth of the lower bound on the minimum distance of the codes.