A precise estimation of the computational complexity in Shor's factoring algorithm

zbMATH Open1241.11142arXivquant-ph/0406145MaRDI QIDQ5446367FDOQ5446367

Author name not available (Why is that?)

Publication date: 6 March 2008

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

Recommendations

• ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
• scientific article
• Probability estimates for Shor's algorithm
• scientific article
• Quantum factoring algorithm: resource estimation and survey of experiments

zbMATH Keywords

computational complexityShor's factoring algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Quantum computation (81P68) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Cited In (3)

• ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
• Scalability of Shor’s algorithm with a limited set of rotation gates
• Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm

This page was built for publication: A precise estimation of the computational complexity in Shor's factoring algorithm

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