Quantum operations and codes beyond the Stabilizer-Clifford framework

The discovery of quantum error-correcting codes (QECCs) and the theory of fault-tolerant quantum computation (FTQC) have greatly improved the long-term prospects for quantum communication and computation technology. Stabilizer codes, a quantum analogue of classical additive codes, are the most important class of QECCs. These codes have dominated the study of quantum error-correction and fault-tolerance ever since the discovery of QECC-FTQC in the mid-1990s. The dominance of stabilizer codes is not only due to their simple construction based on Abelian groups, but also because of the simplicity with which operations in the Clifford group can be performed on them. However, practical QECC-FTQC schemes neither achieve the maximum theoretical communication rate despite the noise nor do they allow sufficient gate failure probability to meet the needs of our current technology. Therefore, it is necessary to go beyond this framework to seek for new QECC-FTQC techniques. This thesis develops a systematic study of QECC-FTQC beyond the Stabilizer-Clifford framework, building on both well-known results and recent theoretical advances. Our new systematic theory includes two main parts. The first part provides further understanding of quantum operations on stabilizer codes, that is, the "minimal subcodes+semi-Clifford operations" theory for studying non-Clifford operations on stabilizer codes. The other part deals with the construction of QECCs, that is, the codeword stabilized (CWS) quantum codes framework combined with the generalized concatenation method for constructing good nonadditive (and stabilizer) quantum codes.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Physics.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2009

Author dc:creator

• Zeng, Bei, Ph. D. Massachusetts Institute of Technology

Advisor dc:contributor.advisor

• Isaac L. Chuang.

• Physics.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/53235

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/53235