arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv quant-ph/0101025quant-phmath.GT
收藏

Topological Quantum Computation

Michael H. Freedman, Alexei Kitaev, Michael J. Larsen, Zhenghan Wang

英文摘要:

The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liquids and 2D-magnets are modeled by modular functors, opening a new possibility for the realization of quantum computers. The chief advantage of anyonic computation would be physical error correction: An error rate scaling like $e^{-\ał}$, where $ł$ is a length scale, and $α$ is some positive constant. In contrast, the $\q$presumptive" qubit-model of quantum computation, which repairs errors combinatorically, requires a fantastically low initial error rate (about $10^{-4}$) before computation can be stabilized.

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

↑