Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes

R. Matsumoto

Published Jun 25, 2003• 4 citations
Publisher

Abstract

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, Mar. 2001), by using more rational points on algebraic curves.
DOI
10.1109/isit.2002.1023476

Related papers

Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes

Ryutaroh Matsumoto

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.

arXiv:quant-ph/0107129•IEEE Transactions on Information Theory•Jul 1, 2002•39 citations

Some Good Error-Correcting Codes from Algebraic-Geometric Codes

Hao Chen

Algebraic-geometric codes on Garcia-Stichtenoth family of curves are used to construct the asymptotically good quantum codes.

arXiv:quant-ph/0107102•Jul 20, 2001•1 citation

Construction of Asymptotically Good p~m-ary Quantum Codes

Hao Chen

This paper applies algebraic-geometric codes to construct a family of asymptot- ically good p~m-ary quantum codes,for any prime power p~m.

Chinese Annals of Mathematics•Jan 1, 2008•0 citations

Asymptotically good quantum codes

Alexei Ashikhmin, Simon N. Litsyn, Michael Anatol'evich Tsfasman

Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.

arXiv:quant-ph/0006061•Physical Review A•Feb 1, 2001•90 citations

Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound

Hao Chen, San Ling, Chaoping Xing

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.

IEEE Transactions on Information Theory•Jul 1, 2001•51 citations

On binary constructions of quantum codes

Gérard Cohen, S. Encheva, Simon N. Litsyn

We improve estimates on the parameters of quantum codes obtained by Steane's (see ibid., vol.45, no.7, p.2492-5, 1999) construction from binary codes. This yields several new families of quantum codes.

IEEE Transactions on Information Theory•Jan 1, 1999•67 citations
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.