| 0:00:16 | this is the work on topological quantum computation the where we use the but put |
|---|
| 0:00:21 | structural the crusade the crew but and the reading room so you but she knew |
|---|
| 0:00:26 | also |
|---|
| 0:00:26 | to sit down but inefficient orientation to all but want to get a so |
|---|
| 0:00:32 | well computation there is a bayes the on the possibility of restoring and including information |
|---|
| 0:00:38 | in the one conventional of the be the so called the can be so |
|---|
| 0:00:44 | one can see equation can be approximated by using only a few building blocks of |
|---|
| 0:00:50 | such for example the control not and the single complete data that allow us to |
|---|
| 0:00:56 | approximate a |
|---|
| 0:00:57 | every unitary operator |
|---|
| 0:01:00 | topological quantum computation there is |
|---|
| 0:01:03 | i propose of the world map from the works over three the mono type and |
|---|
| 0:01:09 | many others |
|---|
| 0:01:09 | to overcome at the intrinsic noise and the korean accent which is the present that |
|---|
| 0:01:15 | in average is because the system |
|---|
| 0:01:18 | topological quantum computation the |
|---|
| 0:01:21 | is based on the possibility of storming gain control information or in the in your |
|---|
| 0:01:26 | so |
|---|
| 0:01:27 | in also our what's particle expectation that a rising particular out by dimensional system such |
|---|
| 0:01:34 | as the quantum whether once |
|---|
| 0:01:38 | i'm evolution or |
|---|
| 0:01:39 | is the based on the ratings of this particles and therefore keys the proposed against |
|---|
| 0:01:46 | the |
|---|
| 0:01:47 | local perturbation because at the encoding job the topological properties the of the system |
|---|
| 0:01:54 | is finally in the product got quantum computation the building blocks of and quantum secret |
|---|
| 0:02:00 | that can be implemented in terms of breathing so but in your so |
|---|
| 0:02:04 | in particular the simplest mode and the well known to be continuous on this record |
|---|
| 0:02:09 | the fibonacci in you know so |
|---|
| 0:02:11 | are suitable to implement a universal quantum computation that is the every unitary operator in |
|---|
| 0:02:17 | s u n can be approximated the a ten given precision by bray to all |
|---|
| 0:02:23 | these people actually in your |
|---|
| 0:02:26 | so the problem is that |
|---|
| 0:02:28 | how can we find a good approximation internal pretty so well |
|---|
| 0:02:33 | but not she knows the old and target the |
|---|
| 0:02:37 | the simplest solution all this problem is given and work by almost easy "'cause" most |
|---|
| 0:02:42 | used as time also |
|---|
| 0:02:44 | and that it relies on the possibility to check with the break up to a |
|---|
| 0:02:48 | certain and five and such a foreign the best one that approximate that our target |
|---|
| 0:02:53 | key to |
|---|
| 0:02:55 | of course this brute force approach or keeps the optimal solution but it requires that |
|---|
| 0:03:01 | the time which is exponential or in the procedure requires so these brute force approach |
|---|
| 0:03:06 | is unfeasible the two teacher i accuracy so |
|---|
| 0:03:10 | in our work a partition these are spatially sure you journal except we propose an |
|---|
| 0:03:16 | alternative to approximate any fast and efficient way every target and unitary operator a unless |
|---|
| 0:03:23 | you to |
|---|
| 0:03:23 | we could our algorithm |
|---|
| 0:03:26 | once the mesh the key feature of our technique is to exploit to the crusader |
|---|
| 0:03:31 | group but to be that immature break so that efficiently cooler any but the of |
|---|
| 0:03:36 | the target i |
|---|
| 0:03:38 | in this way we reduced to a unit number of policy but is that instead |
|---|
| 0:03:42 | of an exponentially increasing one |
|---|
| 0:03:47 | because i don't group but is that the largest but that's a cool but all |
|---|
| 0:03:51 | the s u two |
|---|
| 0:03:53 | and therefore there's be no fun used to approximate and there was a s u |
|---|
| 0:03:58 | two's via for practical or what is that for instance that indicates the all lattice |
|---|
| 0:04:04 | gauge deities |
|---|
| 0:04:06 | in our case that it the sixty element so can be represented the using the |
|---|
| 0:04:11 | brute force search one thing for all the by rates of different than so |
|---|
| 0:04:15 | this bright so that you to the building blocks that we use the to be |
|---|
| 0:04:20 | a their machines the things i don't renormalization the group but our i got it |
|---|
| 0:04:25 | at each iteration select the best effect of these the building block so to correct |
|---|
| 0:04:31 | the and our problem of a previous approximation |
|---|
| 0:04:34 | decreasing these ever by an average factor thirty in this miliseconds |
|---|
| 0:04:39 | this procedure name the quantum action is much more recognition and faster than the well-known |
|---|
| 0:04:45 | selected time but a good |
|---|
| 0:04:48 | you can find a detail of our work a in the paper manager a six |
|---|