Codeword stabilized quantum codes

Authors:
Andrew Cross;Graeme Smith;John A. Smolin;Bei Zeng
Affiliations:
Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, MA and IBM T. J. Watson Research Center, Yorktown Heights, NY;IBM T. J. Watson Research Center, Yorktown Heights, NY;IBM T. J. Watson Research Center, Yorktown Heights, NY;Department of Physics, Massachusetts Institute of Technology, Cambridge, MA
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 7
Cited 3

Fault-tolerant quantum computation with constant error

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Stabilizer codes can be realized as graph codes

Quantum Information & Computation
Quantum error correction via codes over GF(4)

IEEE Transactions on Information Theory
Quantum codes of minimum distance two

IEEE Transactions on Information Theory
Quantum shadow enumerators

IEEE Transactions on Information Theory
Boolean Functions, Projection Operators, and Quantum Error Correcting Codes

IEEE Transactions on Information Theory

Generalized concatenation for quantum codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Non-Pauli observables for CWS codes

Quantum Information Processing
Fault-tolerant quantum error correction code conversion

Quantum Information & Computation

Quantified Score

Hi-index	754.88

Visualization

Abstract

We present a unifying approach to quantum error correcting code design that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters. We use this framework to generate new codes with superior parameters to any previously known. In particular, we find ((10,18,3)) and ((10,20,3)) codes. We also show how to construct encoding circuits for all codes within our framework.