A fine estimate of quantum factorization success probability

DOI10.1142/S0219749910006940zbMATH Open1213.81110MaRDI QIDQ3000423FDOQ3000423

Authors: Piotr Zawadzki 

Publication date: 18 May 2011

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

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

zbMATH Keywords

factorizationquantum computationprobabilistic algorithm

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Probability estimates for Shor's algorithm
• Closed-form formula on quantum factorization effectiveness
• Security of ping-pong protocol based on pairs of completely entangled qudits
• 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)