arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1410.0602quant-phcs.NE
收藏

一种计算准粒子辫的概率进化优化方法

A probabilistic evolutionary optimization approach to compute quasiparticle braids

Roberto Santana, Ross B. McDonald, Helmut G. Katzgraber

摘要:

拓扑量子计算是避免量子计算中量子退相干问题的另一种框架。在这个框架中,执行门的问题可以被视为编织准粒子的问题。因为这些不是阿贝尔的,所以问题可以简化为寻找辫子生成器的最优乘积,其中最优性是根据门近似和辫子的长度来定义的。在本文中,我们提出了使用不同的变量估计分布算法来处理这个问题。此外,我们研究如何通过玻尔兹曼分布的辫子优化问题的可转换为统计可转换。我们表明,我们最好的算法是能够产生许多解决方案,近似的目标门的精度在$10^{-6}$的顺序,并有长度达9倍短于预期的编织物的相同精度与其他方法获得。

英文摘要:

Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because these are not Abelian, the problem can be reduced to finding an optimal product of braid generators where the optimality is defined in terms of the gate approximation and the braid's length. In this paper we propose the use of different variants of estimation of distribution algorithms to deal with the problem. Furthermore, we investigate how the regularities of the braid optimization problem can be translated into statistical regularities by means of the Boltzmann distribution. We show that our best algorithm is able to produce many solutions that approximates the target gate with an accuracy in the order of $10^{-6}$, and have lengths up to 9 times shorter than those expected from braids of the same accuracy obtained with other methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