Universal Quantum Information Compression
classification
🪐 quant-ph
keywords
quantumcompressioninformationsourceuniversalblockcompletelycompress
read the original abstract
Suppose that a quantum source is known to have von Neumann entropy less than or equal to S but is otherwise completely unspecified. We describe a method of universal quantum data compression which will faithfully compress the quantum information of any such source to S qubits per signal (in the limit of large block lengths).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.