Seminars & Lectures
* TITLE | Random walk down quantum braids | ||||||
---|---|---|---|---|---|---|---|
* SPEAKERS | |||||||
|
|||||||
* HOST(Applicant) | |||||||
|
|||||||
* DATE / TIME | 2016-08-12, 11 am | ||||||
* ABSTRACT | |||||||
Recent experiments on topological states of matter have been accumulating evidence for the existence of exotic quasiparticles that obey non-Abelian statistics and that can be used for topological quantum computation. In a topological quantum computer, braids of non-Abelian anyons in a (2+1)-dimensional spacetime form quantum gates, which can be represented by unitary matrices acting in the space of degenerate quasiparticle states. In this talk I will discuss an algorithm, based on knowledge of random systems, that searches efficiently a braid sequence for any targeted quantum gate in the Fibonacci anyon model. In the algorithm a renormalization group like scheme is implemented that exploits the broad distribution of the braid representations in the space of unitary matrices. Interestingly, the accuracy (or inaccuracy) follows the Wigner-Dyson distribution of the eigenvalue spacing in the unitary ensemble in the random matrix theory, which allows a quantitative control of the residual error. |