DocumentCode
2921234
Title
Nonbinary quantum cyclic and subsystem codes over asymmetrically-decohered quantum channels
Author
Aly, Salah A. ; Ashikhmin, Alexei
Author_Institution
Dept. of Electr. Eng., Princeton Univ., Princeton, NJ, USA
fYear
2010
fDate
6-8 Jan. 2010
Firstpage
1
Lastpage
5
Abstract
Quantum computers theoretically are able to solve certain problems more quickly than any deterministic or probabilistic computers. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, one has to mitigate the resulting noise and decoherence effects to avoid computational errors in order to successfully build quantum computers. In this paper, we construct asymmetric quantum codes to protect quantum information over asymmetric quantum channels, Pr Z ≥ Pr X. Two generic methods are presented to derive asymmetric quantum cyclic codes using the generator polynomials and defining sets of classical cyclic codes. Consequently, the methods allow us to construct several families of quantum BCH, RS, and RM codes over asymmetric quantum channels. Finally, the methods are used to construct families of asymmetric subsystem codes.
Keywords
cyclic codes; polynomials; telecommunication channels; asymmetric quantum channels; generator polynomials; nonbinary quantum cyclic codes; subsystem codes; Cascading style sheets; Circuit noise; Computer errors; Error correction; Error correction codes; Galois fields; Polynomials; Quantum computing; Quantum mechanics; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory (ITW 2010, Cairo), 2010 IEEE Information Theory Workshop on
Conference_Location
Cairo
Print_ISBN
978-1-4244-6372-5
Type
conf
DOI
10.1109/ITWKSPS.2010.5503199
Filename
5503199
Link To Document