论文标题
Shor算法中的持续分数和概率估计 - 详细且独立的论文
Continued Fractions and Probability Estimations in the Shor Algorithm -- A Detailed and Self-Contained Treatise
论文作者
论文摘要
用于主要分解的Shor算法是由量子部分和经典部分组成的混合算法。经典部分的主要重点是持续的分数分析。介绍通常很短，指的是关于数字理论的教科书。在这项贡献中，我们详细介绍了持续分数理论的相关结果和证明（甚至比教科书中更详细），以填补差距，以完全理解Shor的算法。同样，我们提供了详细的计算，对收敛概率的估计提供了确定主要因素所需的周期。
The algorithm of Shor for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis. The presentation of this is often short, pointing to text books on number theory. In this contribution, we present the relevant results and proofs from the theory of continued fractions in detail (even in more detail than in text books) filling the gap to allow a complete comprehension of the algorithm of Shor. Similarly, we provide a detailed computation of the estimation of the probability that convergents will provide the period required for determining a prime factor.
