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

琼斯多项式的三股量子算法

A 3-Stranded Quantum Algorithm for the Jones Polynomial

Louis H. Kauffman, Samuel J. Lomonaco,

摘要:

设K是一个3股结(或链环),L表示K中的交叉数。令$ε_{1}$和$ε_{2}$是两个正实数,使得$ε_{2}$小于或等于1。本文给出了两种算法,用于计算K的琼斯多项式在复平面上单位圆上所有点$t=exp(iϕ)$的值,使得$ϕ$的绝对值小于或等于$π/3$ .第一个算法,称为经典3-stranded braid(3-SB)算法,是一个经典的确定性算法,其时间复杂度为O(L)。第二种称为量子3-SB算法,是一种量子算法,该算法在$exp(iϕ))$处计算K的琼斯多项式的估计,精度为$ε_{1}$,成功概率为$1-ε_{2}%。该算法的执行时间复杂度为O(nL),其中n是(ln(4/ε 2}))/(2(ε 2})^2)的上取顶函数。编译时间复杂度,即,一个渐进的时间量来组装执行算法的硬件,是O(L)。

英文摘要:

Let K be a 3-stranded knot (or link), and let L denote the number of crossings in K. Let $ε_{1}$ and $ε_{2}$ be two positive real numbers such that $ε_{2}$ is less than or equal to 1. In this paper, we create two algorithms for computing the value of the Jones polynomial of K at all points $t=exp(iϕ)$ of the unit circle in the complex plane such that the absolute value of $ϕ$ is less than or equal to $π/3$. The first algorithm, called the classical 3-stranded braid (3-SB) algorithm, is a classical deterministic algorithm that has time complexity O(L). The second, called the quantum 3-SB algorithm, is a quantum algorithm that computes an estimate of the Jones polynomial of K at $exp(iϕ))$ within a precision of $ε_{1}$ with a probability of success bounded below by $1-ε_{2}%. The execution time complexity of this algorithm is O(nL), where n is the ceiling function of (ln(4/ε_{2}))/(2(ε_{2})^2). The compilation time complexity, i.e., an asymptotic measure of the amount of time to assemble the hardware that executes the algorithm, is O(L).

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

↑