Finite Blocklength Converse Bounds for Quantum Channels
From MaRDI portal
Abstract: We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalise both a classical converse of Polyanskiy, Poor, and Verd'{u} as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular our bound on entanglement-assisted codes is a semidefinite program and for memoryless channels its large blocklength limit is the well known formula for entanglement-assisted capacity due to Bennett, Shor, Smolin and Thapliyal.
Cited in
(16)- Limitations of semidefinite programs for separable states and entangled games
- Thermodynamic implementations of quantum processes
- Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity
- Second-order asymptotics for the classical capacity of image-additive quantum channels
- Correlation detection and an operational interpretation of the Rényi mutual information
- Applications of position-based coding to classical communication over quantum channels
- On the second-order asymptotics for entanglement-assisted communication
- Finite Blocklength and Moderate Deviation Analysis of Hypothesis Testing of Correlated Quantum States and Application to Classical-Quantum Channels With Memory
- Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
- On the near-optimality of one-shot classical communication over quantum channels
- Entanglement-assisted private communication over quantum broadcast channels
- Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Extraction
- Classical capacities of memoryless but not identical quantum channels
- Cone-restricted information theory
- Error exponent of activated non-signaling-assisted classical-quantum channel coding
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
This page was built for publication: Finite Blocklength Converse Bounds for Quantum Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983375)
