Non-Asymptotic Classical Data Compression with Quantum Side Information
arXiv:1803.07505 · doi:10.1109/TIT.2020.3038517
Abstract
In this paper, we analyze classical data compression with quantum side information (also known as the classical-quantum Slepian-Wolf protocol) in the so-called large and moderate deviation regimes. In the non-asymptotic setting, the protocol involves compressing classical sequences of finite length and decoding them with the assistance of quantum side information. In the large deviation regime, the compression rate is fixed, and we obtain bounds on the error exponent function, which characterizes the minimal probability of error as a function of the rate. Devetak and Winter showed that the asymptotic data compression limit for this protocol is given by a conditional entropy. For any protocol with a rate below this quantity, the probability of error converges to one asymptotically and its speed of convergence is given by the strong converse exponent function. We obtain finite blocklength bounds on this function, and determine exactly its asymptotic value. In the moderate deviation regime for the compression rate, the latter is no longer considered to be fixed. It is allowed to depend on the blocklength , but assumed to decay slowly to the asymptotic data compression limit. Starting from a rate above this limit, we determine the speed of convergence of the error probability to zero and show that it is given in terms of the conditional information variance. Our results complement earlier results obtained by Tomamichel and Hayashi, in which they analyzed the so-called small deviation regime of this protocol.
45 pages, 3 figures; v2 added reference [23] (prior work on strong converse exponent lower bounds); v3 fixed typos and added comparisons with reference [23]
References in corpus (38)
- On quantum Renyi entropies: a new generalization and some properties
- The Quantum Chernoff Bound
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- From Classical to Quantum Shannon Theory
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- One-Shot Classical-Quantum Capacity and Hypothesis Testing
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- Asymptotic Error Rates in Quantum Hypothesis Testing
- Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
- Strong Converse to the Quantum Channel Coding Theorem
- Second-order asymptotics for quantum hypothesis testing
- On the Dispersions of Three Network Information Theory Problems
- Classical data compression with quantum side information
- On the strong converses for the quantum channel capacity theorems
- Fundamental bound on the reliability of quantum information transmission
- Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
- Strong converse exponent for classical-quantum channel coding
- Relating different quantum generalizations of the conditional Renyi entropy
- One-Shot Classical Data Compression with Quantum Side Information and the Distillation of Common Randomness or Secret Keys
- Lower bounds on the Probability of Error for Classical and Classical-Quantum Channels
- The Church of the Symmetric Subspace
- Universal coding for classical-quantum channel
- Reliability function of general classical-quantum channel
- A smooth entropy approach to quantum hypothesis testing and the classical capacity of quantum channels
- Sine distance for quantum states
- Moderate deviation analysis for classical communication over quantum channels
- Quantum Sphere-Packing Bounds with Polynomial Prefactors
- Finite-length Analysis on Tail probability for Markov Chain and Application to Simple Hypothesis Testing
- Investigating Properties of a Family of Quantum Renyi Divergences
- Strong converse theorems using Rényi entropies
- Quantum state discrimination bounds for finite sample size
- Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
- Quantum Convex Support
- Refined Strong Converse for the Constant Composition Codes
- On the Concavity of Auxiliary Function in Classical-Quantum Channels
- Strong converse bounds in quantum network information theory: distributed hypothesis testing and source coding
- Strong Converse for Classical-Quantum Degraded Broadcast Channels
Cited by in corpus (12)
- Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification
- Properties of Noncommutative Renyi and Augustin Information
- Moderate deviation expansion for fully quantum tasks
- Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
- Duality between source coding with quantum side information and c-q channel coding
- Reliability Function of Quantum Information Decoupling via the Sandwiched Rényi Divergence
- Reliable Simulation of Quantum Channels: the Error Exponent
- Tight lower bound on the error exponent of classical-quantum channels
- Achievable error exponents of data compression with quantum side information and communication over symmetric classical-quantum channels
- Lower Bounds on Error Exponents via a New Quantum Decoder
- Minimizing Quantum Renyi Divergences via Mirror Descent with Polyak Step Size
- Equivalence of three classical algorithms with quantum side information: Privacy amplification, error correction, and data compression