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:2012.01672 · ACM Transactions on Quantum Computing

Rigidity of Superdense Coding

Ashwin Nayak, Henry Yuen

Published May 2, 2023• 6 citations
arXivHTMLPDF

Abstract

The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary protocol for achieving this task (where there are no assumptions on the sender’s encoding operations or the dimension of the shared entangled state) is locally equivalent to the canonical Bennett-Wiesner protocol. In other words, the superdense coding task is rigid . In particular, we show that the sender and receiver only use additional entanglement (beyond the EPR pair) as a source of classical randomness. We also investigate several questions about higher-dimensional superdense coding, where the goal is to communicate one of d 2 possible messages by sending a d -dimensional quantum state, for general dimensions d . Unlike the d =2 case (i.e., sending a single qubit), there can be inequivalent superdense coding protocols for higher d . We present concrete constructions of inequivalent protocols, based on constructions of inequivalent orthogonal unitary bases for all d > 2. Finally, we analyze the performance of superdense coding protocols where the encoding operators are independently sampled from the Haar measure on the unitary group. Our analysis involves bounding the distinguishability of random maximally entangled states, which may be of independent interest.

DOI
10.1145/3593593

Related papers

Probabilistic superdense coding

Arun Kumar Pati, Preeti Parashar, Pankaj Agrawal

We explore the possibility of performing superdense coding with nonmaximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d$ classical bits by sending a $d$-dimensional quantum state with a certain probability of success. The success probability in superdense coding is related to the success probability of distinguishing nonorthogonal states. The optimal average success probabilities are explicitly calculated. We consider the possibility of sending $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d$ classical bits with a shared resource of a higher dimensional entangled state $(D\ifmmode\times\else\texttimes\fi{}D,D>d)$. It is found that more entanglement does not necessarily lead to higher success probability. This also answers the question as to why we need ${\mathrm{log}}_{2}d$ ebits to send $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d$ classical bits in a deterministic fashion.

arXiv:quant-ph/0412039•Physical Review A•Jul 22, 2005•99 citations

Hyperdense coding and superadditivity of classical capacities in hypersphere theories

Serge Massar, Stefano Pironio, Damián Pitalúa-García

In quantum superdense coding, two parties previously sharing entanglement can communicate a two bit message by sending a single qubit.We study this feature in the broader framework of general probabilistic theories.We consider a particular class of theories in which the local state space of the communicating parties corresponds to Euclidian hyperballs of dimension n (the case n = 3 corresponds to the Bloch ball of quantum theory).We show that a single n-ball can encode at most one bit of information, independently of n.We introduce a bipartite extension of such theories for which there exist dense coding protocols such that n log 1 2 + ( ) bits are communicated if entanglement is previously shared by the communicating parties.For n 3, > these protocols are more powerful than the quantum one, because more than two bits are communicated by transmission of a system that locally encodes at most one bit.We call this phenomenon hyperdense coding (HDC).Our HDC protocols imply superadditive classical capacities: two entangled systems can encode n log 1 2 2 + > ( ) bits, even though each system individually encodes at most one bit.In our examples, HDC and superadditivity of classical capacities come at the expense of violating tomographic locality or dynamical continuous reversibility.

arXiv:1504.05147•New Journal of Physics•Oct 26, 2015•13 citations

Superdense Coding and Quantum Teleportation

Phillip Kaye, Raymond Laflamme, Michele Mosca

We are now ready to look at our first protocols for quantum information. In this section, we examine two communication protocols which can be implemented using the tools we have developed in the preceding sections. These protocols are known as superdense coding and quantum teleportation. Both are inherently quantum: there are no classical protocols which behave in the same way. Both involve two parties who wish to perform some communication task between them. In descriptions of such communication protocols (especially in cryptography), it is very common to name the two parties ‘Alice’ and ‘Bob’, for convenience. We will follow this tradition. We will repeatedly refer to communication channels. A quantum communication channel refers to a communication line (e.g. a fiberoptic cable), which can carry qubits between two remote locations. A classical communication channel is one which can carry classical bits (but not qubits).1 The protocols (like many in quantum communication) require that Alice and Bob initially share an entangled pair of qubits in the Bell state The above Bell state is sometimes referred to as an EPR pair. Such a state would have to be created ahead of time, when the qubits are in a lab together and can be made to interact in a way which will give rise to the entanglement between them. After the state is created, Alice and Bob each take one of the two qubits away with them. Alternatively, a third party could create the EPR pair and give one particle to Alice and the other to Bob. If they are careful not to let them interact with the environment, or any other quantum system, Alice and Bob’s joint state will remain entangled. This entanglement becomes a resource which Alice and Bob can use to achieve protocols such as the following. Suppose Alice wishes to send Bob two classical bits of information. Superdense coding is a way of achieving this task over a quantum channel, requiring only that Alice send one qubit to Bob. Alice and Bob must initially share the Bell state Suppose Alice is in possession of the first qubit and Bob the second qubit.

