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:1210.2856

Quantum Hyperdense Coding for Distributed Communications

Sándor Imre

Published Oct 10, 2012• 2 citations
arXivHTMLPDF

Abstract

Superdense coding proved that entanglement-assisted quantum communications can improve the data transmission rates compared to classical systems. It allows sending 2 classical bits between the parties in exchange of 1 quantum bit and a pre-shared entangled Bell pair. This paper introduces a new protocol which is intended for distributed communication. Using a pre-shared entangled Bell pair and 1 classical bit 2,5 classical bits can be transmitted in average. This means not only valuable increase in capacity but the two-way distributed operation opens new fields of investigation.

DOI
10.48550/arxiv.1210.2856

Related papers

Modified quantum superdense coding for distributed communications

Sándor Imre

SUMMARY The efficiency of medium access control strongly influences the performance of distributed wireless networks. Collisions in the channel and unused timeslots result in poor performance. On the other hand, quantum superdense coding proved that entanglement‐assisted quantum communications can improve the data transmission rates compared with classical systems. It allows sending two classical bits from one party to another in exchange of one quantum bit and a pre‐shared entangled Bell pair. This paper introduces a new protocol, which involves a modified version of superdense coding to medium access control of distributed communication systems. Using a pre‐shared entangled Bell pair and one classical bit, 2.5 classical bits can be transmitted in average between the parties in each timeslot. This means not only valuable increase in capacity, but the two‐way distributed operation opens new fields of investigation. Copyright © 2014 John Wiley & Sons, Ltd.

International Journal of Communication Systems•Jul 25, 2014•5 citations

Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement

Kristian Skafte Jensen, Lorenzo Valentini, René Bødker Christensen +2 more

We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of the proposed protocol, we consider its data rate and resource usage, and we analyse this both in an ideal setting with no decoherence, and in a more realistic setting where decoherence must be taken into account. In the ideal case, the proposal offers a 50% increase in both data rate and resource usage efficiency compared to conventional protocols. Even when decoherence is taken into consideration, the quantum protocol performs better as long as the decoherence time is not extremely short. Finally, we present the results of implementing the protocol in a computer simulation based on the Netsquid framework. We compare the simulation results with the theoretical values.

arXiv:2309.02837•IEEE Transactions on Quantum Engineering•Jan 1, 2025•9 citations

Quantum Authentication Protocol for Secure Quantum Superdense Coding

Teo Kim, Jinsuk Baek, John T. Yi

In quantum information theory, superdense coding allows two network entities to exchange two classical bits via a quantum channel using a single quantum bit (qubit) transmission, provided they have pre-shared an entangled qubit. An attacker intercepting the qubit during transmission cannot extract meaningful data without the other entangled qubit from the pair. However, an attacker can disrupt the communication by introducing its own qubit to the receiver. To enhance the security of superdense coding, we propose an authentication mechanism through a classical communication channel.

IEEE SoutheastCon•Mar 15, 2024•3 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

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

Non-binary classical error-correcting codes for quantum communication

Christopher Boyd, Renaud-Alexandre Pitaval, Ülo Parts +1 more

We investigate the use of non-binary classical error-correcting codes in facilitating reliable, entanglement-assisted communication of classical information over quantum depolarising channels. A classical-quantum communication system is presented, which relies on error-correction in the classical domain to achieve an information rate that approaches the entanglement-assisted capacity of the quantum channel. Classical information is transmitted over the channel by means of the superdense coding protocol, and the impact of the noisy distribution of initial entanglement resources on the achievable information rate is considered. In this context, the transmission model is equivalent to a non-binary discrete symmetric classical channel, which motivates the use of non-binary error-correcting codes capable of exploiting correlations between the pairs of classical bits communicated via the superdense coding protocol. We illustrate this principle by showing that duo-binary turbo codes significantly outperform binary turbo codes in the considered scenarios.

International Conference on Communications•Jun 1, 2015•5 citations
Superdense coding proved that entanglement-assisted quantum communications can improve the data transmission rates compared to classical systems. It allows sending 2 classical bits between the parties in exchange of 1 quantum bit and a pre-shared entangled Bell pair. This paper introduces a new protocol which is intended for distributed communication. Using a pre-shared entangled Bell pair and 1 classical bit 2,5 classical bits can be transmitted in average. This means not only valuable increase in capacity but the two-way distributed operation opens new fields of investigation.
SUMMARY The efficiency of medium access control strongly influences the performance of distributed wireless networks. Collisions in the channel and unused timeslots result in poor performance. On the other hand, quantum superdense coding proved that entanglement‐assisted quantum communications can improve the data transmission rates compared with classical systems. It allows sending two classical bits from one party to another in exchange of one quantum bit and a pre‐shared entangled Bell pair. This paper introduces a new protocol, which involves a modified version of superdense coding to medium access control of distributed communication systems. Using a pre‐shared entangled Bell pair and one classical bit, 2.5 classical bits can be transmitted in average between the parties in each timeslot. This means not only valuable increase in capacity, but the two‐way distributed operation opens new fields of investigation. Copyright © 2014 John Wiley & Sons, Ltd.
We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of the proposed protocol, we consider its data rate and resource usage, and we analyse this both in an ideal setting with no decoherence, and in a more realistic setting where decoherence must be taken into account. In the ideal case, the proposal offers a 50% increase in both data rate and resource usage efficiency compared to conventional protocols. Even when decoherence is taken into consideration, the quantum protocol performs better as long as the decoherence time is not extremely short. Finally, we present the results of implementing the protocol in a computer simulation based on the Netsquid framework. We compare the simulation results with the theoretical values.
In quantum information theory, superdense coding allows two network entities to exchange two classical bits via a quantum channel using a single quantum bit (qubit) transmission, provided they have pre-shared an entangled qubit. An attacker intercepting the qubit during transmission cannot extract meaningful data without the other entangled qubit from the pair. However, an attacker can disrupt the communication by introducing its own qubit to the receiver. To enhance the security of superdense coding, we propose an authentication mechanism through a classical communication channel.
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 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 investigate the use of non-binary classical error-correcting codes in facilitating reliable, entanglement-assisted communication of classical information over quantum depolarising channels. A classical-quantum communication system is presented, which relies on error-correction in the classical domain to achieve an information rate that approaches the entanglement-assisted capacity of the quantum channel. Classical information is transmitted over the channel by means of the superdense coding protocol, and the impact of the noisy distribution of initial entanglement resources on the achievable information rate is considered. In this context, the transmission model is equivalent to a non-binary discrete symmetric classical channel, which motivates the use of non-binary error-correcting codes capable of exploiting correlations between the pairs of classical bits communicated via the superdense coding protocol. We illustrate this principle by showing that duo-binary turbo codes significantly outperform binary turbo codes in the considered scenarios.