Strong converse for the classical capacity of the pure-loss bosonic channel
- 52 Downloads
This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in . In particular, we first prove that there exists a trade-off between communication rate and error probability if one imposes only a mean photon number constraint on the channel inputs. That is, if we demand that the mean number of photons at the channel input cannot be any larger than some positive number NS, then it is possible to respect this constraint with a code that operates at a rate g(ηNS/(1-p)) where p is the code error probability, η is the channel transmissivity, and g(x) is the entropy of a bosonic thermal state with mean photon number x. Then we prove that a strong converse theorem holds for the classical capacity of this channel (that such a rate-error trade-off cannot occur) if one instead demands for a maximum photon number constraint, in such a way that mostly all of the “shadow” of the average density operator for a given code is required to be on a subspace with photon number no larger than nNS, so that the shadow outside this subspace vanishes as the number n of channel uses becomes large. Finally, we prove that a small modification of the well-known coherent-state coding scheme meets this more demanding constraint.
KeywordsInformation Transmission Success Probability Quantum Channel Density Operator Photon Number
Unable to display preview. Download preview PDF.
- 9.Wilde, M.M., Guha, S., Tan, S.-H., and Lloyd, S., Explicit Capacity-Achieving Receivers for Optical Communication and Quantum Reading, Proc. 2012 IEEE Int. Sympos. on Information Theory (ISIT’2012), Cambridge, MA, USA, July 1–6, 2012, pp. 551–555.Google Scholar
- 13.Winter, A., Coding Theorems of Quantum Information Theory, PhD Thesis, Univ. Bielefeld, Germany, 1999. Available at arXiv:quant-ph/9907077.Google Scholar
- 14.Koenig, R. and Wehner, S., A Strong Converse for Classical Channel Coding Using Entangled Inputs, Phys. Rev. Lett., 2009, vol. 103, no. 7, pp. 070504 (4).Google Scholar
- 15.Wilde, M.M., Winter, A., and Yang, D., Strong Converse for the Classical Capacity of Entanglement-Breaking and Hadamard Channels, arXiv:1306.1586v3 [quant-ph], 2013.Google Scholar
- 16.Polyanskiy, Y., Channel Coding: Non-Asymptotic Fundamental Limits, PhD Thesis, Princeton Univ., USA, 2010.Google Scholar
- 17.Winter, A., Compression of Sources of Probability Distributions and Density Operators, arXiv: quant-ph/0208131v1, 2002.Google Scholar
- 18.Bennett, C.H., Devetak, I., Harrow, A.W., Shor, P.W., and Winter, A., Quantum Reverse Shannon Theorem, arXiv:0912.5537 [quant-ph], 2009.Google Scholar
- 19.Berta, M., Brandão, F., Christandl, M., and Wehner, S., Entanglement Cost of Quantum Channels, Proc. 2012 IEEE Int. Sympos. on Information Theory (ISIT’2012), Cambridge, MA, USA, July 1–6, 2012, pp. 900–904.Google Scholar
- 21.Nayak, A., Optimal Lower Bounds for Quantum Automata and Random Access Codes, Proc. 40th Ann. Sympos. on Foundations of Computer Science, New York City, NY, USA, Oct. 17–19, 1999, pp. 369–376. Available at arXiv:quant-ph/9904093.Google Scholar
- 26.Tao, T., Topics in Random Matrix Theory, Providence, R.I.: Amer. Math. Soc., 2012. See also http://terrytao.wordpress.com/2010/01/03/254a-notes-1-concentration-of-measure/.MATHGoogle Scholar