Efficient and exact quantum compression
From MaRDI portal
Publication:2373873
Recommendations
- Reversible arithmetic coding for quantum data compression
- Universal quantum information compression and degrees of prior knowledge
- Efficient quantum information processing via quantum compressions
- Quantum compression relative to a set of measurements
- On Lossless Quantum Data Compression With a Classical Helper
Cites work
- scientific article; zbMATH DE number 3692653 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 799789 (Why is no real title available?)
- scientific article; zbMATH DE number 872526 (Why is no real title available?)
- A New Proof of the Quantum Noiseless Coding Theorem
- A quantum analog of Huffman coding
- Ensemble-Dependent Bounds for Accessible Information in Quantum Mechanics
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum computational networks
- Reduction of Quantum Entropy by Reversible Extraction of Classical Information
- Time/Space Trade-Offs for Reversible Computation
Cited in
(7)- Efficient quantum information processing via quantum compressions
- Near-optimal extractors against quantum storage
- Compression of quantum information
- Compression for Quantum Population Coding
- Quantum compression relative to a set of measurements
- Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction
- Reversible arithmetic coding for quantum data compression
This page was built for publication: Efficient and exact quantum compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373873)