Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels

DOI10.1134/S0032946018010015zbMath1457.94082arXiv1506.02228WikidataQ129984846 ScholiaQ129984846MaRDI QIDQ2190914

Mark M. Wilde, Da-wei Ding

Publication date: 23 June 2020

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

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

zbMATH Keywords

quantum channelsquantum entanglement

Mathematics Subject Classification ID

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

Related Items (3)

Rényi relative entropies of quantum Gaussian states ⋮ Optimized quantumf-divergences and data processing ⋮ Recoverability for optimized quantum f-divergences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• On general minimax theorems
• A note on the \(p \rightarrow q\) norms of 2-positive maps
• Strong converse exponent for classical-quantum channel coding
• A continuity property of the entropy density for spin lattice systems
• Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
• Strong Converse for the Classical Capacity of Optical Quantum Communication Channels
• Strong Converse Rates for Quantum Communication
• Inequalities and Separations Among Assisted Capacities of Quantum Channels
• Network Information Theory
• On Feedback and the Classical Capacity of a Noisy Quantum Channel
• Feedback does not affect the reliability function of a DMC at rates above capacity (Corresp.)
• Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
• The capacity of the quantum channel with general signal states
• Coding theorem and strong converse for quantum channels
• Strong converse to the quantum channel coding theorem
• Additivity of the classical capacity of entanglement-breaking quantum channels
• On the Quantum Rényi Relative Entropies and Related Capacity Formulas
• A sharp continuity estimate for the von Neumann entropy
• Multiplicativity ofp-norms of completely positive maps and the additivity problem in quantum information theory
• Entanglement Breaking Channels
• Sandwiched Rényi divergence satisfies data processing inequality
• Monotonicity of a relative Rényi entropy
• On quantum Rényi entropies: A new generalization and some properties
• Conditional expectation in an operator algebra. IV. Entropy and information
• On the converse to the coding theorem for discrete memoryless channels (Corresp.)
• Quantum Information Theory

This page was built for publication: Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels