Today, we derived Bell's inequality in the form in Nielsen and Chuang, and talked about the no-cloning theorem, superdense coding, and teleportation. The no-cloning theorem says that if you have one copy of an unknown quantum state | ψ ⟩, you cannot produce two copies of it. To prove the no-cloning theorem, we need to show that the map

| ψ ⟩ ⊗ | 0 ⟩ → | ψ ⟩ ⊗ | ψ ⟩is not unitary. We can easily do this by checking that it does not preserve inner products. This is a straightforward calculation. To be rigorous, we might also want to make sure that there isn't a way of cloning that also produces some extra garbage. This may seem like splitting hairs, but it might actually be a real concern in some situations. Surprisingly, the map that comes closest to cloning quantum states, mapping | ψ ⟩ to two close but imperfect copies of | ψ ⟩, really does produce extra garbage. To prove this stronger version, we need to show that the map

| ψ ⟩ ⊗ | 0 ⟩ ⊗ | 0 ⟩ → | ψ ⟩ ⊗ | ψ ⟩ ⊗ | φ ⟩is not unitary, where | φ ⟩ may depend on | ψ ⟩. This is also easy, as a straightforward calculation shows that this map also does not preserve inner products.

I next talked about superdense coding and teleportation. For these, we need some facts about Bell states. It is fairly easy to show that

1/√2 σThus, you can obtain each of the four Bell states by starting with 1/√2 ( | 00 ⟩ + | 11 ⟩ ), and applying one of the four Pauli matrices to the first qubit (we will take the identity matrix to be the fourth Pauli matrix, and call it σ_{x}⊗ id ( | 00 ⟩ + | 11 ⟩ ) = 1/√2 ( | 01 ⟩ + | 10 ⟩ )

1/√2 σ_{z}⊗ id ( | 00 ⟩ + | 11 ⟩ ) = 1/√2 ( | 00 ⟩ − | 11 ⟩ )

1/√2 σ_{y}⊗ id ( | 00 ⟩ + | 11 ⟩ ) = −i/√2 ( | 01 ⟩ − | 10 ⟩ )

Superdense coding is a process where Alice and Bob start out sharing a Bell state

1/√2 ( | 00 ⟩(any of the other three Bell states would work just as well). Here, the A and B subscripts mean that Alice holds the first qubit and Bob the second. In superdense coding, Alice sends Bob one qubit, and conveys two bits of classical information to him. The process destroys the shared Bell state. This violates Holevo's bound, one of the corollaries of which is that one qubit can carry only one bit. The catch, of course, is that for Holevo's bound to apply, Alice and Bob cannot start off sharing any qubits._{AB}+ | 11 ⟩_{AB})

How do Alice and Bob do superdense coding? Alice takes her
qubit from the Bell state, and applies the unitary transformation
given by one of the four Pauli matrices to it, producing one of the
four Bell states. She then sends her half
of the Bell state to Bob. Now Bob holds both halves of the Bell
state. As all four Bell states are orthogonal, he can identify which
one he has (e.g., by measuring the commuting observables
J_{x}^{2},
J_{y}^{2},
J_{z}^{2}
as we saw in a previous lecture). Now that he knows Bell state he has,
Bob can deduce which of the Pauli matrices Alice applied.

Quantum teleportation is a kind of dual procedure to superdense coding. In this case, Alice and Bob share a Bell state, and Alice holds an unknown qubit | ψ ⟩. Alice can send two bits to Bob and manage thereby to let Bob prepare a qubit in the same state | ψ ⟩ as her unknown qubit (the process destroys Alice's qubit, and thus does not violate the no-cloning theorem).

How does teleportation work? In teleportation, Alice performs the same measurements that Bob made in superdense coding, and Bob performs the same Pauli transforms as Alice did in superdense coding. I gave two different versions of the calculation showing that teleportation works. A third (using quantum gates) is in the textbook Nielsen and Chuang. I am going to only give the second proof in these notes. The first proof is quite similar to Nielsen and Chuang's, and the proof I am giving shows explicitly how teleportation is related to the properties of Bell states and Pauli matrices.

Suppose that Alice has an unknown qubit

| ψ ⟩and Alice and Bob share two qubits in the Bell state_{A1}= α | 0 ⟩_{A1}+ β | 1 ⟩_{A1}

1/√2 ( | 00 ⟩Here, I am being even more precise than I was in class, in that I am distinguishing between Alice's first and second qubit. The state of all three qubits is_{A2B}+ | 11 ⟩_{A2B}).

1/√2 | ψ ⟩Now, suppose Alice makes the Bell state measurement on the first two qubits. Her state will be projected onto one of the four Bell states, that is, she effectively applies one of the projection operators_{A1}( | 00 ⟩_{A2B}+ | 11 ⟩_{A2B}).

1/√2 (where in σ_{A1A2}⟨ 00 | +_{A1A2}⟨ 11 | ) (id ⊗ σ_{d})

1/2 (where the id applies to qubit A_{A1A2}⟨ 00 | +_{A1A2}⟨ 11 | ) (id ⊗ σ_{d}) | ψ ⟩_{A1}( | 00 ⟩_{A2B}+ | 11 ⟩_{A2B})

1/2 (and taking the inner product gives us_{A1A2}⟨ 00 | ψ ⟩_{A1}+_{A1A2}⟨ 11 | ψ ⟩_{A1}) (σ_{d}⊗ id_{B}) ( | 00 ⟩_{A2B}+ | 11 ⟩_{A2B})

1/2 ( αNow, since the σ_{A2}⟨ 0 | + β_{A2}⟨ 1 | ) (σ_{d}⊗ id_{B}) ( | 00 ⟩_{A2B}+ | 11 ⟩_{A2B})

(−1)where the δ is a Kronecker delta function. We can now multiply the projector by the identity and move it past the σ^{δ(d,y)}/2 ( α_{A2}⟨ 0 | + β_{A2}⟨ 1 | ) (id_{A2}⊗ σ_{dB}) ( | 00 ⟩_{A2B}+ | 11 ⟩_{A2B})

(−1)which (computing the inner product) is the same as^{δ(d,y)}/2 σ_{dB}( α_{A2}⟨ 0 | + β_{A2}⟨ 1 | ) ( | 00 ⟩_{A2B}+ | 11 ⟩_{A2B})

(−1)But the 1/2 simply means that the probability of this measurement outcome is (1/2)^{δ(d,y)}/2 σ_{d(B)}( α | 0 ⟩_{B}+ β | 1 ⟩_{B})

σand the state | ψ ⟩ has somehow moved from Alice to Bob. They originally shared a Bell state, but have only communicated classical bits. Now, Alice's measurement tells her what d is in σ_{d}| ψ ⟩_{B}

Is this proof actually easier than the others? Not really. However, in some sense I think it shows what is going on more clearly; for some purposes it is easier to generalize; and the techniques used in this proof come in handy for other cases where the straightforward calculation used in the other proof are way too cumbersome.