Return to search

Upper bounds on minimum distance of nonbinary quantum stabilizer codes

The most popular class of quantum error correcting codes is stabilizer codes. Binary quantum stabilizer codes have been well studied, and Calderbank, Rains, Shor and Sloane (July 1998) have constructed a table of upper bounds on the minimum distance of these codes using linear programming methods. However, not much is known in the case of nonbinary stabilizer codes. In this thesis, we establish a bridge between selforthogonal classical codes over the finite field containing q2 elements and quantum codes, extending and unifying previous work by Matsumoto and Uyematsu (2000), Ashikhmin and Knill (November 2001), Kim and Walker (2004). We construct a table of upper bounds on the minimum distance of the stabilizer codes using linear programming methods that are tighter than currently known bounds. Finally, we derive code construction techniques that will help us find new codes from existing ones. All these results help us to gain a better understanding of the theory of nonbinary stabilizer codes.
Date01 November 2005
CreatorsKumar, Santosh
ContributorsKlappenecker, Andreas
PublisherTexas A&M University
Source SetsTexas A and M University
Detected LanguageEnglish
TypeBook, Thesis, Electronic Thesis, text
Format307868 bytes, electronic, application/pdf, born digital

Page generated in 0.0015 seconds