Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Letter
  • Open Access

Entanglement-assisted quantum communication beating the quantum Singleton bound

Markus Grassl

  • International Centre for Theory of Quantum Technologies, University Gdansk, 80-308 Gdansk, Poland and Max-Planck-Institut für die Physik des Lichts, 91058 Erlangen, Germany

Phys. Rev. A 103, L020601 – Published 24 February, 2021

DOI: https://doi.org/10.1103/PhysRevA.103.L020601

Abstract

Brun, Devetak, and Hsieh [Science 314, 436 (2006)] demonstrated that preshared entanglement between the sender and receiver enables quantum communication protocols that have better parameters than schemes without the assistance of entanglement. Subsequently, the same authors derived a version of the so-called quantum Singleton bound that relates the parameters of the entanglement-assisted quantum-error-correcting codes proposed by them. We present an entanglement-assisted quantum communication scheme with parameters violating this bound in certain ranges. For a fixed transmission rate, our scheme allows one to correct a larger fraction of errors.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (26)

  1. C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels, Phys. Rev. Lett. 70, 1895 (1993).
  2. C. H. Bennett, H. J. Bernstein, S. Popescu, and B. Schumacher, Concentrating partial entanglement by local operations, Phys. Rev. A 53, 2046 (1996).
  3. C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, Mixed-state entanglement and quantum error correction, Phys. Rev. A 54, 3824 (1996).
  4. E. Knill and R. Laflamme, Theory of quantum error-correcting codes, Phys. Rev. A 55, 900 (1997).
  5. P. W. Shor, Fault-tolerant quantum computation, in Proceedings 37th Annual Symposium on Foundations of Computer Science (IEEE, New York, 1996), pp. 56–65.
  6. T. Brun, I. Devetak, and M.-H. Hsieh, Correcting quantum errors with entanglement, Science 314, 436 (2006).
  7. T. Brun, I. Devetak, and M.-H. Hsieh, Catalytic quantum error correction, IEEE Trans. Inf. Theory 60, 3073 (2014).
  8. N. J. Cerf and R. Cleve, Information-theoretic interpretation of quantum error-correcting codes, Phys. Rev. A 56, 1721 (1997).
  9. W. K. Wootters and W. H. Zurek, A single quantum cannot be cloned, Nature (London) 299, 802 (1982).
  10. The dimension is quite often denoted by the letter d, which in the context of coding theory is used to denote the minimum distance. To avoid ambiguity, we use the letter q instead.
  11. When the local dimension q is a power of a prime, the Weyl-Heisenberg operators are defined with respect to the finite field GF(q) with q elements instead of the integers modulo q as before.
  12. M. Grassl, T. Beth, and T. Pellizzari, Codes for the quantum erasure channel, Phys. Rev. A 56, 33 (1997).
  13. E. M. Rains, Nonbinary quantum codes, IEEE Trans. Inf. Theory 45, 1827 (1999).
  14. M. Grassl and M. Rötteler, Quantum MDS codes over small fields, in Proceedings 2015 IEEE International Symposium on Information Theory (ISIT) (IEEE, New York, 2015), pp. 1104–1108.
  15. C.-Y. Lai and A. Ashikhmin, Linear programming bounds for entanglement-assisted quantum error-correcting codes by split weight enumerators, IEEE Trans. Inf. Theory 64, 622 (2018).
  16. J. Fan, H. Chen, and J. Xu, Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q+1, Quantum Inf. Comput. 16, 423 (2016).
  17. C. Carlet, S. Mesnager, C. Tang, Y. Qi, and R. Pellikaan, Linear codes over Fq are equivalent to LCD codes for q>3, IEEE Trans. Inf. Theory 64, 3010 (2018).
  18. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (North-Holland, Amsterdam, 1977).
  19. M. Grassl, Entanglement-assisted quantum communication beating the quantum Singleton bound, presented at 16th Asian Quantum Information Science Conference (AQIS 2016), Taipei, Taiwan, 2016, available at http://aqis-conf.org/2016/program/.
  20. A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54, 1098 (1996).
  21. A. M. Steane, Error Correcting Codes in Quantum Theory, Phys. Rev. Lett. 77, 793 (1996).
  22. H. F. Chau, Five quantum register error correction code for higher spin systems, Phys. Rev. A 56, R1 (1997).
  23. J. H. Griesmer, A bound for error-correcting codes, IBM J. Res. Dev. 4, 532 (1960).
  24. G. Solomon and J. J. Stiffler, Algebraically punctured cyclic codes, Inf. Control 8, 170 (1965).
  25. G. Bowen, Entanglement required in achieving entanglement-assisted channel capacities, Phys. Rev. A 66, 052313 (2002).
  26. M. Grassl, F. Huber, and A. Winter, Entropic proofs of Singleton bounds for quantum error-correcting codes, arXiv:2010.07902.

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation