Quantum teleportation is the idea that entangling states can cause very fast information transfer. The name however is misleading as this information transfer is not instantaneous but simply travels at the speed of light. The basis of this idea is based on a very interesting trick that arises out of some of the math of quantum computing. Let’s examine a simple case in which quantum teleportation can be used.

The figure below describes a common method for quantum teleportation where the upper dashed box represents the system of person A, the one sending information, and the lower box represents the system of person B, the one receiving information.

Person A has a qubit in the state and wants to send it to person B. A can’t simply send numbers to B describing and because it would require an infinite amount of information to describe every decimal. They must use quantum teleportation and somehow send the qubit to B.

In order to do this, before they separate, they both take a qubit with state and B applies a Hadamard gate (description of all gates used throughout the post are at the bottom of the post). to his. Now, his qubit is in the state resulting in a system in the state

Applying a CNOT gate with B’s qubit as the control and A’s as the target results in the following state (Note: these last two actions simply turned the two ground state bits into an EPR pair).

In order to do the next step described in the figure (a CNOT), one must distribute the states of as shown.

From here, a CNOT gate can again be applied keeping the target qubit the same but changing the control qubit to (Note: all that is done in this step is applying the transformation where the 2 indicates modulo 2).

Applying a Hadamard gate to and factoring out results in the following.

This is distributed and rearranged below.

Notice the four distinct possible states that form. If the first two qubits are both in the ground state, the last qubit will be in state . If the first is excited and the second is ground, then if one applies a phase flip gate to the last state qubit, they get . Excited and ground would require a not gate. Two excited states would require both. This means that if A measures the first two qubits after all these gates and sends the information to B and B applies the appropriate transformations, he successfully transformed his regular ground state qubit into the one that A originally had. These “appropriate transformations” are simply shown in the diagram as the G gate.

So as shown by this method, it is possible to send information through the transformation of a qubit. Although B’s qubit instantly changes upon the measurement of A’s, B needs the information sent by A in order to perform the G gate and this information can only be sent at the speed of a light. As a result, it is not instantaneous but is still very fast and can send information complex messages like this qubit very accurately.

If you want to know more or see where I learned this from, read the book “Quantum Computation and Information” by Isaac Chuang and Michael Nielsen.It should be in the “Books” sections of this site.

Gates

: or (NOT gate)

or (Phase-flip gate)

or (Hadamard gate)

or (Controlled-NOT gate)