Entangled states
In Eq. 3.50 we used the tensor product to build a two-qubit state from two single-qubit states.
In Section 3.2.3, we saw that these product states are exactly those states that can be constructed by applying local quantum operations to (a product state itself).
Now, there also exist two-qubit states that are not product states.
We call these states entangled, and as we will see they are very important for quantum computing.
How can we determine if a state is a product state or not?
Even though quantum states are specified by amplitudes and not by probabilities, we can use the same method that we used in Section 3.1.8 for detecting whether a probability distribution is correlated.
Given a two-qubit state in the form (3.31), we first use Eq. 3.29 to compute
|
|
|
(3.67) |
Then, is a product state if and only if .
In this way, entangled states are analogous to correlated probability distributions.
A simple but important example of an entangled two-qubit state is
|
|
|
(3.68) |
This state is analogous to a pair of perfectly correlated random bits from Eq. 3.28.
It is entangled since
|
|
|
We call the maximally entangled state of two qubits (although neither the reason for this name nor the peculiar notation are very clear at this point).
How can we build entangled states?
Just like when we wanted to build correlated states of two bits, we can use the controlled-NOT operation to make two quantum bits interact.
For example, the following sequence of operations prepares the maximally entangled state :
Let us quickly verify this:
|
|
|
Note that applying the CNOT directly to , or for that matter to any other basis state, would have not worked (see Eq. 3.63).
(Another entangled state).
-
1.
Verify that the state is entangled.
-
2.
Find a sequence of operations in Quirky that prepares the state .
Hint: You may need to create a suitable rotation.
-
3.
What are the probabilities of measurement outcomes when measuring both qubits of ? Use Quirky to confirm your result.
.
-
1.
We calculate . The fact that this is non-zero implies that is entangled.
-
2.
We can get the two desired amplitudes from and .
This suggests that we use a rotation with angle in the following way:
This does indeed the job:
|
|
|
|
|
|
|
|
-
3.
We get with probability and with probability . Indeed:
The maximally entangled state in Eq. 3.68 is one of a family of four states, called the Bell states.
The Bell states are defined as follows:
|
|
|
|
(3.69) |
|
|
|
|
(3.70) |
|
|
|
|
(3.71) |
|
|
|
|
(3.72) |
They are named after John Steward Bell, who was one of the first to recognize the remarkable features of quantum entanglement.
How can we create these four Bell states?
We saw above that we can obtain by applying a Hadamard and a CNOT operation to the basis state .
It is an easy exercise to verify that the other three Bell states can be constructed similarly, that is, by applying the same sequence of operations to the other three basis states.
In other words, if we define
(3.73)
then
|
|
|
|
|
|
(Preparing Bell states).
Draw how you would create the other three Bell states in Quirky: , , and .
Solution.
-
•
:
-
•
:
-
•
:
(Discriminating Bell states).
Alice’s donkey robot got lost while on an exploration mission!
It wants to urgently let Alice know of its position so that she can come to its rescue.
The donkey is located in one of the four neighborhoods surrounding the school.
To communicate which one, the donkey sends a two-qubit quantum message , where tells the coordinate and tells the coordinate of its location:
Unfortunately, Alice’s evil classmate Eve is jamming the signal and what Alice receives instead is one of the four Bell states as shown above.
Help Alice to correctly decode the signal and locate her donkey robot!
That is, find a sequence of operations that maps each of the four Bell states back onto the corresponding basis state .
Solution.
Note that this is the same as inverting the operation in Eq. 3.73.
Recall that .
This is a composite operation, so recall from 2.5 that
Recall from Eq. 3.66 that is the inverse of itself, i.e., .
It is also true that (this holds for any reflection, in fact).
This implies that we can undo by applying the same two operations but in reverse order:
That is, we first apply and then on the first qubit, as in: