arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0607203quant-phgr-qc
收藏

量子几何与量子算法

Quantum geometry and quantum algorithms

S. Garnerone, A. Marzuoli, M. Rasetti

摘要:

受量子场论的动力学变量是几何性质的算法问题的启发,我们提供了一个量子算法,有效地近似有色琼斯多项式。该结构是基于陈-西蒙斯拓扑量子场论的完全解及其与Wess-Zumino-Witten共形场论的联系。着色琼斯多项式表示为q变形自旋网络量子自动机演化的期望值。一个量子线路被构造成能够模拟自动机,从而计算这样的期望值。后者使用量子计算中的标准采样程序有效地近似。

英文摘要:

Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature, we provide a quantum algorithm that efficiently approximates the colored Jones polynomial. The construction is based on the complete solution of Chern-Simons topological quantum field theory and its connection to Wess-Zumino-Witten conformal field theory. The colored Jones polynomial is expressed as the expectation value of the evolution of the q-deformed spin-network quantum automaton. A quantum circuit is constructed capable of simulating the automaton and hence of computing such expectation value. The latter is efficiently approximated using a standard sampling procedure in quantum computation.

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

↑