arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.1253cond-mat.mes-hall
收藏

Ising Anyons拓扑量子计算中的辫子矩阵和量子门

Braid Matrices and Quantum Gates for Ising Anyons Topological Quantum Computation

Zheyong Fan, Hugo de Garis

摘要:

利用Temperley-Lieb再耦合理论,研究了基于非阿贝尔任意子的拓扑量子计算方案的各个方面,该方案对应于填充分数为5/2的分数量子霍尔效应态.幺正编织矩阵是通过任意子系统的简并基态的归一化得到的,它等价于对Kauffman和Lomonaco提出的Temperley-Lieb再耦合理论中3-顶点定义的修改.在此基础上,讨论了由Ising任意子模型的初等编织运算矩阵对量子比特态进行编码和构造量子门的问题。在用8个Ising任意子表示2个量子比特的编码方案中,给出了Bravyi无纠缠定理的另一种证明,并与Fibonacci任意子模型的情况进行了比较.在用6个Ising任意子表示2个量子比特的编码方案中,我们构造了一组等价于Georgiev构造的量子门。

英文摘要:

We study various aspects of the topological quantum computation scheme based on the non-Abelian anyons corresponding to fractional quantum hall effect states at filling fraction 5/2 using the Temperley-Lieb recoupling theory. Unitary braiding matrices are obtained by a normalization of the degenerate ground states of a system of anyons, which is equivalent to a modification of the definition of the 3-vertices in the Temperley-Lieb recoupling theory as proposed by Kauffman and Lomonaco. With the braid matrices available, we discuss the problems of encoding of qubit states and construction of quantum gates from the elementary braiding operation matrices for the Ising anyons model. In the encoding scheme where 2 qubits are represented by 8 Ising anyons, we give an alternative proof of the no-entanglement theorem given by Bravyi and compare it to the case of Fibonacci anyons model. In the encoding scheme where 2 qubits are represented by 6 Ising anyons, we construct a set of quantum gates which is equivalent to the construction of Georgiev.

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

↑