On Lossless Quantum Data Compression With a Classical Helper
From MaRDI portal
Recommendations
- Lossless quantum data compression and quantum Kolmogorov complexity
- Trading quantum for classical resources in quantum data compression
- Reversible arithmetic coding for quantum data compression
- Lower bound on expected communication cost of quantum Huffman coding
- Compressing quantum mixed-state sources by sending classical information
Cited in
(16)- Efficient and exact quantum compression
- On quantum coding for ensembles of mixed states
- Lossless quantum data compression and quantum Kolmogorov complexity
- Universal quantum information compression and degrees of prior knowledge
- SECOND QUANTIZED KOLMOGOROV COMPLEXITY
- On the Distributed Compression of Quantum Information
- Reversible arithmetic coding for quantum data compression
- A quantum analog of Huffman coding
- On the reversible extraction of classical information from a quantum source
- Compressing quantum mixed-state sources by sending classical information
- Trading quantum for classical resources in quantum data compression
- Lower bound on expected communication cost of quantum Huffman coding
- Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction
- Slepian-Wolf coding with quantum side information
- Ning Cai: a tribute to a pioneering scholar in information theory
- Universal approximation of multi-copy states and universal quantum lossless data compression
This page was built for publication: On Lossless Quantum Data Compression With a Classical Helper
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546467)
