Abstract
Shor’s algorithm 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 Shor’s algorithm. Similarly, we provide a detailed computation of the estimation of the probability that convergents will provide the period required for determining a prime factor.
Funder
German Federal Ministry for Economics and Climate Action
Reference7 articles.
1. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
2. Lecture on Quantum Information—Chapter 6. Quantum Algorithms;Preskill,2020
3. Algebra;Shult,2015
4. Quantum Computation and Quantum Information;Nielsen,2016
5. Quantum Computing: A Gentle Introduction;Rieffel,2011
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献