arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.06176quant-phcond-mat.quant-gas
收藏

非阿贝尔任意子拓扑量子计算导论

Introduction to topological quantum computation with non-Abelian anyons

Bernard Field, Tapio Simula

摘要:

拓扑量子计算机保证了执行量子计算的容错手段。拓扑量子计算机使用具有奇异交换统计的粒子,称为非阿贝尔任意子,最简单的任意子模型允许通过粒子交换或编织进行通用量子计算,这是斐波那契任意子模型。使用量子计算可以有效解决的一个经典难题是找到单位根处结的琼斯多项式的值。我们的目标是提供一个教学,独立的,审查与斐波那契任意子的拓扑量子计算,从编织统计和矩阵的布局这样的计算机和编制辫子执行特定的操作。然后,我们使用拓扑量子计算机的模拟来明确地展示使用斐波那契任意子的量子计算,评估选择简单结的琼斯多项式。除了模拟模块电路式量子算法,我们还展示了如何使用Fibonacci或Ising任意子精确获得特定点处的Jones多项式的大小。这种精确的算法似乎非常适合拓扑量子计算机的概念证明。

英文摘要:

Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Then we use a simulation of a topological quantum computer to explicitly demonstrate a quantum computation using Fibonacci anyons, evaluating the Jones polynomial of a selection of simple knots. In addition to simulating a modular circuit-style quantum algorithm, we also show how the magnitude of the Jones polynomial at specific points could be obtained exactly using Fibonacci or Ising anyons. Such an exact algorithm seems ideally suited for a proof of concept demonstration of a topological quantum computer.

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

↑