@inbook{6aca7753ffcf481685e2361a50dc6802,
title = "A numerical simulation of quantum factorization success probability",
abstract = "The quantum factorization is probably the most famous algorithm in quantum computation. The algorithm succeeds only when some random number with an even order relative to factorized composite integer is fed as the input to the quantum order finding algorithm. Moreover, post processing of the quantum measurement recovers the correct order only for some subset of possible values. It is well known that numbers with even orders are found with probability not less than 1/2. However, numerical simulation proves that probability of such event exhibits grouping on some discrete levels above that limit. Thus, one may conclude that usage of the lowest estimate leads to underestimation of the successful factorization probability. The understanding of the observed grouping requires further research in that field.",
author = "Piotr Zawadzki",
note = "Publisher Copyright: {\textcopyright} 2009, Springer-Verlag Berlin Heidelberg.",
year = "2009",
doi = "10.1007/978-3-642-05019-0\_24",
language = "English",
series = "Advances in Intelligent and Soft Computing",
publisher = "Springer Verlag",
pages = "223--231",
booktitle = "Advances in Intelligent and Soft Computing",
address = "Germany",
}