Probability estimates for Shor's algorithm

MaRDI QIDQ3522639zbMATH OpenFDO

Authors

Publication date 3 September 2008

Full work available at URL https://arxiv.org/abs/quant-ph/0607148

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Quantum computation (81P68)

Recommendations

• A fine estimate of quantum factorization success probability
• Improving the success probability for Shor's factorization algorithm
• Odd orders in Shor's factoring algorithm
• Factorization
• On computing ord\(_{N}(2)\) and its application

Cited in

(9)

• Odd orders in Shor's factoring algorithm
• Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm
• A precise estimation of the computational complexity in Shor's factoring algorithm
• Closed-form formula on quantum factorization effectiveness
• Improving the success probability for Shor's factorization algorithm
• A fine estimate of quantum factorization success probability
• On completely factoring any integer efficiently in a single run of an order-finding algorithm
• scientific article; zbMATH DE number 5320378 (Why is no real title available?)
• scientific article; zbMATH DE number 2222672 (Why is no real title available?)

This page was built for publication: Probability estimates for Shor's algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522639)