Finite Blocklength Converse Bounds for Quantum Channels
From MaRDI portal
Publication:2983375
DOI10.1109/TIT.2014.2353614zbMath1360.81097arXiv1210.4722WikidataQ62109091 ScholiaQ62109091MaRDI QIDQ2983375
William Matthews, Stephanie Wehner
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.4722
Related Items (12)
On the second-order asymptotics for entanglement-assisted communication ⋮ Amortized entanglement of a quantum channel and approximately teleportation-simulable channels ⋮ On the near-optimality of one-shot classical communication over quantum channels ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Classical capacities of memoryless but not identical quantum channels ⋮ Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity ⋮ Thermodynamic implementations of quantum processes ⋮ Entanglement-assisted private communication over quantum broadcast channels ⋮ Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy ⋮ Correlation detection and an operational interpretation of the Rényi mutual information ⋮ Applications of position-based coding to classical communication over quantum channels ⋮ Second-order asymptotics for the classical capacity of image-additive quantum channels
This page was built for publication: Finite Blocklength Converse Bounds for Quantum Channels
