Strong converse exponents for the feedback-assisted classical capacity of entanglement-breaking channels
arXiv:1506.02228 · doi:10.1134/S0032946018010015
Abstract
Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by such entangled encoding schemes, but this is not always the case. In this paper, we prove that a strong converse theorem holds for the classical capacity of an entanglement-breaking channel even when it is assisted by a classical feedback link from the receiver to the transmitter. In doing so, we identify a bound on the strong converse exponent, which determines the exponentially decaying rate at which the success probability tends to zero, for a sequence of codes with communication rate exceeding capacity. Proving a strong converse, along with an achievability theorem, shows that the classical capacity is a sharp boundary between reliable and unreliable communication regimes. One of the main tools in our proof is the sandwiched Renyi relative entropy. The same method of proof is used to derive an exponential bound on the success probability when communicating over an arbitrary quantum channel assisted by classical feedback, provided that the transmitter does not use entangled encoding schemes.
arXiv comment24 pages, 2 figures, v4: final version accepted for publication in Problems of Information Transmission
References in corpus (21)
- On quantum Renyi entropies: a new generalization and some properties
- General Entanglement Breaking Channels
- Superadditivity of communication capacity using entangled inputs
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- From Classical to Quantum Shannon Theory
- Coding Theorem and Strong Converse for Quantum Channels
- A Sharp Fannes-type Inequality for the von Neumann Entropy
- Sandwiched Rényi Divergence Satisfies Data Processing Inequality
- Monotonicity of a relative Rényi entropy
- Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
- Strong Converse to the Quantum Channel Coding Theorem
- Additivity of the Classical Capacity of Entanglement-Breaking Quantum Channels
- On the quantum Renyi relative entropies and related capacity formulas
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- A strong converse for classical channel coding using entangled inputs
- Strong converse exponent for classical-quantum channel coding
- Trade-off capacities of the quantum Hadamard channels
- Strong converse rates for quantum communication
- Extensive nonadditivity of privacy
- Quantum-correlation breaking channels, broadcasting scenarios, and finite Markov chains
- Strong converse for the classical capacity of optical quantum communication channels
Cited by in corpus (10)
- Converse bounds for private communication over quantum channels
- Optimized quantum f-divergences and data processing
- Renyi relative entropies of quantum Gaussian states
- Computable Rényi mutual information: Area laws and correlations
- Recoverability for optimized quantum -divergences
- Quantum reading capacity: General definition and bounds
- Bounding the forward classical capacity of bipartite quantum channels
- Communication Complexity of One-Shot Remote State Preparation
- Postselected communication over quantum channels
- Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback