Finite blocklength converse bounds for quantum channels

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ú 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.

15 pages, 4 figures (v2: improved notation; one mistake fixed; results unchanged)

References in corpus (6)

• Fundamental bound on the reliability of quantum information transmission
• On the strong converses for the quantum channel capacity theorems
• Experimental implementation of bit commitment in the noisy-storage model
• An Experimental Implementation of Oblivious Transfer in the Noisy Storage Model
• Generalized relative entropies and the capacity of classical-quantum channels
• Construction of extremal local positive operator-valued measures under symmetry

Cited by in corpus (62)

• Quantum Resource Theories
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
• One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
• Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity
• On the power of PPT-preserving and non-signalling codes
• Principles of Quantum Communication Theory: A Modern Approach
• Quantum Coding with Finite Resources
• Application of the Resource Theory of Channels to Communication Scenarios
• Resource theory of asymmetric distinguishability for quantum channels
• Semidefinite programming strong converse bounds for classical capacity
• Quantum Channel Simulation and the Channel's Smooth Max-Information
• Semidefinite programming relaxations for quantum correlations
• Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
• On the Second-Order Asymptotics for Entanglement-Assisted Communication
• Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
• Non-asymptotic entanglement distillation
• Generalized Entropies
• Thermodynamic Capacity of Quantum Processes
• Fundamental work cost of quantum processes
• Semidefinite programming converse bounds for quantum communication
• Optimal Provable Robustness of Quantum Classification via Quantum Hypothesis Testing
• Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
• Extendibility limits the performance of quantum processors
• Applications of position-based coding to classical communication over quantum channels
• Upper bounds on secret key agreement over lossy thermal bosonic channels
• On converse bounds for classical communication over quantum channels
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification
• Entanglement-assisted private communication over quantum broadcast channels
• Optimal estimation and discrimination of excess noise in thermal and amplifier channels
• The Communication Value of a Quantum Channel
• On the near-optimality of one-shot classical communication over quantum channels
• Macroscopic Thermodynamic Reversibility in Quantum Many-Body Systems
• One-shot quantum error correction of classical and quantum information
• Moderate deviation expansion for fully quantum tasks
• Limitations of semidefinite programs for separable states and entangled games
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
• Dynamical Landauer Principle: Quantifying Information Transmission by Thermodynamics
• Thermodynamic Implementations of Quantum Processes
• Efficient methods for one-shot quantum communication
• Communication Complexity of One-Shot Remote State Preparation
• Finite-Length Analyses for Source and Channel Coding on Markov Chains
• Entanglement-assisted capacities of compound quantum channels
• A hypothesis testing approach for communication over entanglement assisted compound quantum channel
• Superadditivity of Quantum Channel Coding Rate with Finite Blocklength Joint Measurements
• Multiple Quantum Hypothesis Testing Expressions and Classical-Quantum Channel Converse Bounds
• Trade-offs on number and phase shift resilience in bosonic quantum codes
• Cone-Restricted Information Theory
• Noisy quantum state redistribution with promise and the Alpha-bit
• How Deep the Theory of Quantum Communications Goes: Superadditivity, Superactivation and Causal Activation
• One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
• Strong Converse Exponent for Entanglement-Assisted Communication
• Optimal one-shot entanglement sharing
• Quantum channel coding: Approximation algorithms and strong converse exponents
• Extendible quantum measurements and limitations on classical communication
• State-adaptive quantum error correction and fault-tolerant quantum computing
• Quantum hypothesis testing via robust quantum control
• Expected communication cost of distributed quantum tasks
• Minimizing Quantum Renyi Divergences via Mirror Descent with Polyak Step Size
• Classical capacities of memoryless but not identical quantum channels
• A Minimax Converse for Quantum Channel Coding
• Information storage and transmission under Markovian noise