Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels

Abstract

Achievability in information theory refers to demonstrating a coding strategy that accomplishes a prescribed performance benchmark for the underlying task. In quantum information theory, the crafted Hayashi-Nagaoka operator inequality is an essential technique in proving a wealth of one-shot achievability bounds since it effectively resembles a union bound in various problems. In this work, we show that the pretty-good measurement naturally plays a role as the union bound as well. A judicious application of it considerably simplifies the derivation of one-shot achievability for classical-quantum (c-q) channel coding via an elegant three-line proof. The proposed analysis enjoys the following favorable features. (i) The established one-shot bound admits a closed-form expression as in the celebrated Holevo-Helstrom Theorem. Namely, the error probability of sending $M$ messages through a c-q channel is upper bounded by the minimum error of distinguishing the joint channel input-output state against $(M-1)$ decoupled products states. (ii) Our bound directly yields asymptotic results in the large deviation, small deviation, and moderate deviation regimes in a unified manner. (iii) The coefficients incurred in applying the Hayashi-Nagaoka operator inequality are no longer needed. Hence, the derived one-shot bound sharpens existing results relying on the Hayashi-Nagaoka operator inequality. In particular, we obtain the tightest achievable $\epsilon$-one-shot capacity for c-q channel coding heretofore, improving the third-order coding rate in the asymptotic scenario. (iv) Our result holds for infinite-dimensional Hilbert space. (v) The proposed method applies to deriving one-shot achievability for classical data compression with quantum side information, entanglement-assisted classical communication over quantum channels, and various quantum network information-processing protocols.

arXiv commentv2: Introduction revised

References in corpus (70)

• On quantum Renyi entropies: a new generalization and some properties
• The operational meaning of min- and max-entropy
• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• The Quantum Chernoff Bound
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Min- and Max- Relative Entropies and a New Entanglement Monotone
• From Classical to Quantum Shannon Theory
• Coding Theorem and Strong Converse for Quantum Channels
• Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• Leftover Hashing Against Quantum Side Information
• One-Shot Classical-Quantum Capacity and Hypothesis Testing
• Reversing quantum dynamics with near-optimal quantum and classical fidelity
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
• Asymptotic Error Rates in Quantum Hypothesis Testing
• Quantum Reverse Shannon Theorem
• Monotonicity of a relative Rényi entropy
• The Chernoff lower bound for symmetric quantum hypothesis testing
• Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
• Quantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
• Strong Converse to the Quantum Channel Coding Theorem
• Second-order asymptotics for quantum hypothesis testing
• One-shot decoupling
• An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses
• Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
• Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing
• Classical data compression with quantum side information
• Quantum broadcast channels
• Fundamental bound on the reliability of quantum information transmission
• On the strong converses for the quantum channel capacity theorems
• Finite blocklength converse bounds for quantum channels
• On entanglement-assisted classical capacity
• Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
• The Capacity of the Quantum Multiple Access Channel
• Strong converse exponent for classical-quantum channel coding
• One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
• Quantum message compression with applications
• Fast matrix multiplication is stable
• A father protocol for quantum broadcast channels
• One-Shot Classical Data Compression with Quantum Side Information and the Distillation of Common Randomness or Secret Keys
• Quantum algorithm for Petz recovery channels and pretty good measurements
• Tight exponential analysis of universally composable privacy amplification and its applications
• Lower bounds on the Probability of Error for Classical and Classical-Quantum Channels
• Quantum Hypothesis Testing and Non-Equilibrium Statistical Mechanics
• 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
• One-shot entanglement-assisted quantum and classical communication
• Discriminating quantum states: the multiple Chernoff distance
• Position-based coding and convex splitting for private communication over quantum channels
• Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information
• Quantum Achievability Proof via Collision Relative Entropy
• Quantum union bounds for sequential projective measurements
• Moderate deviation analysis for classical communication over quantum channels
• Achieving the Holevo bound via sequential measurements
• Quantum Sphere-Packing Bounds with Polynomial Prefactors
• Applications of position-based coding to classical communication over quantum channels
• Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination
• Classical codes for quantum broadcast channels
• Non-Asymptotic Classical Data Compression with Quantum Side Information
• Sequential decoding of a general classical-quantum channel
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification
• Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions
• Generalized teleportation and entanglement recycling
• Hadamard quantum broadcast channels
• Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d. - quantum lattice systems and more
• Union bound for quantum information processing
• On the near-optimality of one-shot classical communication over quantum channels
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
• Better bounds on optimal measurement and entanglement recovery, with applications to uncertainty and monogamy relations

Cited by in corpus (6)

• Reliability Function of Classical-Quantum Channels
• Teleportation with Embezzling Catalysts
• Lower Bounds on Error Exponents via a New Quantum Decoder
• Strong Converse Exponent for Entanglement-Assisted Communication
• Communication with Quantum Catalysts
• Tight relations and equivalences between smooth relative entropies