| Форма представления | Статьи в зарубежных журналах и сборниках |
| Год публикации | 2024 |
| Язык | английский |
|
Аблаев Марат Фаридович, автор
Аблаев Фарид Мансурович, автор
|
| Библиографическое описание на языке оригинала |
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] |
| Аннотация |
arXiv:2412.11422 [quant-ph] |
| Ключевые слова |
quantum computations, quantum fingerprinting, quantum hashing |
| Название журнала |
arXiv:2412.11422 [quant-ph]
|
| URL |
https://arxiv.org/abs/2412.11422 |
| Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на эту карточку |
https://repository.kpfu.ru/?p_id=308633 |
Полная запись метаданных  |
| Поле DC |
Значение |
Язык |
| dc.contributor.author |
Аблаев Марат Фаридович |
ru_RU |
| dc.contributor.author |
Аблаев Фарид Мансурович |
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/?p_id=308633 |
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 |
Статьи в зарубежных журналах и сборниках |
ru_RU |
|
EN 
中文 
ES 
Карта сайта
