Strong converse rates for classical communication over thermal and additive noise bosonic channels
arXiv:1312.3287 · doi:10.1103/PhysRevA.89.022302
Abstract
We prove that several known upper bounds on the classical capacity of thermal and additive noise bosonic channels are actually strong converse rates. Our results strengthen the interpretation of these upper bounds, in the sense that we now know that the probability of correctly decoding a classical message rapidly converges to zero in the limit of many channel uses if the communication rate exceeds these upper bounds. In order for these theorems to hold, we need to impose a maximum photon number constraint on the states input to the channel (the strong converse property need not hold if there is only a mean photon number constraint). Our first theorem demonstrates that Koenig and Smith's upper bound on the classical capacity of the thermal bosonic channel is a strong converse rate, and we prove this result by utilizing the structural decomposition of a thermal channel into a pure-loss channel followed by an amplifier channel. Our second theorem demonstrates that Giovannetti et al.'s upper bound on the classical capacity of a thermal bosonic channel corresponds to a strong converse rate, and we prove this result by relating success probability to rate, the effective dimension of the output space, and the purity of the channel as measured by the Renyi collision entropy. Finally, we use similar techniques to prove that similar previously known upper bounds on the classical capacity of an additive noise bosonic channel correspond to strong converse rates.
arXiv commentAccepted for publication in Physical Review A; minor changes in the text and few references
References in corpus (21)
- Gaussian Quantum Information
- 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
- Classical capacity of the lossy bosonic channel: the exact solution
- Quantum channels and their entropic characteristics
- Strong Converse to the Quantum Channel Coding Theorem
- Unconditional security from noisy quantum storage
- One-mode Bosonic Gaussian channels: a full weak-degradability classification
- Minimum output entropy of bosonic channels: a conjecture
- A solution of the Gaussian optimizer conjecture
- A strong converse for classical channel coding using entangled inputs
- Majorization theory approach to the Gaussian channel minimum entropy conjecture
- The entropy power inequality for quantum systems
- Minimum Renyi and Wehrl entropies at the output of bosonic channels
- Limits on classical communication from quantum entropy power inequalities
- The classical capacity of quantum thermal noise channels to within 1.45 bits
- Strong converse for the classical capacity of the pure-loss bosonic channel
- Electromagnetic channel capacity for practical purposes
- On the classical capacity of quantum Gaussian channels
- Effective field theory and fundamental interactions
- Universally composable privacy amplification against quantum adversaries
Cited by in corpus (6)
- Parameter regimes for a single sequential quantum repeater
- Continuous-Variable Protocol for Oblivious Transfer in the Noisy-Storage Model
- Energy-constrained two-way assisted private and quantum capacities of quantum channels
- Second-order coding rates for pure-loss bosonic channels
- Conditional quantum entropy power inequality for -level quantum systems
- Strong converse for the classical capacity of optical quantum communication channels