Quantum Algorithm for Searching of Two Sets Intersection
Quantum Physics
2024-04-05 v1
Abstract
In the paper, we investigate Two Sets Intersection problem. Assume that we have two sets that are subsets of n objects. Sets are presented by two predicates that show which of n objects belong to these sets. We present a quantum algorithm that finds an element from the two sets intersection. It is a modification of the well-known Grover's search algorithm that uses two Oracles with access to the predicates. The algorithm is faster than the naive application of Grover's search.
Keywords
Cite
@article{arxiv.2312.16897,
title = {Quantum Algorithm for Searching of Two Sets Intersection},
author = {Kamil Khadiev and Elizaveta Krendeleva},
journal= {arXiv preprint arXiv:2312.16897},
year = {2024}
}