Quantum Rate-Distortion Coding of Relevant Information
arXiv:1704.02903 · doi:10.1109/TIT.2018.2878412
Abstract
Rate-distortion theory provides bounds for compressing data produced by an information source to a specified encoding rate that is strictly less than the source's entropy. This necessarily entails some loss, or distortion, between the original source data and the best approximation after decompression. The so-called Information Bottleneck Method is designed to compress only `relevant' information. Which information is relevant is determined by the correlation between the data being compressed and a variable of interest, so-called side information. In this paper, an Information Bottleneck Method is introduced for the compression of quantum data. The channel communication picture is used for compression and decompression. The rate of compression is derived using an entanglement assisted protocol with classical communication, and under an unproved conjecture that the rate function is convex in the distortion parameter. The optimum channel achieving this rate for a given input state is characterised. The conceptual difficulties arising due to differences in the mathematical formalism between quantum and classical probability theory are discussed and solutions are presented.
References in corpus (10)
- The information bottleneck method
- Negative entropy and information in quantum mechanics
- Quantum Reverse Shannon Theorem
- The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
- Quantum rate distortion, reverse Shannon theorems, and source-channel separation
- Compression of sources of probability distributions and density operators
- A triangle of dualities: reversibly decomposable quantum channels, source-channel duality, and time reversal
- One-shot lossy quantum data compression
- Quantum rate distortion coding with auxiliary resources
- Quantum Predictive Filtering
Cited by in corpus (13)
- Generalization in Quantum Machine Learning: a Quantum Information Perspective
- The Quantum Wasserstein Distance of Order 1
- Quantum optimal transport with quantum channels
- Convexity and Operational Interpretation of the Quantum Information Bottleneck Function
- Optimal Renormalization Group Transformation from Information Theory
- Distributed Compression of Correlated Classical-Quantum Sources or: The Price of Ignorance
- Efficient algorithms for quantum information bottleneck
- Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
- Strong converse bounds in quantum network information theory: distributed hypothesis testing and source coding
- The Wasserstein distance of order 1 for quantum spin systems on infinite lattices
- Directed Data-Processing Inequalities for Systems with Feedback
- Generalized quantum Arimoto-Blahut algorithm and its application to quantum information bottleneck
- From Quantum Source Compression to Quantum Thermodynamics