# Superdense coding

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
(Learn how and when to remove this template message) |

In quantum information theory, **superdense coding** is a quantum communication protocol to transmit two classical bits of information (i.e., either 00, 01, 10 or 11) from a sender (often called Alice) to a receiver (often called Bob), by sending only one qubit from Alice to Bob, under the assumption of Alice and Bob pre-sharing an entangled state.^{[1]}^{[2]} This protocol was first proposed by Bennett and Weisner in 1992 and experimentally actualized in 1996 by Mattel, Weinfurter, Kwiat and Zeilinger using entangled photon pairs.^{[2]} By performing one of four quantum gate operations on the (entangled) qubit she possesses, Alice can prearrange the measurement Bob makes. After receiving Alice's qubit, operating on the pair and measuring both, Bob has two classical bits of information. If Alice and Bob do not already share entanglement before the protocol begins, then it is impossible to send two classical bits using 1 qubit, as this would violate Holevo's theorem.

Superdense coding is the underlying principle of secure quantum secret coding. The necessity of having both qubits to decode the information being sent eliminates the risk of eavesdroppers intercepting messages.^{[3]}

It can be thought of as the opposite of quantum teleportation, in which one transfers one qubit from Alice to Bob by communicating two classical bits, as long as Alice and Bob have a pre-shared Bell pair.^{[4]}

## Contents

## Overview[edit]

Suppose Alice wants to send two classical bits of information (00, 01, 10, or 11) to Bob using qubits (instead of classical bits). To do this, an entangled state (e.g. a Bell state) is prepared using a Bell circuit or gate by Charlie, a third person. Charlie then sends one of these qubits (in the Bell state) to Alice and the other to Bob. Once Alice obtains her qubit in the entangled state, she applies a certain quantum gate to her qubit depending on which two-bit message (00, 01, 10 or 11) she wants to send to Bob. Her entangled qubit is then sent to Bob who, after applying the appropriate quantum gate and making a measurement, can retrieve the classical two-bit message. Alice must tell Bob which gate to apply after he receives the entangled qubit in order to obtain the correct classical bits.

## The protocol[edit]

The protocol can be split into five different steps: preparation, sharing, encoding, sending, and decoding.

### Preparation[edit]

The protocol starts with the preparation of an entangled state, which is later shared between Alice and Bob. Suppose the following Bell state

where denotes the tensor product, is prepared. Note: we can omit the tensor product symbol and write the Bell state as

- .

### Sharing[edit]

After the preparation of the Bell state , the qubit denoted by subscript *A* is sent to Alice and the qubit denoted by subscript *B* is sent to Bob (note: this is the reason these states have subscripts). At this point, Alice and Bob may be in completely different locations (which might be very distant from each other).

There may be a long period of time between the preparation and sharing of the entangled state and the rest of the steps in the procedure.

### Encoding[edit]

By applying a quantum gate to her qubit locally, Alice can transform the entangled state into any of the four Bell states (including, of course, ). Note that this process cannot "break" the entanglement between the two qubits.

Let's now describe which operations Alice needs to perform on her entangled qubit, depending on which classical two-bit message she wants to send to Bob. We'll later see why these specific operations are performed. There are four cases, which correspond to the four possible two-bit strings that Alice may want to send.

1. If Alice wants to send the classical two-bit string 00 to Bob, then she applies the identity quantum gate, , to her qubit, so that it remains unchanged. The resultant entangled state is then

In other words, the entangled state shared between Alice and Bob has not changed, i.e. it is still . The notation is also used to remind us of the fact that Alice wants to send the two-bit string 00.

2. If Alice wants to send the classical two-bit string 10 to Bob, then she applies the quantum *phase-flip* gate to her qubit, so the resultant entangled state becomes

3. If Alice wants to send the classical two-bit string 01 to Bob, then she applies the quantum *NOT* (or *bit-flip*) gate, , to her qubit, so that the resultant entangled quantum state becomes

4. If, instead, Alice wants to send the classical two-bit string 11 to Bob, then she applies the quantum gate to her qubit, so that the resultant entangled state becomes

The matrices and are two of the Pauli matrices. The quantum states , , and (or, respectively, and ) are the Bell states.

### Sending[edit]

After having performed one of the operations described above, Alice can send her entangled qubit to Bob using a quantum network through some conventional physical medium.

### Decoding[edit]

In order for Bob to find out which classical bits Alice sent he will perform the CNOT unitary operation, with A as control qubit and B as target qubit. Then, he will perform unitary operation on the entangled qubit A. In other words, the Hadamard quantum gate H is only applied to A (see the figure above).

