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.
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.
This study presents a generalized
n--bit superdense coding protocol that enables the transmission of n classical bits of information using an entangled
n--qubit quantum system and the transmission of
n−1 qubits. The protocol involves creating a maximally entangled
n--qubit GHZ state, encoding the classical message with Pauli--Z and Pauli--X gates, and then transmitting and decoding the message via quantum communication, quantum operations, and measurements. The key novelty of this work is an explicit, scalable
n--bit encoding routine, realized on the GHZ channel with a low--depth encoding layer using only single--qubit Pauli--X and Pauli--Z operations.
The protocol was tested on real quantum hardware using Qiskit 2.0 and the IBM--Fez quantum computer for message lengths of 4, 6, 8, and 10 bits, as a circuit--level proof of concept on a single processor; the physical transmission of qubits between the parties was not implemented. Results show that success rates decrease as message length, transpiled circuit depth and gate count increase; the latter two are set mainly by transpilation rather than by the encoding itself. A mutual information analysis shows that the transmitted information exceeds the classical bound of
n−1 bits only for short messages. Strategies to improve performance include sending messages in shorter segments and advances in qubit coherence and gate fidelity. This work offers a practical and easily scalable quantum communication protocol with potential applications in quantum networks and communication systems.