Strong converse for the classical capacity of the pure-loss bosonic channel

Abstract

This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in [Giovannetti et al., Physical Review Letters 92, 027902 (2004), arXiv:quant-ph/0308012]. 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 N_S, then it is possible to respect this constraint with a code that operates at a rate g(ηN_S / (1-p)) where p is the code's error probability, η is the channel transmissivity, and g(x) is the entropy of a bosonic thermal state with mean photon number x. We then 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 n N_S, 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.

18 pages, 1 figure; accepted for publication in Problems of Information Transmission

References in corpus (2)

• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Coding Theorem and Strong Converse for Quantum Channels

Cited by in corpus (14)

• Semidefinite programming strong converse bounds for classical capacity
• Strong converse rates for quantum communication
• Semidefinite programming converse bounds for quantum communication
• Continuous-Variable Protocol for Oblivious Transfer in the Noisy-Storage Model
• Strong converse rates for classical communication over thermal and additive noise bosonic channels
• Quantum communication on the bosonic loss-dephasing channel
• Second-order coding rates for pure-loss bosonic channels
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
• Quantum-optical channels that output only classical states
• Strong converse for the classical capacity of optical quantum communication channels
• On quantum conditional entropies defined in terms of the $f$-divergences
• Strong converse for the quantum capacity of the erasure channel for almost all codes
• Bosonic data hiding: power of linear vs non-linear optics
• An upper bound on quantum capacity of unital channels