- If the resultant entangled state was then after the application of the above unitary operations the entangled state will become
- If the resultant entangled state was then after the application of the above unitary operations the entangled state will become
- If the resultant entangled state was then after the application of the above unitary operations the entangled state will become

These operations performed by Bob can be seen as a measurement which projects the entangled state onto one of the four two-qubit basis vectors or (as you can see from the outcomes and the example below).

#### Example[edit]

For example, if the resultant entangled state (after the operations performed by Alice) was , then a CNOT with A as control bit and B as target bit will change to become . Now, the Hadamard gate is applied only to A, to obtain

For simplicity, let's get rid of the subscripts, so we have

Now, Bob has the basis state , so he knows that Alice wanted to send the two-bit string 01.

## Security[edit]

Superdense coding is a form of secure quantum communication.^{[3]} If an eavesdropper, which may be referred to as Eve, intercepts Alice's qubit en route to Bob, all that is obtained by Eve is part of an entangled state. Without access to Bob's qubit, Eve is unable to get any information from Alice's qubit. A third party is unable to eavesdrop on information being communicated through superdense coding and an attempt to measure either qubit would collapse the state of that qubit and alert Bob and Alice.

## General dense coding scheme[edit]

General dense coding schemes can be formulated in the language used to describe quantum channels. Alice and Bob share a maximally entangled state *ω*. Let the subsystems initially possessed by Alice and Bob be labeled 1 and 2, respectively. To transmit the message *x*, Alice applies an appropriate channel

on subsystem 1. On the combined system, this is effected by

where *I* denotes the identity map on subsystem 2. Alice then sends her subsystem to Bob, who performs a measurement on the combined system to recover the message. Let the *effects* of Bob's measurement be *F _{y}*. The probability that Bob's measuring apparatus registers the message

*y*is

Therefore, to achieve the desired transmission, we require that

where *δ _{xy}* is the Kronecker delta.

## Experimental[edit]

The protocol of superdense coding has been actualized in several experiments using different systems to varying levels of channel capacity and fidelities. In 2004, trapped beryllium 9 ions were used in a maximally entangled state to achieve a channel capacity of 1.16 with a fidelity of 0.85^{[5]}. In 2017, a channel capacity of 1.665 was achieved with a fidelity of 0.87 through optical fibers^{[6]}. High dimensional ququarts were used to exceed a channel capacity of 2, at 2.09 with a fidelity of 0.98^{[7]}. Nuclear Magnetic Resonance (NMR) has also been used to share among three parties^{[8]}.

## References[edit]

**^**Bennett, C.; Wiesner, S. (1992). "Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states".*Physical Review Letters*.**69**(20): 2881. doi:10.1103/PhysRevLett.69.2881. PMID 10046665.- ^
^{a}^{b}Nielsen, Michael A.; Chuang, Isaac L. (9 December 2010). "2.3 Application: superdense coding".*Quantum Computation and Quantum Information: 10th Anniversary Edition*. Cambridge University Press. p. 97. ISBN 978-1-139-49548-6. - ^
^{a}^{b}Template:Wang, C., Deng, F.-G., Li, Y.-S., Liu, X.-S., & Long, G. L. (2005). Quantum secure direct communication with high-dimension quantum superdense coding. Physical Review A, 71(4). **^**Wilde, Mark (18 April 2013).*Quantum Information Theory*. Cambridge University Press. p. 181. ISBN 978-1-107-03425-9.**^**Template:Schaetz, T., Barrett, M. D., Leibfried, D., Chiaverini, J., Britton, J., Itano, W. M., … Wineland, D. J. (2004). Quantum Dense Coding with Atomic Qubits. Physical Review Letters, 93(4).**^**Template:Williams, B. P., Sadlier, R. J., & Humble, T. S. (2017). Superdense Coding over Optical Fiber Links with Complete Bell-State Measurements. Physical Review Letters, 118(5).**^**Template:Hu, X.-M., Guo, Y., Liu, B.-H., Huang, Y.-F., Li, C.-F., & Guo, G.-C. (2018). Beating the channel capacity limit for superdense coding with entangled ququarts. Science Advances, 4(7), eaat9304.**^**Template:Wei, D., Yang, X., Luo, J., Sun, X., Zeng, X., & Liu, M. (2004). NMR experimental implementation of three-parties quantum superdense coding. Chinese Science Bulletin, 49(5), 423–426.