On the Distributed Compression of Quantum Information
From MaRDI portal
Publication:3548017
Coding theorems (Shannon theory) (94A24) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Abstract: We consider the problem of distributed compression for correlated quantum sources. 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. We show 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. Here we find optimal non-trivial strategies for a different extreme, sources of Bell states. In addition, we illustrate how distributed compression is connected to other problems in quantum information theory, including information-disturbance questions, entanglement distillation and quantum error correction.
Recommendations
Cited in
(11)- Slepian-Wolf coding with quantum side information
- The data compression theorem for ergodic quantum information sources
- Compressing quantum mixed-state sources by sending classical information
- Source coding with quantum side information at several decoders
- A theoretical framework for quantum image representation and data loading scheme
- Distributed compression and multiparty squashed entanglement
- Compression of quantum information
- Distributed Compression through the Lens of Algorithmic Information Theory: A Primer
- Communicating Probability Distributions
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- The information-theoretic costs of simulating quantum measurements
This page was built for publication: On the Distributed Compression of Quantum Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548017)