0:00:04 | this recording the companies the application of our pay a long range then you have |
---|
0:00:09 | tolerance entanglement distribution |
---|
0:00:11 | this is a theoretical protocol for creating a stream of entangled q bits between alice |
---|
0:00:17 | and bob well understood to be the remote from one another |
---|
0:00:22 | protocol assumes that there is a series or technology components corpora pita stations that span |
---|
0:00:28 | the gap between alice and bob |
---|
0:00:30 | we aim for a good scalability so that if the distance between alice and bob |
---|
0:00:35 | were increased we would need to scale the resources we you require only a little |
---|
0:00:42 | worse than linearly |
---|
0:00:44 | moreover where we attempt entanglements between two components whether they be within the repeat a |
---|
0:00:51 | station or between two successive repeated stations |
---|
0:00:54 | we assume we are much more likely to pay or and to succeed |
---|
0:00:58 | so he's how the protocol goes |
---|
0:01:00 | within each repeat a station we cook up some small scale entangled objects which are |
---|
0:01:05 | as depicted here these are prostate diagrams we each got is a cuban and each |
---|
0:01:10 | line represents an entanglement relationship there are two kinds of object to a tree across |
---|
0:01:15 | state and a snowflake crossed a |
---|
0:01:20 | these are proposed for two different things that really across states are aimed at creating |
---|
0:01:25 | entanglement between successive repeat stations |
---|
0:01:30 | so we look at a couple of trees into different feature stations and we aim |
---|
0:01:33 | using a long range entanglement channel to use the close together |
---|
0:01:39 | if we succeed we will then create an entity quote a dumbbell prostate |
---|
0:01:45 | if we if we fail then we will have consumed and destroyed a two trees |
---|
0:01:50 | and we simply must have not trees that we will create an adequate number of |
---|
0:01:54 | dumbbells |
---|
0:01:55 | then in the second step of our protocol we used together all these small scale |
---|
0:02:00 | entangled entities across the entire technology |
---|
0:02:04 | and in fact this can be done in one time step |
---|
0:02:06 | so the idea is that we schedule a ten set entanglement between the leaf nodes |
---|
0:02:10 | in different neighbouring small structures here we have for such a schedule to tense and |
---|
0:02:16 | you idea is that what dumbbells and snowflakes on a sufficiently large in the first |
---|
0:02:22 | place that there are enough that tense |
---|
0:02:24 | that and this one attend is likely to succeed |
---|
0:02:28 | but we can schedule or are tense to take place simultaneously because they are independent |
---|
0:02:33 | of one another |
---|
0:02:35 | and when we make this attend we assume what we expect to see that on |
---|
0:02:41 | the whole they'll be at least one successful bridge between every pair of these entities |
---|
0:02:47 | in this diagram that's exactly one successful such every but of course that could be |
---|
0:02:53 | more than one and that's fine it's also acceptable if in some cases we fails |
---|
0:02:58 | i'll try to connect to of these entities as long as the proportion is small |
---|
0:03:02 | now the next step is to tied it is and remove all the industry shook |
---|
0:03:05 | units even behind only the course of the snowflakes so that needs to much simpler |
---|
0:03:10 | structure like this |
---|
0:03:11 | and then zooming out we see that this is how we have achieved large scale |
---|
0:03:16 | entanglement but spanning the region always between alice and bob through a series of local |
---|
0:03:21 | cubic units entanglement |
---|
0:03:23 | and structure that we actually will be shooting for is a three dimensional |
---|
0:03:27 | topologically protected cluster state |
---|
0:03:30 | as started by |
---|
0:03:31 | a rubber rosen don't from coworkers to this insight here |
---|
0:03:34 | shows the pattern that we're going for |
---|
0:03:37 | however that will be somewhere regions and regions where we have not entangled humans and |
---|
0:03:41 | this is deliberate |
---|
0:03:43 | because by achieving by implementing to such a long running avoid its as in shown |
---|
0:03:48 | in this diagram |
---|
0:03:49 | when we then |
---|
0:03:50 | a measure out with single keep it measurements pool but you are a few bits |
---|
0:03:55 | in the entire technology |
---|
0:03:57 | the result will be two remaining regions one in the |
---|
0:04:02 | area of control and s and one in boats domain |
---|
0:04:06 | and these two regions well each represent |
---|
0:04:10 | a topologically encoded single keep it |
---|
0:04:14 | but moreover the too few bits will be ten with one another you nobel state |
---|
0:04:20 | so in this way we create robustly or entangled units without a simple and then |
---|
0:04:26 | he technologies available |
---|
0:04:27 | for |
---|
0:04:28 | acceptance cycle to create a second such |
---|