Data Compression Limit for an Information Source of Interacting Qubits

Data Compression Limit for an Information Source of Interacting Qubits A system of interacting qubits can be viewed as a non-i.i.d quantum information source. A possible model of such a source is provided by a quantum spin system, in which spin-1/2 particles located at sites of a lattice interact with each other. We establish the limit for the compression of information from such a source and show that asymptotically it is given by the von Neumann entropy rate. Our result can be viewed as a quantum ana-logue of Shannon's noiseless coding theorem for a class of non-i.i.d. quantum informa-tion sources. From the probabilistic point of view it is an analog of the Shannon-McMillan-Breiman theorem considered as a cornerstone of modern Information Theory. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Data Compression Limit for an Information Source of Interacting Qubits

Loading next page...
 
/lp/springer_journal/data-compression-limit-for-an-information-source-of-interacting-qubits-83O4otlwOe
Publisher
Springer Journals
Copyright
Copyright © 2002 by Plenum Publishing Corporation
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1023/A:1022148203300
Publisher site
See Article on Publisher Site

Abstract

A system of interacting qubits can be viewed as a non-i.i.d quantum information source. A possible model of such a source is provided by a quantum spin system, in which spin-1/2 particles located at sites of a lattice interact with each other. We establish the limit for the compression of information from such a source and show that asymptotically it is given by the von Neumann entropy rate. Our result can be viewed as a quantum ana-logue of Shannon's noiseless coding theorem for a class of non-i.i.d. quantum informa-tion sources. From the probabilistic point of view it is an analog of the Shannon-McMillan-Breiman theorem considered as a cornerstone of modern Information Theory.

Journal

Quantum Information ProcessingSpringer Journals

Published: Oct 13, 2004

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off