Lossless Quantum Compression
英文摘要：
We describe lossless quantum compression of unknown mixtures (of non-orthogonal states) and give an expression of the optimal rate of compression.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Universal approximation of multi-copy states and universal quantum lossless data compression
We have proven that there exists a quantum state approximating any multi-copy state universally when we measure the error by means of the normalized relative entropy. While the qubit case was proven by Krattenthaler and Slater (IEEE Trans. IT, 46, 801-819 (2000); quant-ph/9612043), the general case has been open for more than ten years. For a deeper analysis, we have solved the mini-max problem concerning `approximation error' up to the second order. Furthermore, we have applied this result to quantum lossless data compression, and have constructed a universal quantum lossless data compression…
quant-ph
Lossless quantum data compression and variable-length coding
In order to compress quantum messages without loss of information it is necessary to allow the length of the encoded messages to vary. We develop a general framework for variable-length quantum messages in close analogy to the classical case and show that lossless compression is only possible if the message to be compressed is known to the sender. The lossless compression of an ensemble of messages is bounded from below by its von-Neumann entropy. We show that it is possible to reduce the number of qbits passing through a quantum channel even below the von-Neumann entropy by adding a classical…
quant-ph
Lossless Quantum Prefix Compression for Communication Channels that are Always Open
We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected base length of the output quantum bit string (the base length of a quantum string is the maximal length in the superposition). This complements work by Schumacher and Westmoreland who calculated the corresponding rate for minimizing the output's average length. Our compressed code words are prefix-free indeterminate-length quantum bit strings which can be concatenated in the case of multiple sources. Therefore, we gen…
quant-ph
Lossless quantum data compression with exponential penalization: an operational interpretation of the quantum Rényi entropy
Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum Rényi entropies. In order to do this, we appeal to a very general quantum encoding scheme that satisfies a quantum version of the Kraft-McMillan inequality. Then, in the standard situation, where one is intended to minimize the usual average length of the quantum codewords, we recover the known results, namely that the von Neumann entropy of the source bounds the average length of the optimal codes. Otherwise, we show that by invoking an exponential averag…
quant-ph
Lossless quantum coding in many-letter spaces
Based on the concept of many-letter theory, an observable is defined measuring the raw quantum information content of single messages. A general characterization of quantum codes using the Kraus representation is given. Compression codes are defined by their property of decreasing the expected raw information content of a given message ensemble. Lossless quantum codes, in contrast to lossy codes, provide the retrieval of the original data with perfect fidelity. A general lossless coding scheme is given that translates between two quantum alphabets. It is shown that this scheme is never compres…
quant-ph
Realization of a quantum autoencoder for lossless compression of quantum data
As a ubiquitous aspect of modern information technology, data compression has a wide range of applications. Therefore, a quantum autoencoder which can compress quantum information into a low-dimensional space is fundamentally important to achieve automatic data compression in the field of quantum information. Such a quantum autoencoder can be implemented through training the parameters of a quantum device using classical optimization algorithms. In this article, we analyze the condition of achieving a perfect quantum autoencoder and theoretically prove that a quantum autoencoder can losslessly…
quant-ph
