Quantum search in a dictionary based on fingerprinting-hashing
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909430277210112 |
|---|---|
| author | Ablayev, Farid Salikhova, Nailya Ablayev, Marat |
| author_facet | Ablayev, Farid Salikhova, Nailya Ablayev, Marat |
| contents | In this work, we present a quantum query algorithm for searching a word of length $m$ in an unsorted dictionary of size $n$. The algorithm uses $O(\sqrt{n})$ queries (Grover operators), like previously known algorithms.
What is new is that the algorithm is based on the quantum fingerprinting-hashing technique, which (a) provides a first level of amplitude amplification before applying the sequence of Grover amplitude amplification operators and (b) makes the algorithm more efficient in terms of memory use -- it requires $O(\log n + \log m)$ qubits.
Note that previously developed algorithms by other researchers without hashing require $O(\log n + m)$ qubits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_11422 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum search in a dictionary based on fingerprinting-hashing Ablayev, Farid Salikhova, Nailya Ablayev, Marat Quantum Physics Data Structures and Algorithms Information Theory In this work, we present a quantum query algorithm for searching a word of length $m$ in an unsorted dictionary of size $n$. The algorithm uses $O(\sqrt{n})$ queries (Grover operators), like previously known algorithms. What is new is that the algorithm is based on the quantum fingerprinting-hashing technique, which (a) provides a first level of amplitude amplification before applying the sequence of Grover amplitude amplification operators and (b) makes the algorithm more efficient in terms of memory use -- it requires $O(\log n + \log m)$ qubits. Note that previously developed algorithms by other researchers without hashing require $O(\log n + m)$ qubits. |
| title | Quantum search in a dictionary based on fingerprinting-hashing |
| topic | Quantum Physics Data Structures and Algorithms Information Theory |
| url | https://arxiv.org/abs/2412.11422 |