arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0105255math.QAmath-phmath.MPquant-ph

Quantum Computing and the Jones Polynomial

Louis H. Kauffman

英文摘要:

This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitary representation of the braid group. We discuss the evaluation of the polynomial as a generalized quantum amplitude and show how the braiding part of the evaluation can be construed as a quantum computation when the braiding representation is unitary. The question of an efficient quantum algorithm for computing the whole polynomial remains open.

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

↑