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

DOI10.1134/S003294601402001XzbMath1321.94026arXiv1308.6732WikidataQ57521884 ScholiaQ57521884MaRDI QIDQ2262997

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

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

Related Items (2)

Second-order coding rates for pure-loss bosonic channels ⋮ On quantum conditional entropies defined in terms of the \(F\)-divergences

Cites Work

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

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