0:00:03de mining is sign invention
0:00:06together with my colleague in a sense of the quantum technologies in singapore i've been
0:00:11thinking about particular approach to a building
0:00:15quantum computers
0:00:16with both there is so what we do is what task on paper and hope
0:00:19it is interesting to the experiments as
0:00:22but i love a paper is high threshold
0:00:25distributed quantum computing with three two bit nodes just quite an awful i think it
0:00:30by explain what that means all of done a pretty stable job of explaining
0:00:35okay
0:00:36so on some computers of course of a stream of modern physics the idea of
0:00:40the machine that harnesses quantum states in order to do calculations there are
0:00:45effectively impossible with ordinary technology
0:00:49in order to build such machine we need to have a very large number of
0:00:52components each of which is stored in quantum state so that be the basic components
0:00:56is that you that we need lots of them
0:00:58or under good control
0:01:01be distributed quantum computing approach is kind of an architectural overall scheme have to do
0:01:07this
0:01:07which tries to make things a scalable as possible
0:01:10so the idea is don't put only a few bits into a single grand or
0:01:14a monolithic structure that is one week ago but
0:01:17in this t v two q i p instead you try and build small units
0:01:22which michael more tools pornos each of which has only a few bits inside it
0:01:27you get to the building that's and controlling it and you make lots of them
0:01:30and welcome to get to make the last machine the network you expect to the
0:01:35and we see that work for network
0:01:37and that's actual scheme for the entire machine it's distributed in the sense that it's
0:01:41kind of exploded out from a single monolithic structure but of course not distributed over
0:01:46large distances in one room
0:01:48okay so that but thresholding
0:01:51okay so a threshold in the u refers to
0:01:56a level of precision that you need to reach in order that when you trying
0:02:00to a large scale computation the errors don't get out of control instead the arrows
0:02:04are coming in at low enough rate that you can detect and correct and for
0:02:09that basically if you're
0:02:12within your threshold you can do this outside of the threshold and errors will build
0:02:16up so fast that the calculation goes off track and get you know
0:02:19so of course you want a threshold the bs the mystic as possible as high
0:02:23as possible
0:02:25what you know like what's also this let's try and figure out what is the
0:02:29threshold for this distribute a quantum computing approach we're gonna have to keep numbers how
0:02:34it is the network okay just a controlled inside the node and we can also
0:02:38only three cue but spend a week or about that case "'cause" we put it
0:02:42would be the simplest case that would give us
0:02:45a good threshold
0:02:47three people nodes are reasonable thing to ask for lots of experimental groups can basically
0:02:51do that can basically q three q s
0:02:54so what we found was
0:02:56that we a partial was
0:02:58ten percent noise in the network which means one time and ten
0:03:02when you try and communicative network it just on bananas the you across to keep
0:03:06it simple
0:03:07and no point one percent noise with in the nodes themselves that means
0:03:13on those rare occasions when you try and the human or something it actually correct
0:03:17that q so
0:03:18ten percent of the network what one percent for the
0:03:22local operations in each that
0:03:24but as numbers are time especially the ninety nine point nine percent precision within each
0:03:28node star
0:03:29but not ridiculously so there are experimental groups in a syntactic units or in
0:03:35all tracks lindy sentences were pushing past sort of ninety nine percent threshold so
0:03:41that could be rich but also we stress that we have with trying to improve
0:03:45this point back to schemes that have
0:03:47even more optimistic specials
0:03:49you know the same time as the experiments is trying to improve
0:03:52their stuff and
0:03:53we have that soon not and you know pretty soon
0:03:55we may see these numbers actually meeting and then in principle you do we are
0:03:59trying to
0:04:01a large-scale machine
0:04:02okay so a few remarks the experts a how do we get a high threshold
0:04:07with such a small number keep a node we basically a and in something which
0:04:11is pretty much most of the previous role as a done which is to distill
0:04:15well as within each node
0:04:16a high quality and use those two power actual once again between local units
0:04:21your client of data humans we don't do that instead we currently project no easy
0:04:26hardy projections on the core units we do that repeated the until the party projection
0:04:31becomes
0:04:32effectively your and it's the resulting to o can go from a while back but
0:04:36it's basically can be done
0:04:38so then we just use the art objections to make some useful what we may
0:04:41is the three d cost the state of which is a resource for a topological
0:04:46quantum computing in the start described by prosody
0:04:50so that's okay and we find we only six party projections to do it which
0:04:54is basically why we're able to guess i threshold
0:04:58okay what if any if any of this it is of interest reading the papers
0:05:01of interest please don't hesitate to our contact me
0:05:04comments criticisms