2026-10-23T14:57:16Zhttps://gumushane-rdlopen.rawdatalibrary.net/oai/request

oai:gumushane-rdlopen.rawdatalibrary.net:gumushane/124392026-10-22T11:35:26Zopenairedrivercom_gumushane_10000col_gumushane_10001com_gumushane_10007col_gumushane_10171

Analysis of grover's quantum search algorithm on a classical computer: Identifying opportunities for improvementNecati, Çeli̇KBi̇Ngöl, ÖzkanGrover’s Search AlgorithmQuantum InformationQuantum Information ProcessingQubit, State VectorIn this paper, Grover’s quantum search algorithm is analyzed using a classical computer by calculating the amplitudes and the probabilities of finding a single marked state for n=5, 10, 15, 20, 25, and 27 qubit states. The calculations show that the marked state can be found in iterations, where N = 2n is the number of items. The possibility of improving Grover’s search algorithm to find a single item in N search elements is discussed by calculating the amplitudes and hence the probabilities of finding a single marked state for n=5, 10, 15, 20, 25, 30, 35, 40, 45, and 50 qubit states. The calculations showed that the marked state could be found with sufficiently high probability in (ln(N)) iterations. This is quite a remarkable speed-up that can be achieved to find a single marked element in an unsorted N search element. Copyright 2021, Yıldız Technical University.Yildiz Technical University2024Articlehttps://rdlopen.rawdatalibrary.net/r/gumushane/12439https://doi.org/10.14744/sigma.2023.000691304-7191enSigma Journal of Engineering and Natural Sciencesinfo:eu-repo/semantics/openAccessinfo:eu-repo/semantics/articlehttps://gumushane-rdlopen.rawdatalibrary.net/tr/items/gumushane/12439