Oxford University Press eBooks•Nov 16, 2006•0 citations

Optimal Superdense Coding of Entangled States

A. Abeyesinghe, Patrick M. Hayden, G. Smith +1 more

In this paper, we present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a$2l$-qubit quantum state could be communicated to a receiver by physically transmitting only$l+o(l)$qubits in addition to consuming$l$ebits of entanglement and some shared randomness. When the states to be prepared are entangled, we find that there is a reduction in the number of qubits that need to be transmitted, interpolating between no communication at all for maximally entangled states and the earlier two-for-one result of the unentangled case, all without the use of any shared randomness. We also present two applications of our result: a direct proof of the achievability of the optimal superdense coding protocol for entangled states produced by a memoryless source, and a demonstration that the quantum identification capacity of an ebit is two qubits.

arXiv:quant-ph/0407061•IEEE Transactions on Information Theory•Jul 26, 2006•36 citations

Superdense coding using multipartite states

Gustavo Rigolin

We show that with the fourpartite quantum channel used to teleport an arbitrary two qubit state, we can construct a superdense coding protocol where it is possible to transmit 4 bits of classical information sending only 2 qubits. Alice and Bob initially share a four qubit maximally entangled state and by locally manipulating her two qubits Alice can generate 16 orthogonal maximally entangled states, which are used to encode the message transmitted to Bob. He reads the 4 bit message by a generalized Bell state measurement. A generalized protocol in which 2N bits of classical information is transmitted via N qubits is also presented. We also show that this four(2N-)partite channel is equivalent to two(N) Bell states, which proves that we need two(N) Bell states to teleport a two(N) qubit system.

arXiv:quant-ph/0407193•Jul 23, 2004•11 citations

Superdense Coding Using Higher Dimensional Embedding

Elio Thadhani, Sharjeel Ahmad, Hussain Ali Razvi +2 more

Quantum dense coding is a foundational protocol in quantum communication, allowing two classical bits to be transmitted by sending a single qubit when a maximally entangled pair is shared. In this work, we consider Embedded Dense Coding (EDC)-a generalization of deterministic dense coding that embeds one subsystem into a higher-dimensional Hilbert space. To assess the operational advantage of EDC compared to standard dense coding, we consider the probability of transmission error when fixing the rate of entanglement consumed per classical message sent. We first demonstrate that EDC enables a smaller one-shot transmission error compared to standard dense coding when using quantum channels with nonzero rates of dephasing and loss. We then demonstrate that even with noiseless communication channels, EDC leads to smaller overall errors when the sender and receiver have noisy local processors. This advantage is shown through concrete implementations of EDC on IBM's Heron processor.

