arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0903.2239quant-phcond-mat.mes-hall
收藏

Read-Rezayi态的拓扑量子计算

Topological Quantum Computing with Read-Rezayi States

L. Hormozi, N. E. Bonesteel, S. H. Simon

摘要:

Read-Rezayi分数量子霍尔态是实现非阿贝尔任意子的主要候选者之一,原则上可以用于拓扑量子计算。我们提出了一个处方,有效地找到辫子,可用于执行一个通用的量子门的编码量子比特的基础上的任何子的Read-Rezayi状态与$k>2$,$k\neq4$。这项工作扩展了以前的结果,只适用于情况$k = 3$(斐波那契),并澄清了为什么在这种情况下,门的建设是简单的比一个通用的读取Rezayi状态。

英文摘要:

Read-Rezayi fractional quantum Hall states are among the prime candidates for realizing non-Abelian anyons which in principle can be used for topological quantum computation. We present a prescription for efficiently finding braids which can be used to carry out a universal set of quantum gates on encoded qubits based on anyons of the Read-Rezayi states with $k>2$, $k\neq4$. This work extends previous results which only applied to the case $k = 3$ (Fibonacci) and clarifies why in that case gate constructions are simpler than for a generic Read-Rezayi state.

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

↑