Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0009073

Lossless quantum coding in many-letter spaces

Kim Joris Boström

Published Jan 1, 2008• 3 citations
arXivHTMLPDF

Abstract

Based on the concept of many-letter theory a general characterization of quantum codes using the Kraus representation is given. Compression codes are defined by their property of decreasing the average information content of a given a priori message ensemble. Lossless quantum codes, in contrast to lossy codes, provide the retrieval of the original input states with perfect fidelity. A general lossless coding scheme is given that translates between two quantum alphabets. It is shown that this scheme is never compressive. Furthermore, a lossless quantum coding scheme, analog to the classical Huffman scheme but different from the Braunstein scheme, is implemented, which provides optimal compression. Motivated by the concept of lossless quantum compression, an observable is defined that measures the amount of compressible quantum information contained in a particular message with respect to a given \\emph{a priori} message ensemble. The average of this observable yields the von Neumann entropy, which is finally established as the amount of compressible quantum information of any message ensemble, confirming its commonly assigned meaning.

Related papers

Lossless quantum data compression and variable-length coding

Kim Joris Boström, Timo Felbinger

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 side channel. We give an explicit communication protocol that realizes lossless and instantaneous quantum data compression and apply it to a simple example. This protocol can be used for both online quantum communication and storage of quantum data.

arXiv:quant-ph/0105026•Physical Review A•Feb 20, 2002•37 citations

On Lossless Quantum Data Compression and Quantum Variable–Length Codes

Rudolf Ahlswede, Ning Cai

This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References

Quantum Information Processing•Feb 21, 2003•2 citations

On Lossless Quantum Data Compression and Quantum Variable‐Length Codes

Rudolf Ahlswede, Ning Cai

This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References

Quantum Information Processing•Feb 17, 2005•0 citations

Classical information capacity of a quantum channel

Paul A. Hausladen, Richard Jozsa, Benjamin W. Schumacher +2 more

We consider the transmission of classical information over a quantum channel. The channel is defined by an ``alphabet'' of quantum states, e.g., certain photon polarizations, together with a specified set of probabilities with which these states must be sent. If the receiver is restricted to making separate measurements on the received ``letter'' states, then the Kholevo theorem implies that the amount of information transmitted per letter cannot be greater than the von Neumann entropy H of the letter ensemble. In fact the actual amount of transmitted information will usually be significantly less than H. We show, however, that if the sender uses a block coding scheme consisting of a choice of code words that respects the a priori probabilities of the letter states, and the receiver distinguishes whole words rather than individual letters, then the information transmitted per letter can be made arbitrarily close to H and never exceeds H. This provides a precise information-theoretic interpretation of von Neumann entropy in quantum mechanics. We apply this result to ``superdense'' coding, and we consider its extension to noisy channels. \textcopyright{} 1996 The American Physical Society.

Physical Review A•Sep 1, 1996•491 citations

Lossless quantum data compression with exponential penalization: an operational interpretation of the quantum Rényi entropy

Guido Bellomo, G. M. Bosyk, Federico Holik +1 more

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 average length, related to an exponential penalization over large codewords, the quantum Rényi entropies arise as the natural quantities relating the optimal encoding schemes with the source description, playing an analogous role to that of von Neumann entropy.

arXiv:1710.01513•Scientific Reports•Nov 1, 2017•6 citations

Optimality in quantum data compression using dynamical entropy

George Androulakis, Duncan Wright

In this article we study lossless compression of strings of pure quantum states of indeterminate-length quantum codes which were introduced by Schumacher and Westmoreland. Past work has assumed that the strings of quantum data are prepared to be encoded in an independent and identically distributed way. We discuss the notion of quantum stochastic ensembles, allowing us to consider strings of quantum states prepared in a general way. For any quantum stochastic ensemble we define an associated quantum dynamical system and prove that the optimal average codeword length via lossless coding is equal to the quantum dynamical entropy of the associated quantum dynamical system.

arXiv:1904.05402•Physical Review A•Sep 3, 2019•3 citations
Based on the concept of many-letter theory a general characterization of quantum codes using the Kraus representation is given. Compression codes are defined by their property of decreasing the average information content of a given a priori message ensemble. Lossless quantum codes, in contrast to lossy codes, provide the retrieval of the original input states with perfect fidelity. A general lossless coding scheme is given that translates between two quantum alphabets. It is shown that this scheme is never compressive. Furthermore, a lossless quantum coding scheme, analog to the classical Huffman scheme but different from the Braunstein scheme, is implemented, which provides optimal compression. Motivated by the concept of lossless quantum compression, an observable is defined that measures the amount of compressible quantum information contained in a particular message with respect to a given \emph{a priori} message ensemble. The average of this observable yields the von Neumann entropy, which is finally established as the amount of compressible quantum information of any message ensemble, confirming its commonly assigned meaning.
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 side channel. We give an explicit communication protocol that realizes lossless and instantaneous quantum data compression and apply it to a simple example. This protocol can be used for both online quantum communication and storage of quantum data.
This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References
This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References
We consider the transmission of classical information over a quantum channel. The channel is defined by an ``alphabet'' of quantum states, e.g., certain photon polarizations, together with a specified set of probabilities with which these states must be sent. If the receiver is restricted to making separate measurements on the received ``letter'' states, then the Kholevo theorem implies that the amount of information transmitted per letter cannot be greater than the von Neumann entropy H of the letter ensemble. In fact the actual amount of transmitted information will usually be significantly less than H. We show, however, that if the sender uses a block coding scheme consisting of a choice of code words that respects the a priori probabilities of the letter states, and the receiver distinguishes whole words rather than individual letters, then the information transmitted per letter can be made arbitrarily close to H and never exceeds H. This provides a precise information-theoretic interpretation of von Neumann entropy in quantum mechanics. We apply this result to ``superdense'' coding, and we consider its extension to noisy channels. \textcopyright{} 1996 The American Physical Society.
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 average length, related to an exponential penalization over large codewords, the quantum Rényi entropies arise as the natural quantities relating the optimal encoding schemes with the source description, playing an analogous role to that of von Neumann entropy.
In this article we study lossless compression of strings of pure quantum states of indeterminate-length quantum codes which were introduced by Schumacher and Westmoreland. Past work has assumed that the strings of quantum data are prepared to be encoded in an independent and identically distributed way. We discuss the notion of quantum stochastic ensembles, allowing us to consider strings of quantum states prepared in a general way. For any quantum stochastic ensemble we define an associated quantum dynamical system and prove that the optimal average codeword length via lossless coding is equal to the quantum dynamical entropy of the associated quantum dynamical system.