期刊
PHYSICAL REVIEW LETTERS
卷 104, 期 16, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.104.160502
关键词
-
资金
- ESF
- MIUR [2007JHLPEZ]
- MoE, PRC [IRT0754]
- Max Planck Society
- Korea MEST
We study an efficient algorithm to hash any single-qubit gate into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudogroups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O(log(2)(1/epsilon)), we can approximate all SU( 2) matrices to an average error epsilon with a cost of O(log(1/epsilon)) in time. The algorithm is applicable to generic quantum compiling.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据