Strong Converse to the Quantum Channel Coding Theorem

Abstract

A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept for the difficulty due to non-commutativity.

LaTeX, 11 pages, submitted to IEEE Trans. Inform. Theory

References in corpus (1)

• Coding Theorem and Strong Converse for Quantum Channels

Cited by in corpus (94)

• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Theory of the phase transition in random unitary circuits with measurements
• Coding Theorem and Strong Converse for Quantum Channels
• Fundamental rate-loss tradeoff for optical quantum key distribution
• Quantum channels and memory effects
• Quantum Reverse Shannon Theorem
• Quantum channels and their entropic characteristics
• On the quantum Renyi relative entropies and related capacity formulas
• On the strong converses for the quantum channel capacity theorems
• Fundamental bound on the reliability of quantum information transmission
• Coding Theorems of Quantum Information Theory
• A strong converse for classical channel coding using entangled inputs
• Strong converse exponent for classical-quantum channel coding
• Probabilistic distillation of quantum coherence
• Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity
• Renyi generalizations of the conditional quantum mutual information
• Quantum secure direct communication with private dense coding using general preshared quantum state
• Entanglement Cost of Quantum Channels
• Application of the Resource Theory of Channels to Communication Scenarios
• Strong converse rates for quantum communication
• Semidefinite programming strong converse bounds for classical capacity
• The structure of Renyi entropic inequalities
• Geometric measures of quantum correlations: characterization, quantification, and comparison by distances and operations
• Semidefinite programming relaxations for quantum correlations
• Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
• Ultimate limits for multiple quantum channel discrimination
• Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
• A smooth entropy approach to quantum hypothesis testing and the classical capacity of quantum channels
• Semidefinite programming converse bounds for quantum communication
• Entanglement-enhanced testing of multiple quantum hypotheses
• Sequential projective measurements for channel decoding
• Achieving the Holevo bound via sequential measurements
• Moderate deviation analysis for classical communication over quantum channels
• Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on the maximum overlap problem using directional iterates
• Entanglement transmission and generation under channel uncertainty: Universal quantum channel coding
• Testing product states, quantum Merlin-Arthur games and tensor optimisation
• Strong converse theorems using Rényi entropies
• On Quantum Capacity of Compound Channels
• Renyi relative entropies of quantum Gaussian states
• "Pretty strong" converse for the quantum capacity of degradable channels
• Rényi generalizations of quantum information measures
• Non-Asymptotic Classical Data Compression with Quantum Side Information
• Encoding classical information into quantum resources
• Approximate simulation of quantum channels
• Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions
• Multi-Phase Hadamard receivers for classical communication on lossy bosonic channels
• Strong converse for the classical capacity of the pure-loss bosonic channel
• Selfcomplementary quantum channels
• Coding theorems for compound problems via quantum Rényi divergences
• Secure and Robust Identification via Classical-Quantum Channels
• Classical Capacities of Averaged and Compound Quantum Channels
• On the mass of static metrics with positive cosmological constant -- II
• Quantum reverse hypercontractivity: its tensorization and application to strong converses
• Achieving the Holevo bound via a bisection decoding protocol
• Sandwiched Rényi Convergence for Quantum Evolutions
• Using post-measurement information in state discrimination
• The capacity of coherent-state adaptive decoders with interferometry and single-mode detectors
• Reversibility of quantum resources through probabilistic protocols
• Strong converse exponents for the feedback-assisted classical capacity of entanglement-breaking channels
• Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
• Strong converse rates for classical communication over thermal and additive noise bosonic channels
• New general lower and upper bounds under minimum-error quantum state discrimination
• Idler-free channel position finding
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates
• On the Concavity of Auxiliary Function in Classical-Quantum Channels
• Refined Strong Converse for the Constant Composition Codes
• The invalidity of a strong capacity for a quantum channel with memory
• Reliability Function of Classical-Quantum Channels
• Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach
• A constructive commutative quantum Lovasz Local Lemma, and beyond
• Quantum resource theory of coding for error correction
• Strong converse for the classical capacity of optical quantum communication channels
• Strong Converse for Identification via Quantum Channels
• "Pretty strong" converse for the private capacity of degraded quantum wiretap channels
• Optimal lower bounds for Quantum Learning via Information Theory
• Quantum and Classical Message Identification via Quantum Channels
• Strong converse for the quantum capacity of the erasure channel for almost all codes
• Rigidity of superdense coding
• One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
• Ergodic Classical-Quantum Channels: Structure and Coding Theorems
• A strong converse for the quantum state merging protocol
• Quantum channel position finding using single photons
• Quantum channel coding: Approximation algorithms and strong converse exponents
• Analytical calculation formulas for capacities of classical and classical-quantum channels
• On the distinguishability of geometrically uniform quantum states
• Performances of Block Codes Attaining the Expurgated and Cutoff Rate Lower Bounds on the Error Exponent of Binary Classical-Quantum Channels
• Convexity properties of the quantum Rényi divergences, with applications to the quantum Stein's lemma
• Decoding Protocols for Classical Communication on Quantum Channels
• An additive refinement of quantum channel capacities
• Permutation Enhances Classical Communication Assisted by Entangled States
• On trace inequalities and their applications to noncommutative communication theory
• Identification via Quantum Channels in the Presence of Prior Correlation and Feedback
• The strong converse theorem for the product-state capacity of quantum channels with ergodic Markovian memory