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