{ "cells": [ { "cell_type": "markdown", "metadata": {}, "source": [ "# How to Make a Wormhole\n", "\n", "## Part 2: Quantum Teleportation" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "Let's generalize the yanking equation into the algorithm for quantum teleportation. So we start off with a qubit A and a cup, which we can think of as two entangled qubits B and C. And someone takes C very far away, and we're left with A and B. We're going to teleport A to C. \n", "\n", "So A is some \\\\(a\\mid\\uparrow\\rangle + b\\mid\\downarrow\\rangle \\\\), we start out in the state \\\\(\\mid A \\rangle \\otimes \\mid\\cup\\rangle \\\\).\n", "\n", "First, we shatter the perfect symmetry of the yanking equation by making a measurement on A and B. Specifically, we make a measurement in the \"Bell basis\".\n", "\n", "$$\n", "\\mid\\Phi^{+}\\rangle = \\ \\mid\\uparrow\\uparrow\\rangle \\ + \\mid\\downarrow\\downarrow\\rangle\n", "\\\\\n", "\\mid\\Phi^{-}\\rangle = \\ \\mid\\uparrow\\uparrow\\rangle \\ - \\mid\\downarrow\\downarrow\\rangle\n", "\\\\\n", "\\mid\\Psi^{+}\\rangle = \\ \\mid\\uparrow\\downarrow\\rangle \\ + \\mid\\downarrow\\uparrow\\rangle\n", "\\\\\n", "\\mid\\Psi^{-}\\rangle = \\ \\mid\\uparrow\\downarrow\\rangle \\ - \\mid\\downarrow\\uparrow\\rangle\n", "$$\n", "\n", "These four vectors form a complete basis for all two qubit states. (Indeed, the first is quite familiar to us!) We can find the probabilities of each of the outcomes on A and B using the corresponding projectors. (Incidentally, there should be factors of \\\\( \\frac{1}{\\sqrt{2}} \\\\) everywhere for the probabilities to work out.) Nature chooses one of the four at random given those probabilities, and we apply the projector corresponding to that outcome. So after the measurement, A and B are in one of those four states, and we've gotten an outcome: 1, 2, 3, or 4. This choice can be described with two bits: 00 01 10 11: hence, the two black nodes. " ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "Let's work it out explicitly in the case of outcome 1.\n", "\n", "$$ \\mid A \\rangle \\otimes \\mid\\Phi^{+}\\rangle = \\big( \\begin{pmatrix}a \\\\\\ b \\end{pmatrix} \\otimes \\begin{pmatrix}1 \\\\\\ 0 \\\\\\ 0 \\\\\\ 1 \\end{pmatrix} \\big) = \\begin{pmatrix}a \\\\\\ 0 \\\\\\ 0 \\\\\\ a \\\\\\ b \\\\\\ 0 \\\\\\ 0 \\\\\\ b \\end{pmatrix}$$\n", "\n", "$$ \\big( \\mid\\Phi^{+}\\rangle \\otimes \\langle\\Phi^{+}\\mid \\big) \\otimes I \\ = \\big( \\begin{pmatrix}1 & 0 & 0 & 1 \\end{pmatrix} \\otimes \\begin{pmatrix}1 \\\\\\ 0 \\\\\\ 0 \\\\\\ 1 \\end{pmatrix} \\big) \\otimes \\begin{pmatrix}1 & 0 \\\\\\ 0 & 1 \\end{pmatrix} = \\\\ \\begin{pmatrix}1 & 0 & 0 & 1 \\\\\\ 0 & 0 & 0 & 0 \\\\\\ 0 & 0 & 0 & 0 \\\\\\ 1 & 0 & 0 & 1 \\end{pmatrix} \\otimes \\begin{pmatrix}1 & 0 \\\\\\ 0 & 1 \\end{pmatrix} = \n", "\\begin{pmatrix}\n", " 1 & 0 & 0 & 0 & 0 & 0 & 1 & 0\\\\\\\n", " 0 & 1 & 0 & 0 & 0 & 0 & 0 & 1\\\\\\\n", " 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\\\\\\\n", " 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\\\\\\\n", " 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\\\\\\\n", " 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\\\\\\\n", " 1 & 0 & 0 & 0 & 0 & 0 & 1 & 0\\\\\\\n", " 0 & 1 & 0 & 0 & 0 & 0 & 0 & 1 \\end{pmatrix}\n", "$$\n", "\n", "$$ \n", "\\big( \\big( \\mid\\Phi^{+}\\rangle \\otimes \\langle\\Phi^{+}\\mid \\big) \\otimes I \\big) \\big( \\mid A \\rangle \\otimes \\mid\\Phi^{+}\\rangle \\big) = \n", "\\begin{pmatrix}\n", " 1 & 0 & 0 & 0 & 0 & 0 & 1 & 0\\\\\\\n", " 0 & 1 & 0 & 0 & 0 & 0 & 0 & 1\\\\\\\n", " 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\\\\\\\n", " 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\\\\\\\n", " 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\\\\\\\n", " 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\\\\\\\n", " 1 & 0 & 0 & 0 & 0 & 0 & 1 & 0\\\\\\\n", " 0 & 1 & 0 & 0 & 0 & 0 & 0 & 1 \\end{pmatrix}\\begin{pmatrix}a \\\\\\ 0 \\\\\\ 0 \\\\\\ a \\\\\\ b \\\\\\ 0 \\\\\\ 0 \\\\\\ b \\end{pmatrix} = \\begin{pmatrix}a \\\\\\ b \\\\\\ 0 \\\\\\ 0 \\\\\\ 0 \\\\\\ 0 \\\\\\ a \\\\\\ b \\end{pmatrix}\n", "$$\n", "\n", "We observe that:\n", "$$\n", "\\begin{pmatrix}1 \\\\\\ 0 \\\\\\ 0 \\\\\\ 1\\end{pmatrix} \\otimes \\begin{pmatrix}a \\\\\\ b \\end{pmatrix} = \\begin{pmatrix}a \\\\\\ b \\\\\\ 0 \\\\\\ 0 \\\\\\ 0 \\\\\\ 0 \\\\\\ a \\\\\\ b\\end{pmatrix}\n", "$$\n", "\n", "The teleportation was successful! A swapped places with C." ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "If we do the same calculation for each of the four outcomes, we end up in one of these four states:\n", "\n", "$$\n", "\\big(\\mid\\Phi^{+}\\rangle \\langle \\Phi^{+} \\mid \\otimes I \\big) \\big( \\mid A \\rangle \\otimes \\cup \\big)\n", " = \\ \\mid\\Phi^{+}\\rangle \\otimes \\begin{pmatrix}a \\\\ b\\end{pmatrix}\n", "$$\n", "\n", "$$\n", "\\big(\\mid\\Phi^{-}\\rangle \\langle \\Phi^{-} \\mid \\otimes I \\big) \\big( \\mid A \\rangle \\otimes \\cup \\big)\n", " = \\\n", "\\mid\\Phi^{-}\\rangle \\otimes \\begin{pmatrix}a \\\\ -b\\end{pmatrix}\n", "$$\n", "\n", "$$\n", "\\big(\\mid\\Psi^{+}\\rangle \\langle \\Psi^{+} \\mid \\otimes I \\big) \\big( \\mid A \\rangle \\otimes \\cup \\big)\n", " = \\ \\mid\\Psi^{+}\\rangle \\otimes \\begin{pmatrix}b \\\\ a\\end{pmatrix}\n", "$$\n", "\n", "$$\n", "\\big(\\mid\\Psi^{-}\\rangle \\langle \\Psi^{-} \\mid \\otimes I \\big) \\big( \\mid A \\rangle \\otimes \\cup \\big)\n", " = \\\n", "\\mid\\Psi^{-}\\rangle \\otimes \\begin{pmatrix}-b \\\\ a\\end{pmatrix}\n", "$$\n", "\n", "So we can see that if we measure in the Bell basis, then the qubit C ends up identical to A, up to some swaps and sign flips. We can reason like this: Entanglement is monogamous. So if B and C were maximally entangled, but now A and B are projected into the maximally entangled state, then C is forced to be whatever A was.\n", "\n", "The dotted lines represent classical communication. We can use our knowledge of the outcome of the measurement to correct for the swaps and sign flips. In some way or other, we communicate our two bits to our faraway friend who has qubit C. Naturally, we can't send such a signal faster than the speed of light." ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "If we sent \"1\", then our friend doesn't have to do anything! In fact, in that case, the teleportation diagram reduces down to our old friend the yanking equation.\n", "\n", "\n", "\n", "The full set of rules is:\n", "\n", "$$\n", "\\begin{matrix} \n", " 1 & \\to & I \\\\\\\n", " 2 & \\to & Z \\\\\\\n", " 3 & \\to & X \\\\\\\n", " 4 & \\to & ZX \n", "\\end{matrix}\n", "$$\n", "where X and Z refer to the Pauli matrices:\n", "\n", "$$\n", "X = \\begin{pmatrix} 0 & 1 \\\\ 1 & 0 \\end{pmatrix}\n", "Y = \\begin{pmatrix} 0 & -i \\\\ i & 0 \\end{pmatrix}\n", "Z = \\begin{pmatrix} 1 & 0 \\\\ 0 & -1 \\end{pmatrix}\n", "$$\n", "\n", "In other words, if we'd sent \"2\", our friend would apply the Z operator to C which flips the sign of the second component. If we'd sent \"3\", our friend would apply the X operator which swaps the two components. And if we'd sent \"4\", our friend would apply X to swap the components, and then Z to flip the sign of the second. And then the teleportation would be complete. \n", "\n", "Two things make this more powerful than classical communication alone: a) although we've sent two classical bits, we've teleported an *unknown* quantum state b) if A had been entangled with some other qubits, then the A that would emerge at C would have all the same entanglement, which picks it out uniquely as itself and not some kind of forgery. \n", "