Strong Converse Exponent for Entanglement-Assisted Communication
Ke Li, Yongsheng Yao

TL;DR
This paper precisely determines the strong converse exponent for entanglement-assisted classical communication over quantum channels, establishing the optimal exponential bounds and linking them to sandwiched Rényi divergence, with implications for quantum feedback and information transmission.
Contribution
It derives the exact strong converse exponent for entanglement-assisted communication, confirming the optimality of existing bounds and extending results to quantum feedback scenarios.
Findings
The upper and lower bounds for the strong converse exponent coincide.
The exponential bound for quantum-feedback-assisted communication is proven optimal.
The results provide a complete operational interpretation of the sandwiched Rényi information.
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\'enyi 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
