Lossless quantum prefix compression for communication channels that are always open

  title={Lossless quantum prefix compression for communication channels that are always open},
  author={Markus P. Mueller and Caroline Rogers and Rajagopal Nagarajan},
  journal={Physical Review A},
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… 

Figures from this paper

Lossless quantum data compression with exponential penalization: an operational interpretation of the quantum Rényi entropy
It is shown 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.
Optimality in Quantum Data Compression using Dynamical Entropy
This article studies lossless compression of strings of pure quantum states of indeterminate-length quantum codes which were introduced by Schumacher and Westmoreland and discusses the notion of quantum stochastic ensembles, allowing it to be proved that the optimal average codeword length via lossless coding is equal to the quantum dynamical entropy of the associated Quantum dynamical system.
Quantum Rate Distortion, Reverse Shannon Theorems, and Source-Channel Separation
This paper proves that the quantum rate-distortion function is given in terms of the regularized entanglement of purification, and establishes several quantum source-channel separation theorems in theEntanglement-assisted setting, in which a necessary and sufficient condition for transmitting a memoryless source over aMemoryless quantum channel up to a given distortion.
Lossless quantum data compression and quantum Kolmogorov complexity
We show that the optimal rate of lossless quantum data compression is closely related to Berthiaume, van Dam and Laplante's quantum Kolmogorov complexity. We show that: • The expected quantum


Lossless quantum data compression and variable-length coding
A general framework for variable-length quantum messages is developed in close analogy to the classical case and it is shown 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.
On lossless quantum data compression with a classical helper
It turned out that the optimal compression can always be achieved by a code obtained by this scheme and a von Neumann entropy lower bound to rates of these codes and a necessary and sufficient condition to achieve the bound are obtained.
Reversible arithmetic coding for quantum data compression
A simple-to-implement quantum algorithm for projecting, with high probability, the block quantum state onto the typical subspace spanned by the lending eigenstates of its density matrix is presented.
Trading quantum for classical resources in quantum data compression
This theorem provides a type of dual to Holevo's theorem, insofar as the latter characterizes the cost of coding classical bits into qubits.
Energy requirements for quantum data compression and 1-1 coding
It is shown that when using variable length codes the classical notions of prefix or uniquely decipherable codes are unnecessarily restrictive given the structure of quantum mechanics and that a 1-1 mapping is sufficient.
Quantum information is incompressible without errors.
This work generalizes this variable-length and faithful scenario to the general quantum source producing mixed states rho(i) with probability p(i), and finds the optimal compression rate in the limit of large block length differs from the one in the fixed- length and asymptotically faithful scenario.
A quantum analog of huffman coding
A Huffman-coding inspired scheme for quantum data compression that can be made to be polynomial in log N by a massively parallel implementation of a quantum gate array is constructed.
Indeterminate-length quantum coding
Indeterminate-length quantum codes, in which code words may exist in superpositions of different lengths, provide an alternate approach to quantum data compression and are explored in this paper.
Quantum universal variable-length source coding
An optimal quantum universal variable-length code that achieves the admissible minimum rate is constructed and is used for any probability distribution of quantum states.
On feedback and the classical capacity of a noisy quantum channel
The use of classical feedback is shown to provide no increase in the unassisted classical capacity of a memoryless quantum channel when feedback is used across nonentangled input states, or when the channel is an entanglement-breaking channel.