English

Quantum search in sets with prior knowledge

Quantum Physics 2022-07-25 v1 Data Structures and Algorithms

Abstract

Quantum Search Algorithm made a big impact by being able to solve the search problem for a set with NN elements using only O(N)O(\sqrt{N}) steps. Unfortunately, it is impossible to reduce the order of the complexity of this problem, however, it is possible to make improvements by a constant factor. In this paper we pursued such improvements for search problem in sets with known probability distributions. We have shown that by using a modified version of quantum search algorithm, it is possible to decrease the expected number of iterations for such sets.

Keywords

Cite

@article{arxiv.2207.10770,
  title  = {Quantum search in sets with prior knowledge},
  author = {Umut Çalıkyılmaz and Sadi Turgut},
  journal= {arXiv preprint arXiv:2207.10770},
  year   = {2022}
}
R2 v1 2026-06-25T01:07:57.103Z