Abstract
We construct a universal code for a stationary and memoryless classical-quantum channel as a quantum version of the universal coding by Csiszár and Körner. Our code is constructed utilizing a combination of irreducible representations, a decoder introduced through the quantum information spectrum, and the packing lemma.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Shannon C.E.: A mathematical theory of communication. Bell System Technical Journal 27, 623–656 (1948)
Holevo A.S.: The capacity of the quantum channel with general signal states. IEEE Trans. Inform. Theory 44, 269–273 (1998)
Schumacher B., Westmoreland M.D.: Sending classical information via noisy quantum channels. Phys. Rev. A 56, 131–138 (1997)
Holevo A.S.: Bounds for the quantity of information transmitted by a quantum communication channel. Probl. Inform. Transm. 9, 177–183 (1973)
Holevo A.S.: On the capacity of quantum communication channel. Probl. Inform. Transm. 15(4), 247–253 (1979)
Fujiwara, A., Nagaoka, H.: Capacity of a memoryless quantum communication channel. Mathematical Engineering Technical Reports, METR 94-22, the University of Tokyo, http://www.keisu.t.u-tokyo.ac.jp/research/techrep/1994.html, 1994
Holevo, A.S.: Quantum Coding Theorems. Russ. Math. Surv. 53:6, 1295–1331 (1999); Coding Theorems for quantum channels, http://arXiv.org/abs/quant-ph/9809023, 1998
Hayashi M.: Quantum Information: An Introduction. Springer, Berlin (2006)
Ogawa T., Nagaoka H.: Making good codes for classical-quantum channel coding via quantum hypothesis testing. IEEE Trans. Inform. Theory 53, 2261–2266 (2007)
Hayashi M., Nagaoka H.: General formulas for capacity of classical-quantum channels. IEEE Trans. Infor. Theory 49, 1753–1768 (2003)
Csiszár I., Körner J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, London-New York (1981)
Lynch T.J.: Sequence time coding for data compression. Proc. IEEE 54, 1490–1491 (1966)
Davisson L.D.: Comments on Sequence time coding for data compression. Proc. IEEE 54, 2010 (1966)
Jozsa R., Horodecki M., Horodecki P., Horodecki R.: Universal quantum information compression. Phys. Rev. Lett. 81, 1714 (1998)
Hayashi M.: Exponents of quantum fixed-length pure state source coding. Phys. Rev. A 66, 032321 (2002)
Hayashi M., Matsumoto K.: Quantum universal variable-length source coding. Phys. Rev. A 66, 022311 (2002)
Verdú S., Han T.S.: A general formula for channel capacity. IEEE Trans. Inform. Theory 40, 1147–1157 (1994)
Hayashi M.: Asymptotics of quantum relative entropy from a representation theoretical viewpoint. J. Phys. A: Math. and Gen. 34, 3413–3419 (2001)
Keyl M., Werner R.F.: Estimating the spectrum of a density operator. Phys. Rev. A 64, 052311 (2001)
Hayashi M.: Optimal sequence of POVMs in the sense of Stein’s lemma in quantum hypothesis. J. Phys. A: Math. and Gen. 35, 10759–10773 (2002)
Bjelaković I., Deuschel J.-D., Kruger T., Seiler R., Siegmund-Schultze R., Szkoła A.: A quantum version of sanov’s theorem. Commun. Math. Phys. 260, 659–671 (2005)
Matsumoto K., Hayashi M.: Universal distortion-free entanglement concentration. Phys. Rev. A 75, 062338 (2007)
Christandl, M.: The structure of bipartite quantum states - insights from group theory and cryptography. PhD thesis, February, University of Cambridge, http://arxiv.org/abs/quant-ph/0604183, 2006
Krattenthaler C., Slater P.: Asymptotic redundancies for universal quantum coding. IEEE Trans. Inform. Theory 46, 801–819 (2000)
Clarke B.S., Barron A.R.: Information-theoretic asymptotics of Bayes methods. IEEE Trans. Inform. Theory 36, 453–471 (1990)
Hayashi, M.: Universal approximation of multi-copy states and universal quantum lossless data compression. http://arxiv.org/abs/:0806.1091v2[quant-ph], 2008
Hayashi M.: Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding. Phys. Rev. A 76, 062301 (2007)
Bjelakovic, I., Boche, H.: Classical capacities of averaged and compound quantum channels. http://arxiv.org/abs/0710.3027v2[quant-ph], 2009
Acknowledgement
This research was partially supported by a Grant-in-Aid for Scientific Research on Priority Area ‘Deepening and Expansion of Statistical Mechanical Informatics (DEX-SMI)’, No. 18079014 and a MEXT Grant-in-Aid for Young Scientists (A) No. 20686026. The author thanks the referees and the editor for helpful comments concerning this manuscript. He also acknowledges Professor Hiroshi Nagaoka for an interesting discussion.
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by M.B. Ruskai
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Hayashi, M. Universal Coding for Classical-Quantum Channel. Commun. Math. Phys. 289, 1087–1098 (2009). https://doi.org/10.1007/s00220-009-0825-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00220-009-0825-1