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

DOI10.1134/S003294601402001XMaRDI QIDQ2262997zbMATH OpenWikidataFDO

Authors Mark M. Wilde, Andreas Winter

Publication date 17 March 2015

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1308.6732

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

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(eta N_S / (1-p)) where p is the code's error probability, eta 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.

Recommendations

• Second-order coding rates for pure-loss bosonic channels
• Classical capacities of bosonic channels
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• General formulas for capacity of classical-quantum channels
• Strong converse for the quantum capacity of the erasure channel for almost all codes

Cites work

• A Resource Framework for Quantum Shannon Theory
• Coding theorem and strong converse for quantum channels
• Elements of Information Theory
• Entanglement Cost of Quantum Channels
• scientific article; zbMATH DE number 6026126 (Why is no real title available?)
• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
• Probability Inequalities for Sums of Bounded Random Variables
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• Strong converse to the quantum channel coding theorem
• The capacity of the quantum channel with general signal states
• The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
• Ultimate information carrying limit of quantum systems
• Unconditional Security From Noisy Quantum Storage

Cited in

(5)

• On quantum conditional entropies defined in terms of the \(F\)-divergences
• Classical capacities of bosonic channels
• Second-order coding rates for pure-loss bosonic channels
• “Pretty Strong” Converse for the Quantum Capacity of Degradable Channels
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy

This page was built for publication: Strong converse for the classical capacity of the pure-loss bosonic channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2262997)