In this article we will introduce superdense coding, a scheme which lets Alice send two bits of (classical) information to Bob by transmitting a single entangled qubit. This article will be mathematically rigorous, while hopefully also providing an intuitive explanation of what is really going on. We will assume an undergraduate understanding of quantum mechanics, including familiarity with Dirac notation and entanglement.
where and are complex numbers such that . It would seem from (1) that if Alice wished to encode some information in her state and then send it to Bob, she has a lot of freedom in her choice of and . In comparison to a classical bit, which can only take discrete values of or , it seems like a qubit is infinitely more powerful! However, there’s a big catch.
To access this information Bob needs to measure the qubit, and (assuming he measures in the basis) his result will be either or , with probability and respectively. Once he does this the state is lost, and he can gain no more information. Thus the only way that Alice can deterministically transfer information is to send either the state or the state, in which case Bob can measure it to receive one bit of information. If Alice sends anything else, Bob won’t be able to draw a conclusion from a single measurement, after which the original state will be lost. Despite all the extra freedom we have in a qubit, the probabilistic nature of quantum measurement seems to imply we can’t do any better than with a classical bit.
It turns out however that if Alice and Bob start off by sharing an entangled state, Alice can deterministically transfer two bits of information with a single qubit, by using a scheme called ‘superdense coding’. We can think of this as them sharing one bit of entanglement, which together with the transfer of one qubit leads to two bits of information. This idea was introduced in 1992 by Charles Bennet and Stephen Wiesner (see References below for the paper link).
2. Some quantum gates
We will begin by defining four operators which Alice and Bob will use. Firstly there is the Pauli , which flips a qubit:
Next there is the Pauli operator, which flips the phase of the bit:
The Hadamard operator sends the qubits to two orthogonal superpositions:
Finally there is the only two-qubit gate we will need, the controlled not (CNOT) gate. This takes two qubits; if the first (the control) is , it leaves the whole state unchanged:
If the control qubit is however then CNOT flips the target:
3. The superdense coding protocol
In the equation above, represents Alice’s qubit being . Because this system is entangled, Alice’s and Bob’s states are intrinsically linked. This is best thought of as a single bipartite system rather than two individual qubits, and so local operations on Alice’s state will affect the state of the system as a whole.
Suppose Alice has two classical bits to encode, and , each of which takes value either or . She encodes the first bit in the parity of her’s and Bob’s states, i.e. whether they are the same or different. If is she does nothing, and so from (14) Alice’s and Bob’s qubits will be the same. If is she applies a gate to her state, flipping it and resulting in the state
Thus her’s and Bob’s qubits will always be measured to be opposite.
Alice encodes her second bit in the phase between the two states in the superposition. If is she again does nothing, however if is she applies the gate to her state, which will result in a minus sign between the two states.
As we mentioned belfore, even though Alice is applying these operators locally to her state, the system is an entangled bipartite state, and so we can think of her as applying global operators , Pauli operators tensored with the identity, to the whole system. After Alice’s operations, if the global state will be
where in both cases the sign is positive if , and negative if . Again we note that is encoded in the parity, whether Alice or Bob’s quibts are the same or different, and in the phase between the two superpositions. This phase is the new degree of freedom which we get from entanglement.
Alice then sends her single qubit to Bob, who now possess both states of the bipartite system. Even though Alice has only transmitted a single qubit, because their states were entangled Bob may recover both of the operations that Alice performed. To do this Bob performs the following steps:
- To measure the parity Bob applies the CNOT gate on the system, using Alice’s bit as the control. If , this will send (16) to
and if this will send (17) to
Bob could now deterministically read out the value of simply by performing a measurement on his qubit!
- To measure the phase, Bob applies the Hadamard gate to Alice’s qubit. Looking at the two equations above, we see that regardless of Bob’s qubit, Alice’s is in the superposition
where the sign is positive if and negative if . In the former case the Hadamard gate will send this to , and in the latter to .
We can see then that after this protocol, Bob has the state:
He may therefore perform a single measurement on the two qubits he possess, and in doing so learn the value of both bits and ! Alice thus used one qubit, and one bit of entanglement, to transmit two bits of information to Bob.
u/RRumpleTeazzer pointed out that this protocol still involves the transmission of two qubits. We could imagine this as Alice first prepares the entangled state superposition , sends one of the qubits to Bob, and then performs the superdense coding protocol on her remaining qubit before sending this to him as well. So really, this is Alice sending two classical bits via two qubits.
What I think still makes this process surprising from a classical point of view is that all of Alice’s encoding happens after Bob already has the first qubit. They begin by sharing the resource of an entangled state, Alice encodes two classical bits on her qubit, and then sends this to Bob who can decode them both. Of course from the quantum point of view this is perfectly natural; since this is a bipartite entangled state, it is better to think of Alice performing operations on the global state , rather than on ‘her qubit’. As u/RRumpleTeazzer’s says, ‘delayed choice coding’ is perhaps an equally good name.
u/NidStyles and u/gabeff asked about experimental implementations of superdense coding. The first implementation was in 1996 (see References) and used photons as qubits, where and were the Horizontal and Vertical polarisation states and . The initial superposition was created using a process called ‘spontaneous parameteric downconversion’, where a nonlinear crystal creates pairs of photons whose polarisations are entangled with each other:
The problem with this experiment however was that Bob could only measure three of Alice’s four possible messages. These four messages were:
The experimenters interfered these in such a way that you could distinguish states which were symmetric in interchanging the photons from states which were anti-symemtric. We can see above that is the only anti-symmetric state (if you swap the two photons this is the only one which picks up a minus sign), and so this one could be immediately read out. For the other three, they passed them through a scheme which could determine if the photons had the same or different polarisations. If they were different, this corresponded to . If they were the same however it could be either of or , with no way of distinguishing them further.
These difficulties were resolved in a later experiment in 2008 (again see References). In this, each qubit was composed two photons rather than one, with the first of each pair entangled in polarisation, and the second in angular momentum. This extra degree of freedom allowed the experimenters to distinguish the four possible messages.
Because of the intricacies of the setups, both of these should be seen as more ‘proof of principle’ than scalable methods for quantum communication.
John Watrous’s Lecture Notes ‘Introduction to Quantum Computing (Winter 2006)’.
See Lecture 3: ‘Superdense coding; quantum circuits; and partial measurements’ – https://cs.uwaterloo.ca/~watrous/LectureNotes.html.
The Wikipedia page on ‘Superdense coding’: https://en.wikipedia.org/wiki/Superdense_coding
Also check out the original paper:
Bennett, C. H., & Wiesner, S. J. (1992). Communication via one- and two-particle operators on Einstein-Podolsky- Rosen states. Physical Review Letters, 69(20), 2881–2884. http://doi.org/10.1103/PhysRevLett.69.2881
The first experimental implementation was in 1996 using photons as qubits, however in this one Bob could only recover three out of the four possible messages:
Mattle, K., Weinfurter, H., Kwiat, P. G., & Zeilinger, A. (1996). Dense coding in experimental quantum communication. Physical Review Letters, 76(25), 4656–4659. http://doi.org/10.1103/PhysRevLett.76.4656
A newer implementation in 2008 allowed Bob to decode all four messages. This was done by composing each qubit of two photons, rather than one:
Barreiro, J. T., Wei, T. C., & Kwiat, P. G. (2008). Beating the channel capacity limit for linear photonic superdense coding. Nature Physics, 4(4), 282–286. http://doi.org/10.1038/nphys919
LaTeX and document formatting was done via the amazing tool LaTeX to WordPress: