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• 51 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

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

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

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

Nonoptimality of unitary encoding with quantum channels assisted by entanglement

Michael R. Beran, Scott M. Cohen

One of the primary goals of information theory is to provide limits on the amount of information one can send through communication channels, and to understand encoding methods that achieve such limits. The discovery of dense coding showed that quantum channels can transmit twice as much classical information than is possible with a classical channel. This optimal rate requires using quantum systems maximally entangled between sender and receiver, and then the sender can encode her messages using unitary operations. The use of nonmaximally entangled systems has been intensively studied in recent years, and it has appeared as though unitary encoding might well be optimal in all cases. Indeed, this optimality of unitary operations has been found to hold under far more general conditions. Nonetheless, we here present numerical evidence supported by analytical arguments that there exist circumstances where more classical information can be encoded using nonunitary, rather than unitary, operations.

arXiv:0807.4552•Physical Review A•Dec 23, 2008•10 citations

Dense Coding with Locality Restriction on Decoders: Quantum Encoders versus Superquantum Encoders

Masahito Hayashi, Kun Wang

We investigate dense coding by imposing various locality restrictions to our decoder by employing the resource theory of asymmetry framework. In this task, the sender Alice and the receiver Bob share an entangled state. She encodes the classical information into it using a symmetric preserving encoder and sends the encoded state to Bob through a noiseless quantum channel. The decoder is limited to a measurement to satisfy a certain locality condition on the bipartite system composed of the receiving system and the preshared entanglement half. Our contributions are summarized as follows: First, we derive an achievable transmission rate for this task dependently of conditions of encoder and decoder. Surprisingly, we show that the obtained rate cannot be improved even when the decoder is relaxed to local measurements, two-way LOCCs, separable measurements, or partial transpose positive (PPT) measurements for the bipartite system. Moreover, depending on the class of allowed measurements with a locality condition, we relax the class of encoding operations to super-quantum encoders in the framework of general probability theory (GPT). That is, when our decoder is restricted to a separable measurement, theoretically, a positive operation is allowed as an encoding operation. Surprisingly, even under this type of super-quantum relaxation, the transmission rate cannot be improved. This fact highlights the universal validity of our analysis beyond quantum theory.

arXiv:2109.12518•PRX Quantum•Sep 28, 2022•14 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
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 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.
One of the primary goals of information theory is to provide limits on the amount of information one can send through communication channels, and to understand encoding methods that achieve such limits. The discovery of dense coding showed that quantum channels can transmit twice as much classical information than is possible with a classical channel. This optimal rate requires using quantum systems maximally entangled between sender and receiver, and then the sender can encode her messages using unitary operations. The use of nonmaximally entangled systems has been intensively studied in recent years, and it has appeared as though unitary encoding might well be optimal in all cases. Indeed, this optimality of unitary operations has been found to hold under far more general conditions. Nonetheless, we here present numerical evidence supported by analytical arguments that there exist circumstances where more classical information can be encoded using nonunitary, rather than unitary, operations.
We investigate dense coding by imposing various locality restrictions to our decoder by employing the resource theory of asymmetry framework. In this task, the sender Alice and the receiver Bob share an entangled state. She encodes the classical information into it using a symmetric preserving encoder and sends the encoded state to Bob through a noiseless quantum channel. The decoder is limited to a measurement to satisfy a certain locality condition on the bipartite system composed of the receiving system and the preshared entanglement half. Our contributions are summarized as follows: First, we derive an achievable transmission rate for this task dependently of conditions of encoder and decoder. Surprisingly, we show that the obtained rate cannot be improved even when the decoder is relaxed to local measurements, two-way LOCCs, separable measurements, or partial transpose positive (PPT) measurements for the bipartite system. Moreover, depending on the class of allowed measurements with a locality condition, we relax the class of encoding operations to super-quantum encoders in the framework of general probability theory (GPT). That is, when our decoder is restricted to a separable measurement, theoretically, a positive operation is allowed as an encoding operation. Surprisingly, even under this type of super-quantum relaxation, the transmission rate cannot be improved. This fact highlights the universal validity of our analysis beyond quantum theory.
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.