On the Distributed Compression of Quantum Information
Abstract
The problem of distributed compression for correlated quantum sources is considered. The classical version of this problem was solved by Slepian and Wolf, who showed that distributed compression could take full advantage of redundancy in the local sources created by the presence of correlations. Here it is shown that, in general, this is not the case for quantum sources, by proving a lower bound on the rate sum for irreducible sources of product states which is stronger than the one given by a naive application of Slepian–Wolf. Nonetheless, strategies taking advantage of correlation do exist for some special classes of quantum sources. For example, Devetak and Winter demonstrated the existence of such a strategy when one of the sources is classical. Optimal nontrivial strategies for a different extreme, sources of Bell states, are presented here. In addition, it is explained how distributed compression is connected to other problems in quantum information theory, including information-disturbance questions, entanglement distillation and quantum error correction.
Additional Information
© Copyright 2006 IEEE. Reprinted with permission. Manuscript received September 24, 2004; revised September 19, 2005. [Posted online: 2006-09-25] This work was supported by the U.S. National Science Foundation under Grant EIA-0086038. The work of C. Ahn was also supported by an Institute for Quantum Information Fellowship; the work of P. Hayden was supported by the Sherman Fairchild Foundation, CIAR, NSERC and the Canada Research Chairs Program; the work of A.C. Doherty was supported by the Caltech MURI Center for Quantum Networks (DAAD19-00-1-0374); and the work of A.J. Winter was supported by the U.K. Engineering and Physical Sciences Research Council. Communicated by E. Knill, Associate Editor for Quantum Information Theory. The authors would like to thank Dominic Berry, Sumit Daftuar, Igor Devetak, Michal Horodecki, Debbie Leung, Jonathan Oppenheim, Hideo Mabuchi, John Smolin, and Jon Thomas Yard for enjoyable and helpful conversations.Files
| Name | Size | Download all |
|---|---|---|
|
md5:9e5876eb8532d1dedd136f1312a0fc2c
|
265.4 kB | Preview Download |
Additional details
- Eprint ID
- 5350
- Resolver ID
- CaltechAUTHORS:AHNieeetit06
- Created
-
2006-10-12Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field