论文标题
编译斐波那契的单量编织门拓扑量子计算
Compiling single-qubit braiding gate for Fibonacci anyons topological quantum computation
论文作者
论文摘要
拓扑量子计算是量子计算机以从根本上降低反应性的方式的实现。拓扑量表是在称为Anyons的二维准准颗粒的拓扑演化中编码的，可以通过将这些Anyons编织成拓扑受保护的电路模型来构建量子门的通用集。在本研究中，我们提醒了这种新兴量子计算方案的基础知识，并说明了如何通过三个斐波那契构建的拓扑Qubit通过交换构成它的Anyons来实现无泄漏的编织门。使用蛮力搜索方法在数值上实现了将Hadamard Quantum Gate近似于某个精度的单量形编织门。解释了用于此目的的算法，并公开共享数值程序以进行复制和进一步使用。
Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons and universal set of quantum gates can be constructed by braiding these anyons yielding to a topologically protected circuit model. In the present study we remind the basics of this emerging quantum computation scheme and illustrate how a topological qubit built with three Fibonacci anyons might be adopted to achieve leakage free braiding gate by exchanging the anyons composing it. A single-qubit braiding gate that approximates the Hadamard quantum gate to a certain accuracy is numerically implemented using a brute force search method. The algorithms utilized for that purpose are explained and the numerical programs are publicly shared for reproduction and further use.
