A fine estimate of quantum factorization success probability

DOI10.1142/S0219749910006940MaRDI QIDQ3000423zbMATHFDO

Authors Piotr Zawadzki

Publication date 18 May 2011

Published in International Journal of Quantum Information (Search for Journal in Brave)

zbMATH Keywords

factorizationquantum computationprobabilistic algorithm

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Improving the success probability for Shor's factorization algorithm
• Probability estimates for Shor's algorithm
• Closed-form formula on quantum factorization effectiveness
• Odd orders in Shor's factoring algorithm
• scientific article

Cites work

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited in

(6)

• Security of ping-pong protocol based on pairs of completely entangled qudits
• Probability estimates for Shor's algorithm
• Odd orders in Shor's factoring algorithm
• Closed-form formula on quantum factorization effectiveness
• Improving the success probability for Shor's factorization algorithm
• A low-resource quantum factoring algorithm

This page was built for publication: A fine estimate of quantum factorization success probability

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