Quantum Algorithm for Searching of Two Sets Intersection
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909160269938688 |
|---|---|
| author | Khadiev, Kamil Krendeleva, Elizaveta |
| author_facet | Khadiev, Kamil Krendeleva, Elizaveta |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_16897 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Quantum Algorithm for Searching of Two Sets Intersection Khadiev, Kamil Krendeleva, Elizaveta Quantum Physics 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. |
| title | Quantum Algorithm for Searching of Two Sets Intersection |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2312.16897 |