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:quant-ph/0407037 · Physical Review Letters

Distributed Quantum Dense Coding

Dagmar Bruß, Giacomo Mauro D’Ariano, Maciej Lewenstein, Chiara Macchiavello, A. Sen(De), Ujjwal Sen

Published Nov 19, 2004• 174 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.93.210501

Related papers

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•57 citations

On quantum advantage in dense coding

Michał Horodecki, Marco Piani

The quantum advantage of dense coding—the increase in the rate of classical information transmission due to shared entanglement—is studied. General encoding quantum operations are considered. Particular attention is devoted to the case of many senders and one receiver. It is shown that restrictions on the possible operations among the many senders can strongly affect the usefulness of a shared quantum state for dense coding. It is shown, e.g., that there are states that do not provide any quantum advantage if communication among the senders is not allowed, but are useful for dense coding as soon as the senders can communicate classically. These results are actually independent of the particular quantification of the quantum advantage, being valid for any reasonable definition of such a rate increase. It is further shown that the quantum advantage of dense coding satisfies a monogamy relation with the so-called entanglement of purification.

arXiv:quant-ph/0701134•Journal of Physics A Mathematical and Theoretical•Feb 24, 2012•51 citations

Distributed quantum dense coding with two receivers in noisy environments

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

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.

arXiv:1412.6247•Physical Review A•Nov 24, 2015•31 citations

One-shot conclusive multiport quantum dense coding capacities

Chirag Srivastava, Anindita Bera, Aditi Sen +1 more

We introduce a probabilistic version of the one-shot quantum dense coding protocol in both two- and multiport scenarios in which the sender(s) transmit(s) only complete messages unambiguously, to a single receiver, and we refer to it as conclusive quantum dense coding. We derive the relevant form of the mutual information between encoded information and measurement results in the scenario considered. We analyze the corresponding capacities of shared states between two, three, and more qubits, and two qutrits. We identify cases where Pauli and generalized Pauli operators are not sufficient as encoders to attain the optimal one-shot conclusive quantum dense coding capacities. We find that there is a rich connection between the capacities and the bipartite as well as multipartite entanglements of the shared state.

arXiv:1903.11709•Physical Review A•Nov 4, 2019•13 citations

The classical capacity of a quantum dense coding system

Masashi Ban, Sachiko Kitajima, Fumiaki Shibata

Quantum dense coding transmits classical information by sending a quantum system with the assistance of quantum entanglement. The classical information capacity of a quantum dense coding system is obtained, where a sender and receiver share a completely entangled state and a quantum system encoded by applying unitary operators is sent through an arbitrary quantum channel. The result is compared with that obtained in another setting.

Journal of Physics A Mathematical and General•Aug 18, 2004•5 citations

Simultaneous dense coding

Haozhen Situ, Daowen Qiu

We present a dense coding scheme between one sender and two receivers, which guarantees that the receivers simultaneously achieve their respective information. In our scheme, the sender first performs a locking operation to entangle the particles from two independent quantum entanglement channels, so that the receivers cannot achieve their information unless they collaborate to perform the unlocking operation. We also show that the quantum Fourier transform can act as the locking operator both in simultaneous dense coding and teleportation. Finally we compare simultaneous dense coding with quantum secret sharing of classical messages.

arXiv:0909.3613•Journal of Physics A Mathematical and Theoretical•Jan 12, 2010•26 citations
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 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.
The quantum advantage of dense coding—the increase in the rate of classical information transmission due to shared entanglement—is studied. General encoding quantum operations are considered. Particular attention is devoted to the case of many senders and one receiver. It is shown that restrictions on the possible operations among the many senders can strongly affect the usefulness of a shared quantum state for dense coding. It is shown, e.g., that there are states that do not provide any quantum advantage if communication among the senders is not allowed, but are useful for dense coding as soon as the senders can communicate classically. These results are actually independent of the particular quantification of the quantum advantage, being valid for any reasonable definition of such a rate increase. It is further shown that the quantum advantage of dense coding satisfies a monogamy relation with the so-called entanglement of purification.
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.
We introduce a probabilistic version of the one-shot quantum dense coding protocol in both two- and multiport scenarios in which the sender(s) transmit(s) only complete messages unambiguously, to a single receiver, and we refer to it as conclusive quantum dense coding. We derive the relevant form of the mutual information between encoded information and measurement results in the scenario considered. We analyze the corresponding capacities of shared states between two, three, and more qubits, and two qutrits. We identify cases where Pauli and generalized Pauli operators are not sufficient as encoders to attain the optimal one-shot conclusive quantum dense coding capacities. We find that there is a rich connection between the capacities and the bipartite as well as multipartite entanglements of the shared state.
We present a dense coding scheme between one sender and two receivers, which guarantees that the receivers simultaneously achieve their respective information. In our scheme, the sender first performs a locking operation to entangle the particles from two independent quantum entanglement channels, so that the receivers cannot achieve their information unless they collaborate to perform the unlocking operation. We also show that the quantum Fourier transform can act as the locking operator both in simultaneous dense coding and teleportation. Finally we compare simultaneous dense coding with quantum secret sharing of classical messages.