973 research outputs found
A quantum analog of Huffman coding
We analyze a generalization of Huffman coding to the quantum case. In
particular, we notice various difficulties in using instantaneous codes for
quantum communication. Nevertheless, for the storage of quantum information, we
have succeeded in constructing a Huffman-coding inspired quantum scheme. The
number of computational steps in the encoding and decoding processes of N
quantum signals can be made to be of polylogarithmic depth by a massively
parallel implementation of a quantum gate array. This is to be compared with
the O (N^3) computational steps required in the sequential implementation by
Cleve and DiVincenzo of the well-known quantum noiseless block coding scheme of
Schumacher. We also show that O(N^2(log N)^a) computational steps are needed
for the communication of quantum information using another Huffman-coding
inspired scheme where the sender must disentangle her encoding device before
the receiver can perform any measurements on his signals.Comment: Revised version, 7 pages, two-column, RevTex. Presented at 1998 IEEE
International Symposium on Information Theor
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 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.Comment: 16 pages, 5 figure
Indeterminate-length quantum coding
The quantum analogues of classical variable-length codes are
indeterminate-length quantum codes, in which codewords may exist in
superpositions of different lengths. This paper explores some of their
properties. The length observable for such codes is governed by a quantum
version of the Kraft-McMillan inequality. Indeterminate-length quantum codes
also provide an alternate approach to quantum data compression.Comment: 32 page
Optimality in Quantum Data Compression using Dynamical 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 introduce the notion of quantum stochastic ensembles, allowing us to
consider strings of quantum states prepared in a more general way. For any
identically distributed quantum stochastic ensemble we define an associated
quantum Markov chain and prove that the optimal average codeword length via
lossless coding is equal to the quantum dynamical entropy of the associated
quantum Markov chain
Universal quantum information compression and degrees of prior knowledge
We describe a universal information compression scheme that compresses any
pure quantum i.i.d. source asymptotically to its von Neumann entropy, with no
prior knowledge of the structure of the source. We introduce a diagonalisation
procedure that enables any classical compression algorithm to be utilised in a
quantum context. Our scheme is then based on the corresponding quantum
translation of the classical Lempel-Ziv algorithm. Our methods lead to a
conceptually simple way of estimating the entropy of a source in terms of the
measurement of an associated length parameter while maintaining high fidelity
for long blocks. As a by-product we also estimate the eigenbasis of the source.
Since our scheme is based on the Lempel-Ziv method, it can be applied also to
target sequences that are not i.i.d.Comment: 17 pages, no figures. A preliminary version of this work was
presented at EQIS '02, Tokyo, September 200
Energy Requirements for Quantum Data Compression and 1-1 Coding
By looking at quantum data compression in the second quantisation, we present
a new model for the efficient generation and use of variable length codes. In
this picture lossless data compression can be seen as the {\em minimum energy}
required to faithfully represent or transmit classical information contained
within a quantum state.
In order to represent information we create quanta in some predefined modes
(i.e. frequencies) prepared in one of two possible internal states (the
information carrying degrees of freedom). Data compression is now seen as the
selective annihilation of these quanta, the energy of whom is effectively
dissipated into the environment. As any increase in the energy of the
environment is intricately linked to any information loss and is subject to
Landauer's erasure principle, we use this principle to distinguish lossless and
lossy schemes and to suggest bounds on the efficiency of our lossless
compression protocol.
In line with the work of Bostr\"{o}m and Felbinger \cite{bostroem}, we also
show 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. In the absence of
this restraint we translate existing classical results on 1-1 coding to the
quantum domain to derive a new upper bound on the compression of quantum
information. Finally we present a simple quantum circuit to implement our
scheme.Comment: 10 pages, 5 figure
- …