Ising拓扑量子计算机计算能力的单值分析
Monodromy analysis of the computational power of the Ising topological quantum computer
摘要：
我们证明了在Ising拓扑量子计算机中，所有由Ising任意子编织而成的量子门都保持n比特Pauli群.通过对n个\geq 3量子比特的泡利群的中心化子（也称为Clifford群）的结构分析，证明了辫子群的像是Clifford群的非平凡子群，因此并不是所有的Clifford门都可以通过辫子实现.我们明确显示的克利福德门，不能实现编织估计，以这种方式的伊辛拓扑量子计算机的最终计算能力。
英文摘要：
We show that all quantum gates which could be implemented by braiding of Ising anyons in the Ising topological quantum computer preserve the n-qubit Pauli group. Analyzing the structure of the Pauli group's centralizer, also known as the Clifford group, for n\geq 3 qubits, we prove that the image of the braid group is a non-trivial subgroup of the Clifford group and therefore not all Clifford gates could be implemented by braiding. We show explicitly the Clifford gates which cannot be realized by braiding estimating in this way the ultimate computational power of the Ising topological quantum computer.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
