Abstract
Quantum error correcting codes are indispensable for quantum information processing and quantum computation. In 1995 and 1996, Shor and Steane gave first several examples of quantum codes from classical error correcting codes. The construction of efficient quantum codes is now an active multi-discipline research field. In this paper we review the known several constructions of quantum codes and present some examples.
Similar content being viewed by others
References
Shor P W. Scheme for reducing decoherence in quantum computer memory. Physical Review A, 1995, 52: R2493–R2496
Steane A M. Multiple particle interference and quantum error correction. In: Proceedings of the Royal Society A, Nov., 1996, 452: 2551–2577
Calderbank A R, Rains E M, Shor P W, et al. Quantum error correction via codes over GF(4). IEEE Transactions On Information Theory, 1998, 44: 1369–1387
Calderbank A R, Shor P W. Good quantum error-correcting codes exist. Physical Review A, 1996, 54: 1098–1105
Steane A M. Enlargement of Calderbank-Shor-Steane quantum codes. IEEE Transactions on Information Theory, 1999, 45: 2492–2495
Bierbrauer J, Edel Y. Quantum twisted codes. Journal of Combinatorial Designs, 2000, 8: 174–188
Bierbrauers J. http://www.math.mtu.edu/:_jbierbra
Chen H, Ling S, Xing C. Quantum codes from concatenated algebraic geometric codes. IEEE Transactions on Information Theory, August, 2005, 51: 2915–2920
Schlingemann D, Werner R F. Quantum error-correcting codes associated with graphs. Physical Review A, 2001, 65(012308)
Thangaraj A, McLaughlin S W. Quantum codes from cyclic codes over GF(4m). IEEE Transactions on Information Theory, 2001, 47(3): 1176–1178
Steane A M. Quantum Reed-Muller codes. IEEE Transactions on Information Theory, 1999, 45: 1701–1703
Cohen G, Encheva S, Litsyn S. On binary construction of quantum codes. IEEE Transactions on Information Theory, 1999, 45: 2495–2498
Chen H, Some good quantum error-correcting codes from algebraic geometric codes. IEEE Transactions on Information Theory, July, 2001, 47: 2059–2061
Ashikhmin A, Litsyn S, Tsfasman M A. Asymptotically good quantum codes. Physical Review A: 2001, 63(032311)
Chen H, Ling S, Xing C. Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound. IEEE Transactions on Information Theory, 2001, 47: 2055–2058
Matsumoto R. Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes. IEEE Transactions on Information Theory, 2002, 48(2): 2122–2124
Feng K, Ling S, Xing C. Asymptotic bound on quantum codes from algebraic geometry codes. IEEE Transactions on Information Theory, 2006, 52(3): 986–991
Feng Kxxx Qauntum codes [[6xxx 2xxx 3]]p [[7xxx 3xxx 3]]p exists. IEEE Transactions on Information Theory, 2002, 48(8): 2384–2391
Li R, Li X. Binary construction of quantum codes of minimum distance three and four. IEEE Transactions on Information Theory, 2004, 50(6): 1331–1336
Lin X. Quantum cyclic and constacyclic codes. IEEE Transactions on Information Theory, 2004, 50(3): 547–549.
Schlingemann D, Werner R F. Quantum error-correcting codes associated with graphs. Phys. Rev. A, 2001, 65(012308)
MacKay D J C, Mitchison G, McFadden P L. Sparse-graph codes for quantum error correction. IEEE Transactions on Information Theory, 2004, 50(10): 2315–2330
Ketker A, Klappenecker A, Kumar S, et al. Nonbinary stablizer codes over finite fields, IEEE Transactions on Information Theory, 2006, 52(11): 4892–4913
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, H. Constructing quantum codes. Front. Comput. Sci. China 2, 143–146 (2008). https://doi.org/10.1007/s11704-008-0014-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11704-008-0014-y