Asymptotically good quantum codes

Alexei Ashikhmin, Simon Litsyn, Michael A. Tsfasman

Research output: Contribution to journalArticlepeer-review

Abstract

A polynomial construction of quantum codes with asymptotically nonzero rate and relative distance was presented using algebraic geometry codes. The generator matrix of the sympletic code was used to construct a polynomial complexity encoder, which is a sequence of Gaussian elimination of k×n matrices. It was shown that generator matrices of algebraic geometry codes can be constructed in polynomial time.

Original languageEnglish
Article number032311
Pages (from-to)1-5
Number of pages5
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Volume63
Issue number3
DOIs
StatePublished - Mar 2001

Fingerprint

Dive into the research topics of 'Asymptotically good quantum codes'. Together they form a unique fingerprint.

Cite this