DMCA
Nonbinary Stabilizer Codes
| Citations: | 2 - 2 self |
BibTeX
@MISC{Sarvepalli_nonbinarystabilizer,
author = {Pradeep Kiran Sarvepalli and Salah A. Aly and Andreas Klappenecker},
title = { Nonbinary Stabilizer Codes},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Recently, the field of quantum error-correcting codes has rapidly emerged as an important discipline. As quantum information is extremely sensitive to noise, it seems unlikely that any large scale quantum computation is feasible without quantum error-correction. In this paper we give a brief exposition of the theory of quantum stabilizer codes. We review the stabilizer formalism of quantum codes, establish the connection between classical codes and stabilizer codes and the main methods for constructing quantum codes from classical codes. In addition to the expository part, we include new results that cannot be found elsewhere. Specifically, after reviewing some important bounds for quantum codes, we prove the nonexistence of pure perfect quantum stabilizer codes with minimum distance greater than 3. Finally, we illustrate the general methods of constructing quantum codes from classical codes by explicitly constructing two new families of quantum codes and conclude by showing how to construct new quantum codes by shortening.
Keyphrases
quantum code nonbinary stabilizer code classical code quantum error-correcting code quantum information important bound new quantum code stabilizer code large scale quantum computation brief exposition new family new result minimum distance general method expository part quantum error-correction important discipline quantum stabilizer code pure perfect quantum stabilizer code main method stabilizer formalism abstract recently
