Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0707.2792 · Journal of Physics A Mathematical and Theoretical

Distributed compression and multiparty squashed entanglement

David Avis, Patrick M. Hayden, Ivan Savov

Published Mar 4, 2008• 46 citations
arXivHTMLPDF

Abstract

We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty version of the fully quantum Slepian-Wolf protocol for two senders and arises through the repeated application of the two-sender protocol. We describe bounds on the achievable rate region for the distributed compression problem. The inner bound arises by expressing the achievable rate region for our protocol in terms of its vertices and extreme rays and, equivalently, in terms of facet inequalities. We also prove an outer bound on all possible rates for distributed compression based on the multiparty squashed entanglement, a measure of multiparty entanglement.

DOI
10.1088/1751-8113/41/11/115301

Related papers

Multiparty Distributed Compression of Quantum Information

David Avis, Patrick M. Hayden, Ivan Savov

We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty version of the fully quantum Slepian-Wolf protocol for two senders and arises through the repeated application of the two-sender protocol. We describe bounds on the achievable rate region for the distributed compression problem. The inner bound arises by expressing the achievable rate region for our protocol in terms of its vertices and extreme rays and, equivalently, in terms of facet inequalities. We also prove an outer bound on all possible rates for distributed compression based on multiparty squashed entanglement.

International Conference on Quantum, Nano and Micro Technologies (ICQNM)•Feb 1, 2008•0 citations

Distributed Compression and Squashed Entanglement

Ivan Savov

A single quantum state can be shared by many distant parties. In this thesis, we try to characterize the information contents of such distributed states by defining the multiparty information and the multiparty squashed entanglement, two steps toward a general theory of multiparty quantum information. As a further step in that direction, we partially solve the multiparty distributed compression problem where multiple parties use quantum communication to faithfully transfer their shares of a state to a common receiver. We build a protocol for multiparty distributed compression based on the fully quantum Slepian-Wolf protocol and prove both inner and outer bounds on the achievable rate region. We relate our findings to previous results in information theory and discuss some possible applications.

arXiv:0802.0694•Jan 1, 2008•3 citations

A New Distributed Source Coding Problem Related to the Classical-Quantum Slepian–Wolf Problem

Hachiro Fujita

Suppose there are two correlated sources, one producing classical data and the other producing mixed states with commuting density operators. We combine the two sources into one and call it a classical-quantum source. In this paper, we consider the problem of distributed compression of the classical-quantum source. This is a special case of the classical-quantum Slepian-Wolf problem addressed by Devetak and Winter [1]. Suppose Alice (resp. Bob) receives classical (resp. quantum) data from the classical-quantum source. Alice and Bob, who cannot communicate with each other, want to send their received data to Charlie at the minimum communication cost. We consider two scenarios, the blind and visible scenarios, for Bob's quantum data compression. We formulate our problem in terms of classical information theory and then using some results in classical information theory, we show partial results on the achievable rate region for asymptotically lossless distributed compression of the classical-quantum source in the blind and visible scenarios.

DCC•Mar 1, 2019•0 citations

On the Distributed Compression of Quantum Information

Charlene Ahn, Andrew C. Doherty, Patrick M. Hayden +1 more

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.

arXiv:quant-ph/0403042•IEEE Transactions on Information Theory•Sep 29, 2006•31 citations

Channel Simulation and Coded Source Compression

Min-Hsiu Hsieh, Shun Watanabe

Coded source compression, also known as source compression with helpers, has been a major variant of distributed source compression, but has hitherto received little attention in the quantum regime. This letter treats and solves the corresponding quantum coded source compression through an observation that connects coded source compression with channel simulation. First, we consider classical source coding with quantum side information, where the quantum side information is observed by a helper and sent to the decoder via a classical channel. We derive a single-letter characterization of the achievable rate region for this problem. The direct coding theorem of our result is proved via the measurement compression theory of Winter, a quantum-to-classical channel simulation. Our result reveals that a helper's scheme which separately conducts a measurement and a compression is suboptimal, and measurement compression seems necessary to achieve the optimal rate region. We then study coded source compression in the fully quantum regime, where two different scenarios are considered depending on the types of communication channels between the legitimate source and the receiver. We further allow entanglement assistance from the quantum helper in both scenarios. We characterize the involved quantum resources and derive single-letter expressions of the achievable rate region. The direct coding proofs are based on well-known quantum protocols, the quantum state merging protocol, and the fully quantum Slepian-Wolf protocol, together with the quantum reverse Shannon theorem.

arXiv:1511.06071•IEEE Transactions on Information Theory•Aug 3, 2016•29 citations

Squashed entanglement and the two-way assisted capacities of a quantum channel

Masahiro Takeoka, Saikat Guha, Mark M. Wilde

We define the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity inequality for the original squashed entanglement measure of Christandl and Winter leads to the conclusion that the squashed entanglement of a quantum channel is an additive function of a tensor product of any two quantum channels. More importantly, this new subadditivity inequality, along with prior results of Christandl, Winter, et al., establishes the squashed entanglement of a quantum channel as an upper bound on the quantum communication capacity of any channel assisted by unlimited forward and backward classical communication. A similar proof establishes this quantity as an upper bound on the private capacity of a quantum channel assisted by unlimited forward and backward public classical communication. This latter result is relevant as a limitation on rates achievable in quantum key distribution. As an important application, we determine that these capacities can never exceed log((1 + η)=(1 - η)) for a pure-loss bosonic channel for which a fraction η of the input photons make it to the output on average. The best known lower bound on these capacities is equal to log(1=(1 - η)). Thus, in the high-loss regime for which η ≪ 1, this new upper bound demonstrates that the protocols corresponding to the above lower bound are nearly optimal.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•1 citation
We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty version of the fully quantum Slepian-Wolf protocol for two senders and arises through the repeated application of the two-sender protocol. We describe bounds on the achievable rate region for the distributed compression problem. The inner bound arises by expressing the achievable rate region for our protocol in terms of its vertices and extreme rays and, equivalently, in terms of facet inequalities. We also prove an outer bound on all possible rates for distributed compression based on the multiparty squashed entanglement, a measure of multiparty entanglement.
We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty version of the fully quantum Slepian-Wolf protocol for two senders and arises through the repeated application of the two-sender protocol. We describe bounds on the achievable rate region for the distributed compression problem. The inner bound arises by expressing the achievable rate region for our protocol in terms of its vertices and extreme rays and, equivalently, in terms of facet inequalities. We also prove an outer bound on all possible rates for distributed compression based on multiparty squashed entanglement.
A single quantum state can be shared by many distant parties. In this thesis, we try to characterize the information contents of such distributed states by defining the multiparty information and the multiparty squashed entanglement, two steps toward a general theory of multiparty quantum information. As a further step in that direction, we partially solve the multiparty distributed compression problem where multiple parties use quantum communication to faithfully transfer their shares of a state to a common receiver. We build a protocol for multiparty distributed compression based on the fully quantum Slepian-Wolf protocol and prove both inner and outer bounds on the achievable rate region. We relate our findings to previous results in information theory and discuss some possible applications.
Suppose there are two correlated sources, one producing classical data and the other producing mixed states with commuting density operators. We combine the two sources into one and call it a classical-quantum source. In this paper, we consider the problem of distributed compression of the classical-quantum source. This is a special case of the classical-quantum Slepian-Wolf problem addressed by Devetak and Winter [1]. Suppose Alice (resp. Bob) receives classical (resp. quantum) data from the classical-quantum source. Alice and Bob, who cannot communicate with each other, want to send their received data to Charlie at the minimum communication cost. We consider two scenarios, the blind and visible scenarios, for Bob's quantum data compression. We formulate our problem in terms of classical information theory and then using some results in classical information theory, we show partial results on the achievable rate region for asymptotically lossless distributed compression of the classical-quantum source in the blind and visible scenarios.
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.
Coded source compression, also known as source compression with helpers, has been a major variant of distributed source compression, but has hitherto received little attention in the quantum regime. This letter treats and solves the corresponding quantum coded source compression through an observation that connects coded source compression with channel simulation. First, we consider classical source coding with quantum side information, where the quantum side information is observed by a helper and sent to the decoder via a classical channel. We derive a single-letter characterization of the achievable rate region for this problem. The direct coding theorem of our result is proved via the measurement compression theory of Winter, a quantum-to-classical channel simulation. Our result reveals that a helper's scheme which separately conducts a measurement and a compression is suboptimal, and measurement compression seems necessary to achieve the optimal rate region. We then study coded source compression in the fully quantum regime, where two different scenarios are considered depending on the types of communication channels between the legitimate source and the receiver. We further allow entanglement assistance from the quantum helper in both scenarios. We characterize the involved quantum resources and derive single-letter expressions of the achievable rate region. The direct coding proofs are based on well-known quantum protocols, the quantum state merging protocol, and the fully quantum Slepian-Wolf protocol, together with the quantum reverse Shannon theorem.
We define the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity inequality for the original squashed entanglement measure of Christandl and Winter leads to the conclusion that the squashed entanglement of a quantum channel is an additive function of a tensor product of any two quantum channels. More importantly, this new subadditivity inequality, along with prior results of Christandl, Winter, et al., establishes the squashed entanglement of a quantum channel as an upper bound on the quantum communication capacity of any channel assisted by unlimited forward and backward classical communication. A similar proof establishes this quantity as an upper bound on the private capacity of a quantum channel assisted by unlimited forward and backward public classical communication. This latter result is relevant as a limitation on rates achievable in quantum key distribution. As an important application, we determine that these capacities can never exceed log((1 + η)=(1 - η)) for a pure-loss bosonic channel for which a fraction η of the input photons make it to the output on average. The best known lower bound on these capacities is equal to log(1=(1 - η)). Thus, in the high-loss regime for which η ≪ 1, this new upper bound demonstrates that the protocols corresponding to the above lower bound are nearly optimal.