Probability estimates for Shor's algorithm

zbMATH Open1152.81679arXivquant-ph/0607148MaRDI QIDQ3522639FDOQ3522639

Authors:

Publication date: 3 September 2008

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

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

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• Title not available (Why is that?)

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)