Improving the success probability for Shor's factorization algorithm

DOI10.1007/978-3-319-73216-9_21MaRDI QIDQ5112184zbMATH OpenOpenAlexFDO

Authors Xiang Fu Zou, Jozef Gruska, Guo-Liang Xu, Daowen Qiu

Publication date 28 May 2020

Published in Reversibility and Universality (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-73216-9_21

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Odd orders in Shor's factoring algorithm
• A fine estimate of quantum factorization success probability
• Probability estimates for Shor's algorithm
• scientific article; zbMATH DE number 5320378
• On computing ord\(_{N}(2)\) and its application

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Odd orders in Shor's factoring algorithm
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited in

(7)

• Odd orders in Shor's factoring algorithm
• On computing ord\(_{N}(2)\) and its application
• On completely factoring any integer efficiently in a single run of an order-finding algorithm
• A fine estimate of quantum factorization success probability
• Probability estimates for Shor's algorithm
• Factorization
• Computing (N) for an RSA module with a single quantum query

This page was built for publication: Improving the success probability for Shor's factorization algorithm

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