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/0701134 · Journal of Physics A Mathematical and Theoretical

On quantum advantage in dense coding

Michał Horodecki, Marco Piani

Published Feb 24, 2012• 59 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1751-8113/45/10/105306

Related papers

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

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

A Scheme for Dense Coding in the Non-Symmetric Quantum Channel

Yan Feng-Li, Meiyu Wang

We investigate the dense coding in the case of non-symmetric Hilbert spaces of the sender and receiver's particles sharing the quantum maximally entangled state. The efficiency of gaining classical information is also considered. We conclude that when a more level particle is with the sender, she can obtain a non-symmetric quantum channel from a symmetric one by entanglement transfer. Thus the efficiency of information transmission is improved.

arXiv:quant-ph/0311129•Chinese Physics Letters•Jul 1, 2004•29 citations

Communication Advantages from Quantum Dense Network Coding

Ian George, Brian Doolittle

A central problem in quantum information theory is understanding how quantum resources can be used to communicate information more efficiently than classical resources. We introduce quantum dense network coding -- a protocol that transmits the output of a non-Boolean function to a receiver using provably half as many qubits as bits for each sender by not transmitting the entirety of the function inputs. We show this advantage requires both shared entanglement and quantum communication, is robust to noise, and the gap in success probability between quantum and classical communication can be amplified exponentially in the number of senders. Finally, we show that dense network coding gives rise to a novel, information-theoretically secure, quantum cryptographic protocol, which we call measurement-device-independent quantum key growing.

quant-pharXiv:2607.08133•Jul 10, 2026•1 citation

Dimensional advantage in secure information trading via the noisy dense-coding protocol

Ayan Patra, Rivu Gupta, Tamoghna Das +1 more

The quantum dense-coding (DC) protocol, which has no security feature, deals with the transmission of classical information encoded in a quantum state by using shared entanglement between a single sender and a single receiver. Its appropriate variant has been established as a quantum key distribution (QKD) scheme for shared two-qubit maximally entangled states, with the security proof utilizing the uncertainty relation of complementary observables and the Shor-Preskill entanglement purification scheme. We present the DC-based QKD protocol for higher-dimensional systems and report the lower bounds on the secret key rate, when the shared state is a two-qudit maximally entangled state, and mixtures of maximally entangled states with different ranks. The analysis also includes the impact of noisy channels on the secure key rates, before and after encoding. In both the noiseless and the noisy scenarios, we demonstrate that the key rate as well as the robustness of the protocol against noise increases with the dimension. Further, we prove that the set of useless states in the DC-based QKD protocol is convex and compact.

arXiv:2310.20688•Physical Review A•Sep 16, 2024•7 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
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 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.
A central problem in quantum information theory is understanding how quantum resources can be used to communicate information more efficiently than classical resources. We introduce quantum dense network coding -- a protocol that transmits the output of a non-Boolean function to a receiver using provably half as many qubits as bits for each sender by not transmitting the entirety of the function inputs. We show this advantage requires both shared entanglement and quantum communication, is robust to noise, and the gap in success probability between quantum and classical communication can be amplified exponentially in the number of senders. Finally, we show that dense network coding gives rise to a novel, information-theoretically secure, quantum cryptographic protocol, which we call measurement-device-independent quantum key growing.
The quantum dense-coding (DC) protocol, which has no security feature, deals with the transmission of classical information encoded in a quantum state by using shared entanglement between a single sender and a single receiver. Its appropriate variant has been established as a quantum key distribution (QKD) scheme for shared two-qubit maximally entangled states, with the security proof utilizing the uncertainty relation of complementary observables and the Shor-Preskill entanglement purification scheme. We present the DC-based QKD protocol for higher-dimensional systems and report the lower bounds on the secret key rate, when the shared state is a two-qudit maximally entangled state, and mixtures of maximally entangled states with different ranks. The analysis also includes the impact of noisy channels on the secure key rates, before and after encoding. In both the noiseless and the noisy scenarios, we demonstrate that the key rate as well as the robustness of the protocol against noise increases with the dimension. Further, we prove that the set of useless states in the DC-based QKD protocol is convex and compact.