Abstract: We provide a framework for one-shot quantum rate distortion coding, in which the goal is to determine the minimum number of qubits required to compress quantum information as a function of the probability that the distortion incurred upon decompression exceeds some specified level. We obtain a one-shot characterization of the minimum qubit compression size for an entanglement-assisted quantum rate-distortion code in terms of the smooth max-information, a quantity previously employed in the one-shot quantum reverse Shannon theorem. Next, we show how this characterization converges to the known expression for the entanglement-assisted quantum rate distortion function for asymptotically many copies of a memoryless quantum information source. Finally, we give a tight, finite blocklength characterization for the entanglement-assisted minimum qubit compression size of a memoryless isotropic qubit source subject to an average symbol-wise distortion constraint.
Cited in
(9)- On compression rate of quantum autoencoders: control design, numerical and experimental realization
- Efficient quantum information processing via quantum compressions
- Applications of position-based coding to classical communication over quantum channels
- A family of generalized quantum entropies: definition and properties
- Entanglement-assisted private communication over quantum broadcast channels
- Simple one-shot bounds for various source coding problems using smooth Rényi quantities
- Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction
- Slepian-Wolf coding with quantum side information
- Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
This page was built for publication: One-Shot Lossy Quantum Data Compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346208)
