1 00:00:00,000 --> 00:00:06,038 Okay, so quantum teleportation might sound too exciting and too science fiction to be 2 00:00:06,038 --> 00:00:14,004 of any actual interest, technically but it's, it's actually a very fundamental 3 00:00:14,004 --> 00:00:20,008 primitive in, in computation. And, so in this video I'll, I'll say in a few 4 00:00:20,008 --> 00:00:27,007 minutes, you know I'll give you a little sketch of how teleportation gets used in 5 00:00:27,007 --> 00:00:34,008 computation. This might be a little more advanced but it's really a point into the 6 00:00:34,008 --> 00:00:40,037 literature for those of you who are interested. Okay so, so let's look at how, 7 00:00:40,037 --> 00:00:46,006 how telepretation proceeds, right? So Alice has a qubit which is in this state 8 00:00:46,006 --> 00:00:51,035 let's. Let's say this is, she has this qubit which is in the state alpha zero 9 00:00:51,035 --> 00:00:58,048 plus beta one. It's in an unknown, unknown state. And then Alice wants to send this 10 00:00:58,048 --> 00:01:07,009 qubit over to Bob. And, all they have is an, entangled pair of qubits which they 11 00:01:07,009 --> 00:01:13,005 share a Bell State. And so the teleportation is a, is a protocol where 12 00:01:13,005 --> 00:01:19,084 Alice measures her two qubits in some appropriate basis, sends the two classical 13 00:01:19,084 --> 00:01:26,027 qubits, classical bits across to Bob who makes, makes some unitary correction to 14 00:01:26,027 --> 00:01:32,017 his qubit. And the qubit that Alice destroyed by making a measurement 15 00:01:32,017 --> 00:01:39,076 magically appears on Bob's side. Okay, so that's teleportation. Now, let's step back 16 00:01:39,076 --> 00:01:47,021 and think about it for a moment. So, what is it that, you know what, what 17 00:01:47,021 --> 00:01:55,035 determined, what basis, the qubit psi reappeared on Bob's side? Well, if you 18 00:01:55,035 --> 00:02:01,042 think about it for, for a little while, you'll realize that what determined the 19 00:02:01,042 --> 00:02:07,017 basis was the fact that the Bell State happened to be of the form (00) + 20 00:02:07,017 --> 00:02:13,017 (eleven). What if you had used (01) + (ten). Then if Alice's qubit had been a 21 00:02:13,017 --> 00:02:19,073 zero, it would have appeared on Bob's side as a one and vice versa. So now, why not 22 00:02:19,073 --> 00:02:26,063 take this a step further? Why not take Bob's , qubit and apply a unitary rotation 23 00:02:26,063 --> 00:02:33,031 to it? You could apply any arbitrary unitary rotation to it. And now when Alice 24 00:02:33,031 --> 00:02:42,016 thus had teleportation step, wouldn't you expect it to arrive on Bob's side in this 25 00:02:42,016 --> 00:02:50,033 rotated basis? But if that were the case then, what you would have managed is, if 26 00:02:50,033 --> 00:02:57,015 Alice wanted to apply some unitary rotation to, to her qubit, it would appear 27 00:02:57,015 --> 00:03:04,007 on Bob's side, pre-rotated. Okay, but then you could say about what's the point of 28 00:03:04,007 --> 00:03:10,043 doing something like this? After all you know what does it matter? Alex applies the 29 00:03:10,043 --> 00:03:16,067 unitary rotation, the gate. Bob applies the gate, you have to apply it anyway. So 30 00:03:16,067 --> 00:03:22,090 here is the interesting part. The interesting part is that what this says is 31 00:03:22,090 --> 00:03:29,044 that you could apply a rotation, you could apply the gate before even touching the 32 00:03:29,044 --> 00:03:34,066 qubit. So in other words, suppose that our, our computation is unreliable. 33 00:03:34,066 --> 00:03:39,065 Suppose we don't quite have a handle on it. Sometimes it works, sometimes it 34 00:03:39,065 --> 00:03:44,081 doesn't. And on the other hand the, the cubit that we want to apply the 35 00:03:44,081 --> 00:03:50,053 computation to that's valuable. If we, if we were to spoil it and have to make it 36 00:03:50,053 --> 00:03:55,049 all over again, that would take a lot of effort to, to create. What we could do is 37 00:03:55,049 --> 00:04:01,004 apply the gate in advance. We'd apply it to Bob's qubit in this Bell State. And if 38 00:04:01,004 --> 00:04:07,014 you spoil that computation, we could just discard that Bell State and start all over 39 00:04:07,014 --> 00:04:12,074 again with a new fresh Bell State. And we could keep trying until we succeed in 40 00:04:12,074 --> 00:04:17,080 that, in that, in doing that rotation to our satisfaction. Once we are done with, 41 00:04:17,080 --> 00:04:23,007 with doing the rotation to our satisfaction. Then we do our teleportation 42 00:04:23,007 --> 00:04:29,002 protocol and lo and behold the qubit reappears on Bob's side properly rotated. 43 00:04:29,002 --> 00:04:34,008 Okay, that's the idea at least behind computation by teleportation. Okay, but to 44 00:04:34,008 --> 00:04:40,006 really make it happen, we need to do something a little more interesting. Okay 45 00:04:40,006 --> 00:04:46,005 so, so this is a, this is a schematic of what we would like to happen. So we are 46 00:04:46,005 --> 00:04:53,000 trying to do teleportation before we even start the teleportation circuit, we apply 47 00:04:53,002 --> 00:04:59,004 a single qubit unit, or AU. A quantum gate u to Bob's qubit. And once we are 48 00:04:59,004 --> 00:05:06,002 satisfied we've managed to apply it, we want to teleport psi to Bob. And what we 49 00:05:06,002 --> 00:05:13,050 are expecting is Bob receives u psi. Okay, so let's see whether this, this is going 50 00:05:13,050 --> 00:05:18,062 to work out as expected. Okay, so what, what happens? Well, here's the actual 51 00:05:18,062 --> 00:05:24,071 teleportation circuit. Remember what, what Alice does is she does a CNOT from into, 52 00:05:24,071 --> 00:05:29,057 into, her, her, her part of the Bell State and then she does a Bell basis 53 00:05:29,057 --> 00:05:35,051 measurement. Which is, she applies a Hadamard here, measures these two qubits 54 00:05:35,051 --> 00:05:41,004 and calls up Bob, who applies either a x or a z correction or both. Okay so now, 55 00:05:41,004 --> 00:05:47,018 what, what are we plan, planning to do instead? Now, what we've done is before 56 00:05:47,018 --> 00:05:54,022 any of this teleportation circuit started, what we're doing is we're applying u to 57 00:05:54,022 --> 00:06:01,057 Bob's qubit and what would we like to happen? Alright, what, what, what actually 58 00:06:01,057 --> 00:06:06,052 have we managed to do? Well, what was suppose to happen was without the u here, 59 00:06:06,052 --> 00:06:10,093 it's after we apply the x and z corrections that we got psi. Meaning 60 00:06:10,093 --> 00:06:15,098 whatever the state was, let's say we only applied how, how to apply the x 61 00:06:15,098 --> 00:06:22,023 correction. So it was after applying the x correction, you know we got the correct 62 00:06:22,023 --> 00:06:29,064 bit sign and having applied x, we then wanted to apply u to it. Right? So if you 63 00:06:29,064 --> 00:06:36,054 apply this operator u followed by x, then we got the correct output. This, this 64 00:06:36,054 --> 00:06:44,059 created the output. It would be equal to u psi which is what we wanted. What do we 65 00:06:44,059 --> 00:06:52,010 actually end up applying? Well, we end up applying u first and then x. Okay, now in 66 00:06:52,010 --> 00:07:00,006 general, you know that matrices don't commute. And so u followed by x is in 67 00:07:00,006 --> 00:07:08,014 general, not going to be equal to x followed by u. And so what we would have 68 00:07:08,014 --> 00:07:15,067 to do in order to actually do computation by teleportation is we'd actually have to 69 00:07:15,067 --> 00:07:22,004 apply some sort of correction after having done this. So we, we did the, we applied 70 00:07:22,004 --> 00:07:28,040 our gate too soon. We applied u and then x instead of x and then u. Okay, so it turns 71 00:07:28,040 --> 00:07:34,080 out that there are certain kinds of single qubit gates which actually commute with x 72 00:07:34,080 --> 00:07:39,076 so you can apply them in any order. For, for these kinds of gates, it's actually 73 00:07:39,076 --> 00:07:45,014 very good. For simple gates, we might actually have equality here and then, 74 00:07:45,014 --> 00:07:51,000 those gates we can just do simply by, by teleportation. But there are other gates 75 00:07:51,000 --> 00:07:56,035 where they don't commute but you can apply a very simple unitary correction so you, 76 00:07:56,035 --> 00:08:02,006 you do get equality if you apply some unitary correction a. And if a is simple 77 00:08:02,006 --> 00:08:07,006 enough, then this is a worthwhile process to carry out. And thi s is what 78 00:08:07,006 --> 00:08:12,007 computation by teleportation does. So if you want to read more about this, here's 79 00:08:12,007 --> 00:08:17,006 the paper that, that introduced this concept. It's, I think, a very beautiful 80 00:08:17,006 --> 00:08:22,009 paper and there are lots of follow up works based on it having to do with how 81 00:08:22,009 --> 00:08:28,001 you carry out quantum computation reliably in the presence of noise? So it's called 82 00:08:28,001 --> 00:08:32,067 fault-tolerant quantum computing. There are ways of using what, what this also 83 00:08:32,067 --> 00:08:37,071 shows is that entanglement can be used as a resource in quantum computation. And 84 00:08:37,071 --> 00:08:42,021 then there's, you know this has been developed in very interesting ways in 85 00:08:42,021 --> 00:08:46,000 what's called quantum computation by measurement.