All Abstracts | Poster Abstracts | Talk Abstracts | Tutorial Abstracts

Generalized Concatenated Quantum Codes

Bei Zeng, Massachusetts Institute of Technology

(Session 3 : Friday from 2:00-2:30)

Abstract.

Quantum error-correcting codes play a central role in quantum computation and quantum information. While considerable understanding has now been obtained for a broad class of quantum codes, almost all of this has focused on stabilizer codes, the quantum analogues of classical additive codes. Nevertheless, there are a few known examples of nonadditive codes which outperform any possible stabilizer code. In previous work (a talk given at SQuInT 2008), my colleagues and I introduced the codeword stabilized ('CWS') quantum codes framework for understanding additive and nonadditive codes. Within this framework we found good new nonadditive codes using exhaustive or random search. However, these new codes have no obvious structure to generalize to other cases -- no nonbinary nonadditive code which outperforms any additive code has ever been found since the search space is getting too large. A systematical understanding of constructing good nonadditive CWS codes is still lacking.

In this work we provide a systematical method of constructing nonadditive CWS codes by introducing the concept of generalized concatenated quantum codes. Compared to the usual concatenated quantum code construction, the role of the basis vectors of the inner quantum code is taken on by subspaces of the inner code.

Using this generalized concatenation method, we systematically construct families of single-error-correcting nonadditive CWS codes, in both binary and nonbinary cases, which outperform any stabilizer codes. Particularly, we construct a ((90,2^{81.825},3)) qubit code as well as a ((840,3^{831.955},3)) qutrit code, which is the first known nonbinary nonadditive code that outperforms any stabilizer codes. For large block lengths, we show that these families of nonadditive codes asymptotically achieve the quantum Hamming bound. What is more, our new method can also be used to construct stabilizer codes. We show that many good stabilizer codes, e.g. quantum Hamming codes, can be constructed this way. Moreover, we found new stabilizer codes with better parameters than previously known, e.g. a [[36,26,4]] qubit code.

Based on joint work with Markus Grassl, Peter Shor, Graeme Smith, and John Smolin.