用DQC1逼近Jones多项式的实验
Experimental approximation of the Jones polynomial with DQC1
摘要：
我们提出了在液态核磁共振量子信息处理器中使用4个量子比特近似琼斯多项式的实验结果。这是第一个实验实现的一个完整的问题的确定性量子计算与一个量子比特模型的量子计算，它使用一个单一的量子比特伴随着一个寄存器的完全随机状态。琼斯多项式是一个纽结不变量，它不仅对纽结理论很重要，而且对统计力学和量子场论也很重要。所实现的算法是由Shor和Jordan开发的适合于在NMR中实现的算法的修改。这些实验结果表明，对于编织表示有四股和正好三个交叉的结的限制情况，识别不同的结是可能的91%的时间。
英文摘要：
We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the deterministic quantum computation with one quantum bit model of quantum computation, which uses a single qubit accompanied by a register of completely random states. The Jones polynomial is a knot invariant that is important not only to knot theory, but also to statistical mechanics and quantum field theory. The implemented algorithm is a modification of the algorithm developed by Shor and Jordan suitable for implementation in NMR. These experimental results show that for the restricted case of knots whose braid representations have four strands and exactly three crossings, identifying distinct knots is possible 91% of the time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
