Strong Converse Exponent for Entanglement-Assisted Communication
arXiv:2209.00555 · doi:10.1109/TIT.2023.3335219
Abstract
We determine the exact strong converse exponent for entanglement-assisted classical communication of a quantum channel. Our main contribution is the derivation of an upper bound for the strong converse exponent which is characterized by the sandwiched Rényi divergence. It turns out that this upper bound coincides with the lower bound of Gupta and Wilde (Commun. Math. Phys. 334:867-887, 2015). Thus, the strong converse exponent follows from the combination of these two bounds. Our result has two implications. Firstly, it implies that the exponential bound for the strong converse property of quantum-feedback-assisted classical communication, derived by Cooney, Mosonyi and Wilde (Commun. Math. Phys. 344:797-829, 2016), is optimal. This answers their open question in the affirmative. Hence, we have determined the exact strong converse exponent for this problem as well. Secondly, due to an observation of Leung and Matthews, it can be easily extended to deal with the transmission of quantum information under the assistance of entanglement or quantum feedback, yielding similar results. The above findings provide, for the first time, a complete operational interpretation to the channel's sandwiched Rényi information of order .
V3: close to published version. V2: minor changes, presentation improved
References in corpus (26)
- On quantum Renyi entropies: a new generalization and some properties
- Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- Post-selection technique for quantum channels with applications to quantum cryptography
- Sandwiched Rényi Divergence Satisfies Data Processing Inequality
- Quantum Reverse Shannon Theorem
- Quantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
- The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing
- Finite blocklength converse bounds for quantum channels
- Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
- Strong converse exponent for classical-quantum channel coding
- One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
- Multiplicativity of completely bounded -norms implies a strong converse for entanglement-assisted capacity
- On the power of PPT-preserving and non-signalling codes
- Multiplicativity of completely bounded p-norms implies a new additivity result
- On the Second-Order Asymptotics for Entanglement-Assisted Communication
- One-shot entanglement-assisted quantum and classical communication
- Universal coding for classical-quantum channel
- Reliability function of general classical-quantum channel
- Quantum Feedback Channels
- Quantum Sphere-Packing Bounds with Polynomial Prefactors
- Applications of position-based coding to classical communication over quantum channels
- Moderate deviation expansion for fully quantum tasks
- Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels