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:1412.6247 · Physical Review A

Distributed quantum dense coding with two receivers in noisy environments

Tamoghna Das, R. Prabhu, Aditi Sen, Ujjwal Sen

Published Nov 24, 2015• 31 citations
arXivHTMLPDF

Abstract

We investigate the effect of noisy channels in a classical information transfer through a multipartite state which acts as a substrate for the distributed quantum dense coding protocol between several senders and two receivers. The situation is qualitatively different from the case with one or more senders and a single receiver. We obtain an upper bound on the multipartite capacity which is tightened in the case of the covariant noisy channel. We also establish a relation between the genuine multipartite entanglement of the shared state and the capacity of distributed dense coding using that state, both in the noiseless and the noisy scenarios. Specifically, we find that, in the case of multiple senders and two receivers, the corresponding generalized Greenberger-Horne-Zeilinger states possess higher dense coding capacities as compared to a significant fraction of pure states having the same multipartite entanglement.

DOI
10.1103/physreva.92.052330

Related papers

Multipartite dense coding versus quantum correlation: Noise inverts relative capability of information transfer

Tamoghna Das, R. Prabhu, Aditi Sen +1 more

A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Applications of quantum channels are most likely to be commercially important only in the multiparty regime, where such a correspondence does not exist even for pure quantum states. We establish a connection between the multiparty capacity of classical information transmission in quantum dense coding and several multipartite quantum correlation measures of the shared state, used in the dense coding protocol. In particular, we show that for the noiseless channel, if multipartite quantum correlations of an arbitrary multipartite state of arbitrary number of qubits are the same as those of the corresponding generalized Greenberger-Horne-Zeilinger state, then the multipartite dense coding capability of the former is the same as or better than that of the generalized Greenberger-Horne-Zeilinger state. Interestingly, in a noisy-channel scenario, where we consider both uncorrelated and correlated noise models, the relative abilities of the quantum channels to transfer classical information can get inverted by administration of a sufficient amount of noise. When the shared state is an arbitrary multipartite mixed state, we also establish a link between the classical capacity for the noiseless case and multipartite quantum correlation measures.

arXiv:1404.4559•Physical Review A•Aug 18, 2014•24 citations

DENSE CODING WITH MULTIPARTITE QUANTUM STATES

Dagmar Bruß, Maciej Lewenstein, Aditi Sen +3 more

We consider generalizations of the dense coding protocol with an arbitrary number of senders and either one or two receivers, sharing a multiparty quantum state, and using a noiseless channel. For the case of a single receiver, the capacity of such information transfer is found exactly. It is shown that the capacity is not enhanced by allowing the senders to perform joint operations. We provide a nontrivial upper bound on the capacity in the case of two receivers. We also give a classification of the set of all multiparty states in terms of their usefulness for dense coding. We provide examples for each of these classes, and discuss some of their properties.

arXiv:quant-ph/0507146•International Journal of Quantum Information•Jun 1, 2006•61 citations

Distributed Quantum Dense Coding

Dagmar Bruß, Giacomo Mauro D’Ariano, Maciej Lewenstein +3 more

We introduce the notion of distributed quantum dense coding, i.e., the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders do not increase the information transfer capacity, in the case of a single receiver. For the case of two receivers, using local operations and classical communication, a nontrivial upper bound for the capacity is derived. We propose a general classification scheme of quantum states according to their usefulness for dense coding. In the bipartite case (for any dimensions), bound entanglement is not useful for this task.

arXiv:quant-ph/0407037•Physical Review Letters•Nov 19, 2004•181 citations

Superiority in dense coding through non-Markovian stochasticity

Abhishek Muhuri, Rivu Gupta, Srijon Ghosh +1 more

We investigate the distributed dense coding (DC) protocol, involving multiple senders and a single or two receivers under the influence of non-Markovian noise, acting on the encoded qubits transmitted from the senders to the receiver(s). We compare the effects of non-Markovianity on DC for both the dephasing and depolarizing channels. In the case of dephasing channels, we illustrate that for some classes of states, high non-Markovian strength can eradicate the negative influence of noisy channels which is not observed for depolarizing noise. Furthermore, we incorporate randomness into the noise models by replacing the Pauli matrices with random unitaries and demonstrate the constructive impact of stochastic noise models on the quenched averaged dense coding capacity. Interestingly, we report that the detrimental effect of non-Markovian depolarizing channels in the DC protocol can be eliminated when randomness is added to the channel.

arXiv:2211.13057•Physical Review A•Mar 20, 2024•9 citations

Scalable and noise-robust communication advantage of multipartite quantum entanglement

Ananya Chakraborty, Ram Krishna Patra, Kunika Agarwal +4 more

Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing interserver communication---an issue central to the study of communication complexity. Quantum resources offer advantages over classical methods in addressing this challenge. In this work, we investigate a distributed computing scenario with multiple senders and a single receiver, establishing a scalable advantage of multipartite quantum entanglement in mitigating communication complexity. Specifically, we demonstrate that when the receiver and the senders share a multiqubit Greenberger-Horne-Zeilinger (GHZ) state---a quintessential form of genuine multipartite entanglement---certain global functions of the distributed inputs can be computed with only one bit of classical communication from each sender. In contrast, without entanglement, two bits of communication are required from all but one sender. Consequently, quantum entanglement reduces communication overhead by $n\ensuremath{-}1$ bits for $n$ senders, allowing for arbitrary scaling with an increasing number of senders. We also show that the entanglement-based protocol exhibits significant robustness under white noise, thereby establishing the potential for experimental realization of this quantum advantage.

arXiv:2409.13223•Physical Review A•Mar 20, 2025•8 citations

Optimal super dense coding over noisy quantum channels

Z. Shadman, Hermann Kampermann, Chiara Macchiavello +1 more

We investigate super dense coding in the presence of noise, i.e. the subsystems of the entangled resource state have to pass a noisy unital quantum channel between the sender and the receiver. We discuss explicitly the case of Pauli channels in an arbitrary dimension and derive the super dense coding capacity (i.e. the optimal information transfer) for some given resource states. For the qubit depolarizing channel, we also optimize the super dense coding capacity with respect to the input state. We show that, below a threshold value of the noise parameter, the super dense coding protocol is optimized by a maximally entangled initial state, while above the threshold it is optimized by a product state. Finally, we provide an example of a noisy channel where non-unitary pre-processing increases the super dense coding capacity, as compared to only unitary encoding.

arXiv:1004.5573•New Journal of Physics•Jul 30, 2010•66 citations
We investigate the effect of noisy channels in a classical information transfer through a multipartite state which acts as a substrate for the distributed quantum dense coding protocol between several senders and two receivers. The situation is qualitatively different from the case with one or more senders and a single receiver. We obtain an upper bound on the multipartite capacity which is tightened in the case of the covariant noisy channel. We also establish a relation between the genuine multipartite entanglement of the shared state and the capacity of distributed dense coding using that state, both in the noiseless and the noisy scenarios. Specifically, we find that, in the case of multiple senders and two receivers, the corresponding generalized Greenberger-Horne-Zeilinger states possess higher dense coding capacities as compared to a significant fraction of pure states having the same multipartite entanglement.
A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Applications of quantum channels are most likely to be commercially important only in the multiparty regime, where such a correspondence does not exist even for pure quantum states. We establish a connection between the multiparty capacity of classical information transmission in quantum dense coding and several multipartite quantum correlation measures of the shared state, used in the dense coding protocol. In particular, we show that for the noiseless channel, if multipartite quantum correlations of an arbitrary multipartite state of arbitrary number of qubits are the same as those of the corresponding generalized Greenberger-Horne-Zeilinger state, then the multipartite dense coding capability of the former is the same as or better than that of the generalized Greenberger-Horne-Zeilinger state. Interestingly, in a noisy-channel scenario, where we consider both uncorrelated and correlated noise models, the relative abilities of the quantum channels to transfer classical information can get inverted by administration of a sufficient amount of noise. When the shared state is an arbitrary multipartite mixed state, we also establish a link between the classical capacity for the noiseless case and multipartite quantum correlation measures.
We consider generalizations of the dense coding protocol with an arbitrary number of senders and either one or two receivers, sharing a multiparty quantum state, and using a noiseless channel. For the case of a single receiver, the capacity of such information transfer is found exactly. It is shown that the capacity is not enhanced by allowing the senders to perform joint operations. We provide a nontrivial upper bound on the capacity in the case of two receivers. We also give a classification of the set of all multiparty states in terms of their usefulness for dense coding. We provide examples for each of these classes, and discuss some of their properties.
We introduce the notion of distributed quantum dense coding, i.e., the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders do not increase the information transfer capacity, in the case of a single receiver. For the case of two receivers, using local operations and classical communication, a nontrivial upper bound for the capacity is derived. We propose a general classification scheme of quantum states according to their usefulness for dense coding. In the bipartite case (for any dimensions), bound entanglement is not useful for this task.
We investigate the distributed dense coding (DC) protocol, involving multiple senders and a single or two receivers under the influence of non-Markovian noise, acting on the encoded qubits transmitted from the senders to the receiver(s). We compare the effects of non-Markovianity on DC for both the dephasing and depolarizing channels. In the case of dephasing channels, we illustrate that for some classes of states, high non-Markovian strength can eradicate the negative influence of noisy channels which is not observed for depolarizing noise. Furthermore, we incorporate randomness into the noise models by replacing the Pauli matrices with random unitaries and demonstrate the constructive impact of stochastic noise models on the quenched averaged dense coding capacity. Interestingly, we report that the detrimental effect of non-Markovian depolarizing channels in the DC protocol can be eliminated when randomness is added to the channel.
Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing interserver communication---an issue central to the study of communication complexity. Quantum resources offer advantages over classical methods in addressing this challenge. In this work, we investigate a distributed computing scenario with multiple senders and a single receiver, establishing a scalable advantage of multipartite quantum entanglement in mitigating communication complexity. Specifically, we demonstrate that when the receiver and the senders share a multiqubit Greenberger-Horne-Zeilinger (GHZ) state---a quintessential form of genuine multipartite entanglement---certain global functions of the distributed inputs can be computed with only one bit of classical communication from each sender. In contrast, without entanglement, two bits of communication are required from all but one sender. Consequently, quantum entanglement reduces communication overhead by $n\ensuremath{-}1$ bits for nnn senders, allowing for arbitrary scaling with an increasing number of senders. We also show that the entanglement-based protocol exhibits significant robustness under white noise, thereby establishing the potential for experimental realization of this quantum advantage.
We investigate super dense coding in the presence of noise, i.e. the subsystems of the entangled resource state have to pass a noisy unital quantum channel between the sender and the receiver. We discuss explicitly the case of Pauli channels in an arbitrary dimension and derive the super dense coding capacity (i.e. the optimal information transfer) for some given resource states. For the qubit depolarizing channel, we also optimize the super dense coding capacity with respect to the input state. We show that, below a threshold value of the noise parameter, the super dense coding protocol is optimized by a maximally entangled initial state, while above the threshold it is optimized by a product state. Finally, we provide an example of a noisy channel where non-unitary pre-processing increases the super dense coding capacity, as compared to only unitary encoding.