2021-12-05T13:23:44Zhttps://soar-ir.repo.nii.ac.jp/oaioai:soar-ir.repo.nii.ac.jp:000120092021-03-01T11:37:02ZPrecise probability that Graver's quantum search finds a solutionIkumi, YOtobe, YWe will give a precise estimate for Grover's extended quantum search algorithm. It is shown by Grover himself that his search mechanism can find a solution with O (√<N>) steps under a hypothesis that the coefficients of a unitary matrix is sufficiently small. We, however, give a precise expression of the probability that the algorithm reaches a solution for any unitary matrix. Finally, we will show the behavior of the probability by providing some graphs.ArticleJournal of the Faculty of Science Shinshu University. 40:41-48(2006)Faculty of Science, Shinshu University2006-03-24engdepartmental bulletin paperhttp://hdl.handle.net/10091/302https://soar-ir.repo.nii.ac.jp/records/120090583-063XAA00697923Journal of the Faculty of Science Shinshu University404148https://soar-ir.repo.nii.ac.jp/record/12009/files/KJ00004361938.pdfapplication/pdf1.3 MB2015-09-28