Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe

QI: Fachverband Quanteninformation

QI 12: Poster I

QI 12.13: Poster

Dienstag, 19. März 2024, 11:00–14:30, Poster B

Hybrid classical-quantum text search based on hashing — •Farid Ablayev, Marat Ablayev, and Nailya Salikhova — Kazan, Russian Federation

We consider the problem of finding occurrences of a given substring w (of length m) in a text string (of length n).

We propose a hybrid classical - quantum algorithm A, that implements Grover’s search to find a given substring in a text.

What’s new is that our algorithm uses the hashing technique.

The main idea of the paper is the use of the uniform hash family functions technique to save space complexity in quantum search. The A algorithm is based on a certain universal family of hash functions. The arXiv version of the article was published in November 2024 https://arxiv.org/abs/2311.01213.

Keywords: quantum algorithms; text search; hashing; uniform hash family functions

100% | Bildschirmansicht | English Version | Kontakt/Impressum/Datenschutz
DPG-Physik > DPG-Verhandlungen > 2024 > Berlin