A Refinement of Shor's Algorithm
A Refinement of Shor's Algorithm
复制标题
Shor 算法的改进
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
D. McAnally
中科院分区：
文献类型：
--
作者：
D. McAnally
介绍了一种改进的确定阶数的Shor算法，该算法在量子计算机的任何一次运行之后几乎绝对确定阶数的除数。从每次运行中获得的信息被累积以确定顺序，并且对于任何大于1的k，存在保证的最小正概率，该顺序将在最多k次运行之后被确定。在至多k次运行之后确定顺序的概率指数地接近小于1的可忽略的值，使得累积的信息几乎绝对确定顺序。最多运行两次后确定顺序的概率大于60%，最多运行四次后确定顺序的概率大于90%。
A refinement of Shor's Algorithm for determining order is introduced, which determines a divisor of the order after any one run of a quantum computer with almost absolute certainty. The information garnered from each run is accumulated to determine the order, and for any k greater than 1, there is a guaranteed minimum positive probability that the order will be determined after at most k runs. The probability of determination of the order after at most k runs exponentially approaches a value negligibly less than one, so that the accumulated information determines the order with almost absolute certainty. The probability of determining the order after at most two runs is more than 60%, and the probability of determining the order after at most four runs is more than 90%.