Entropy•Apr 1, 2026•0 citations
The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary protocol for achieving this task (where there are no assumptions on the sender’s encoding operations or the dimension of the shared entangled state) is locally equivalent to the canonical Bennett-Wiesner protocol. In other words, the superdense coding task is rigid . In particular, we show that the sender and receiver only use additional entanglement (beyond the EPR pair) as a source of classical randomness. We also investigate several questions about higher-dimensional superdense coding, where the goal is to communicate one of d 2 possible messages by sending a d -dimensional quantum state, for general dimensions d . Unlike the d =2 case (i.e., sending a single qubit), there can be inequivalent superdense coding protocols for higher d . We present concrete constructions of inequivalent protocols, based on constructions of inequivalent orthogonal unitary bases for all d > 2. Finally, we analyze the performance of superdense coding protocols where the encoding operators are independently sampled from the Haar measure on the unitary group. Our analysis involves bounding the distinguishability of random maximally entangled states, which may be of independent interest.
We explore the possibility of performing superdense coding with nonmaximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate 2log2d2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d2log2​d classical bits by sending a ddd-dimensional quantum state with a certain probability of success. The success probability in superdense coding is related to the success probability of distinguishing nonorthogonal states. The optimal average success probabilities are explicitly calculated. We consider the possibility of sending 2log2d2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d2log2​d classical bits with a shared resource of a higher dimensional entangled state $(D\ifmmode\times\else\texttimes\fi{}D,D>d)$. It is found that more entanglement does not necessarily lead to higher success probability. This also answers the question as to why we need log2d{\mathrm{log}}_{2}dlog2​d ebits to send 2log2d2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{2}d2log2​d classical bits in a deterministic fashion.
In quantum superdense coding, two parties previously sharing entanglement can communicate a two bit message by sending a single qubit.We study this feature in the broader framework of general probabilistic theories.We consider a particular class of theories in which the local state space of the communicating parties corresponds to Euclidian hyperballs of dimension n (the case n = 3 corresponds to the Bloch ball of quantum theory).We show that a single n-ball can encode at most one bit of information, independently of n.We introduce a bipartite extension of such theories for which there exist dense coding protocols such that n log 1 2 + ( ) bits are communicated if entanglement is previously shared by the communicating parties.For n 3, > these protocols are more powerful than the quantum one, because more than two bits are communicated by transmission of a system that locally encodes at most one bit.We call this phenomenon hyperdense coding (HDC).Our HDC protocols imply superadditive classical capacities: two entangled systems can encode n log 1 2 2 + > ( ) bits, even though each system individually encodes at most one bit.In our examples, HDC and superadditivity of classical capacities come at the expense of violating tomographic locality or dynamical continuous reversibility.
We are now ready to look at our first protocols for quantum information. In this section, we examine two communication protocols which can be implemented using the tools we have developed in the preceding sections. These protocols are known as superdense coding and quantum teleportation. Both are inherently quantum: there are no classical protocols which behave in the same way. Both involve two parties who wish to perform some communication task between them. In descriptions of such communication protocols (especially in cryptography), it is very common to name the two parties ‘Alice’ and ‘Bob’, for convenience. We will follow this tradition. We will repeatedly refer to communication channels. A quantum communication channel refers to a communication line (e.g. a fiberoptic cable), which can carry qubits between two remote locations. A classical communication channel is one which can carry classical bits (but not qubits).1 The protocols (like many in quantum communication) require that Alice and Bob initially share an entangled pair of qubits in the Bell state The above Bell state is sometimes referred to as an EPR pair. Such a state would have to be created ahead of time, when the qubits are in a lab together and can be made to interact in a way which will give rise to the entanglement between them. After the state is created, Alice and Bob each take one of the two qubits away with them. Alternatively, a third party could create the EPR pair and give one particle to Alice and the other to Bob. If they are careful not to let them interact with the environment, or any other quantum system, Alice and Bob’s joint state will remain entangled. This entanglement becomes a resource which Alice and Bob can use to achieve protocols such as the following. Suppose Alice wishes to send Bob two classical bits of information. Superdense coding is a way of achieving this task over a quantum channel, requiring only that Alice send one qubit to Bob. Alice and Bob must initially share the Bell state Suppose Alice is in possession of the first qubit and Bob the second qubit.
In this paper, we present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a2l2l2l-qubit quantum state could be communicated to a receiver by physically transmitting onlyl+o(l)l+o(l)l+o(l)qubits in addition to consuminglllebits of entanglement and some shared randomness. When the states to be prepared are entangled, we find that there is a reduction in the number of qubits that need to be transmitted, interpolating between no communication at all for maximally entangled states and the earlier two-for-one result of the unentangled case, all without the use of any shared randomness. We also present two applications of our result: a direct proof of the achievability of the optimal superdense coding protocol for entangled states produced by a memoryless source, and a demonstration that the quantum identification capacity of an ebit is two qubits.
We show that with the fourpartite quantum channel used to teleport an arbitrary two qubit state, we can construct a superdense coding protocol where it is possible to transmit 4 bits of classical information sending only 2 qubits. Alice and Bob initially share a four qubit maximally entangled state and by locally manipulating her two qubits Alice can generate 16 orthogonal maximally entangled states, which are used to encode the message transmitted to Bob. He reads the 4 bit message by a generalized Bell state measurement. A generalized protocol in which 2N bits of classical information is transmitted via N qubits is also presented. We also show that this four(2N-)partite channel is equivalent to two(N) Bell states, which proves that we need two(N) Bell states to teleport a two(N) qubit system.
Quantum dense coding is a foundational protocol in quantum communication, allowing two classical bits to be transmitted by sending a single qubit when a maximally entangled pair is shared. In this work, we consider Embedded Dense Coding (EDC)-a generalization of deterministic dense coding that embeds one subsystem into a higher-dimensional Hilbert space. To assess the operational advantage of EDC compared to standard dense coding, we consider the probability of transmission error when fixing the rate of entanglement consumed per classical message sent. We first demonstrate that EDC enables a smaller one-shot transmission error compared to standard dense coding when using quantum channels with nonzero rates of dephasing and loss. We then demonstrate that even with noiseless communication channels, EDC leads to smaller overall errors when the sender and receiver have noisy local processors. This advantage is shown through concrete implementations of EDC on IBM's Heron processor.