KFU. Card publication. Quantum search in a dictionary based on fingerprinting-hashing

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

QUANTUM SEARCH IN A DICTIONARY BASED ON FINGERPRINTING-HASHING

Form of presentation

Articles in international journals and collections

Year of publication

2024

Язык

английский

Authors, employees of KFU

Ablaev Marat Faridovich, author

Ablaev Farid Mansurovich, author

Bibliographic description in the original language

Farid Ablayev, Nailya Salikhova, Marat Ablayev. Quantum search in a dictionary based on fingerprinting-hashing / Farid Ablayev, Nailya Salikhova, Marat Ablayev // arXiv:2412.11422 [quant-ph]

Annotation

arXiv:2412.11422 [quant-ph]

Keywords

quantum computations, quantum fingerprinting, quantum hashing

The name of the journal

arXiv:2412.11422 [quant-ph]

URL

https://arxiv.org/abs/2412.11422

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=308633&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Ablaev Marat Faridovich	ru_RU
dc.contributor.author	Ablaev Farid Mansurovich	ru_RU
dc.date.accessioned	2024-01-01T00:00:00Z	ru_RU
dc.date.available	2024-01-01T00:00:00Z	ru_RU
dc.date.issued	2024	ru_RU
dc.identifier.citation	Farid Ablayev, Nailya Salikhova, Marat Ablayev. Quantum search in a dictionary based on fingerprinting-hashing / Farid Ablayev, Nailya Salikhova, Marat Ablayev // arXiv:2412.11422 [quant-ph]	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=308633&p_lang=2	ru_RU
dc.description.abstract	arXiv:2412.11422 [quant-ph]	ru_RU
dc.description.abstract	n 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(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(logn+logm) qubits. Note that previously developed algorithms by other researchers without hashing require O(logn+m) qubits.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	quantum computations	ru_RU
dc.subject	quantum fingerprinting	ru_RU
dc.subject	quantum hashing	ru_RU
dc.title	Quantum search in a dictionary based on fingerprinting-hashing	ru_RU
dc.type	Articles in international journals and collections	ru_RU