arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0812.2338quant-phcond-mat.mes-hallmath-phmath.MP
收藏

Clifford门在Ising-anyon拓扑量子计算机中的实现

Implementation of Clifford gates in the Ising-anyon topological quantum computer

Andre Ahlbrecht, Lachezar S. Georgiev, Reinhard F. Werner

摘要:

给出了Clifford门在Ising拓扑量子计算机中的存在性和可实现性的一般证明。我们证明了所有可以通过编织Ising任意子实现的量子门都是Clifford门。我们发现两个量子比特的编织门耗尽了整个两个量子比特的Clifford群。通过对n个\geq 3量子比特的Clifford群的结构分析,证明了辫子群的像是Clifford群的非平凡子群,从而证明了在Ising拓扑量子计算方案中,并非所有的Clifford门都可以通过辫子来实现.我们还指出,克利福德门一般不能实现的编织。

英文摘要:

We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n \geq 3 qubits we prove that the the image of the braid group is a non-trivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We also point out which Clifford gates cannot in general be realized by braiding.

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

↑