Upper bounds on the size of quantum codes

IEEE Transactions on Information Theory

Volumn 45, Issue 4, 1999, Pages 1206-1215

  Ashikhmin, Alexei ^a   Litsyn, Simon ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); ERROR CORRECTION; LINEAR PROGRAMMING;

LINEAR QUANTUM CODES; QUANTUM MACWILLIAMS IDENTITY;

CODES (SYMBOLS);

EID: 0032656276     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.761270     Document Type: Article

References (27)

1. M. J. Aaltonen Linear programming bounds for tree codes," IEEE Trans. Inform. Theory, vol. IT-25, pp. 85-90, 1977.
2. _ A new bound on nonbinary block codes," Discr. Math., vol. 83, pp. 139-160, 1990.
3. A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane Quantum error correction and orthogonal geometry," Phys. Rev. Lett., vol. 78, pp. 405-409, 1997.
4. _ Quantum errors correction via codes over GF (4)," IEEE Trans. Inform. Theory, vol. 44, pp. 1369-1387, July 1998.
5. A. R. Calderbank and P. W. Shor Good quantum error-correcting codes exist," Phys. Rev. A, vol. 54, pp. 1098-1105, 1996.
6. R. Cleve Quantum stabilizer codes and classical linear codes," Phys. Rev. A, vol. 55, pp. 4054-4059, 1997.
7. P. Delsarte An algebraic approach to the association schemes of coding theory," Philips Res. Repts. Suppl., no. 10, 1973.
8. D. Dieks Communication by EPR devices," Phys. Lett. A, vol. 92, p. 271, 1982.
9. A. Ekert and C. Macchiavello Error correction in quantum communication," Phys. Rev. Lett., vol. 77, pp. 2585-2588, 1996.
10. D. Gottesman A class of quantum error-correcting codes saturating the quantum Hamming bound," Phys. Rev. A, vol. 54, pp. 1862-1868, 1996.
11. G. Kalai and N. Linial On the distance distribution of codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1467-1472, 1995.
12. A. Kitaev, private communication, 1997.
13. E. Knill and R. Laflamme A theory of quantum error correcting codes," Phys. Rev. A, vol. 55, pp. 900-911, 1997.
14. T. Laihonen and S. Litsyn On upper bounds for minimum distance and covering radius of nonbinary codes," Des., Codes, Cryptogr., vol. 14, no. 1, pp. 71-80, 1998.
15. V. I. Levenshtein Krawtchouk polynomials and universal bounds for codes and designs in hamming spaces," IEEE Trans. Inform. Theory, vol. 41, pp. 1303-1321, Sept. 1995.
16. R. J. McEliece, E. R. Rodemich, H. C. Rumsey Jr., and L. R. Welch New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans. Inform. Theory, vol. IT-23, pp. 157-166, 1977.
17. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
18. F. J. Mac Williams, N. J. A. Sloane, and J. G. Thompson Good self dual codes exist," Discr. Math., vol. 3, pp. 153-162, 1972.
19. E. M. Rains Quantum weight enumerators," IEEE Trans. Inform. Theory, vol. 44, pp. 1388-1394, July 1998.
20. _ Nonbinary quantum codes," LANL e-print quant-ph/9703048.
21. _ Quantum shadow enumerators," LANL e-print quant-ph/961101.
22. P. W. Shor and R. Laflamme Quantum analog of the MacWilliams identities in classical coding theory," Phys. Rev. Lett., vol. 78, pp. 1600-1602, 1997.
23. P. W. Shor Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer," in Proc. 35th Anna. Symp. Foundations of Computer Science, S. Goldwasser (Ed.). Los Alamitos, CA: IEEE Comp. Soc. Press, , 1994, p. 124.
24. _ Scheme for reducing decoherence in quantum memory," Phys. Rev. A, vol. 52, p. 2493, 1995.
25. A. M. Steane Simple quantum error correcting codes," Phys. Rev. Lett., vol. 77, pp. 793-797, 1996.
26. _ Multiple particle interference and quantum error correction," Proc. Roy. Soc. London A, vol. 452, pp. 2551-2577, 1996.
27. W. K. Wooters and W. H. Zurek A single quantum cannot be cloned," Nature, vol. 299, p. 802, 1982.