4.2.3 Quantum teleportation
While it is not possible to clone quantum bits, we can certainly move quantum bits from one place to another. Indeed, any qubit is stored inside some physical object or particle that carries the qubit. For example, if Alice stores her qubit as the polarization of a photon, she can simply send this photon to Bob. What is more surprising, however, is that one can move a quantum bit from one place to another by sending a finite number of classical bits (in fact, two bits suffice). The reason this is surprising is because a general qubit state is specified by an arbitrary angle , see Eq. 2.5, which generally cannot be encoded in a finite number of bits. Because of this surprising property this procedure is known as teleportation. We will see shortly that we need entanglement to make it work!
The starting point for teleportation is the following scenario. We imagine that Alice has two qubits and Bob has one qubit. Alice’s first qubit is the message qubit that she wants to send to Bob, and it starts out in some arbitrary state – which may well be unknown to Alice herself! Her second qubit and Bob’s qubit are in a maximally entangled state . Thus, the three qubits are in the following state:
where the first two qubits belong to Alice and the last qubit belongs to Bob (recall from Eq. 3.69 that is a two-qubit state). The following Quirky circuit shows what this looks like in case that Alice wants to send a qubit in state :
What should be the next step? Eventually, the goal is for Bob to obtain Alice’s qubit – since we cannot clone the qubit, this means that Alice has to perform some action that ‘destroys’ her qubit. A good way of going about this is to perform a measurement. But simply measuring Alice’s two qubits will do them no good, since we know that we cannot infer the state of from a single measurement. This means that Alice should first apply some quantum operation on both of her qubits and then measure them. It turns out that the correct strategy for her is to perform the same operations that you used to discriminate the four Bell states in 3.13:
Note that in this example Alice’s four measurement outcomes occur with 25% each. Here is another example, corresponding to the situation where Alice tries to teleport the state instead:
It seems that, whatever the state of Alice’s message qubit, the four probabilities are always the same. This is already encouraging, since it means that the measurement gives Alice no information at all about her message qubit! Recall that we want her initial state to end up completely with Bob, meaning that she should not extract or keep any information about this state around.
In general, the state right before Alice’s measurements looks as follows:
Note that we have to be careful, since the last two tensor products are not aligned (cf. 4.3). Thus we compute:
This is the overall state right before Alice’s measurement. We can compute the probability of her measurement outcomes as discussed in Eq. 4.14. Namely, to compute the probability of outcome we simply add the squared amplitudes of the relevant basis states and . In each case, one of the amplitudes is and the other is , so their squares always sum to the same result:
Each outcome occurs with 25%. This confirms what we previously observed with Quirky.
After Alice’s measurement, the only remaining quantum bit is Bob’s qubit. Let us denote its state by , since it depends on Alice’s measurement outcome. We can determine it using Eq. 4.15 or, much easier, using the grouping and normalization method in Eq. 4.13. Either way, the result is that Bob’s qubit is in one of the following four states:
When , Bob’s state coincides exactly with Alice’s original state that she wanted to teleport:
In the other three cases Bob’s quantum state is slightly garbled. However, if Alice sends her measurement outcomes (i.e., the two bits and ) to Bob then he can apply an appropriate correction operation to ‘fix up’ his state:
These four cases can be summarized in the following simple procedure for Bob:
-
1.
look at bit and if then apply ,
-
2.
look at bit and if then apply .
We can implement this using a controlled-NOT and a controlled- operation, where the controls are classical bits. You can create the controlled-Z operation in the same way as the controlled NOT operation – we discussed this at the end of Section 3.2.4. Phew, this was quite a bit of work!
What does all this look like in Quirky? The end result is the following quantum circuit:
We added a gray box about the relevant part – the teleportation circuit – to separate it from the rest of the circuit that creates the input states. Here is a picture that shows only the teleportation circuit and the creation of the maximally entangled state, without specifying Alice’s first qubit:
We also cut off the wires for Alice’s two classical bits, since they are no longer of interest once Alice has sent the two measurement outcomes to Bob. We also removed the probability display, since it is not an actual quantum operation but just a way for us to inspect the circuit in Quirky. Thus, there is one input qubit for Alice’s message, two qubits for the maximally entangled state, and one output qubit on Bob’s side. The effect of the teleportation is simply to pass through an arbitrary state from the input qubit on Alice’s side to the output qubit on Bob’s side. Crucially, inside the box, only classical bits are being sent from Alice to Bob!
Let’s make sure that we didn’t make a mistake. Since we expect that Bob’s qubit ends up in state after the teleportation procedure, we can add a simple measurement to test if this is indeed what happened:
Indeed, we get outcome 1 with 100% probability, which confirms that we successfully teleported the state! Now, is not a particularly interesting state to teleport. How about the state, which caused us trouble before when we discussed cloning? In the following homework you will test the teleportation circuit first for the state and then for arbitrary single-qubit states.
Homework 4.2 (Testing teleportation).
Hack.
-
1.
On the one hand, , so Alice is indeed trying to teleport the right state. On the other hand, Bob’s probability display shows that the state right before the measurement is . Since , this means that the state before the Hadamard gate was . This is what we wanted to check.
-
2.
We can use the same method as in the previous part of this problem, but this time Alice can apply to the state to prepare the state . If this state is correctly teleported, then Bob ends up with his qubit being in the state , and hence if he applies to his qubit, he should end up with his qubit being in the state . Using Quirky, we can confirm that Bob, after the application of indeed measures with probaility , (or equivalently, that he measures with ). This confirms that Bob’s qubit just before the application of was in the state , and hence proves that the state was correctly teleported.
The teleportation circuit is quite remarkable. It allows to send a quantum bit from Alice to Bob by transmitting two classical bits only, provided that Alice and Bob share a maximally entangled state. However, it is not only useful for applications (we will discuss some of them below), but it also gives some interesting perspective on the difference between classical and quantum bits. Recall that at the end of last week we discussed superdense coding, which allowed us to send two bits by transmitting a single quantum bit, again using one maximally entangled state beween Alice and Bob. This shows that:
Given a free supply of quantum entanglement, sending two bits is
completely equivalent to sending one quantum bit!
Note that in neither teleportation nor superdense coding can we reuse the maximally entangled state once the procedure is finished – it is the ‘fuel’ that is consumed by either procedure.