Skip to content
DSML.KZ
Publications

Article · Učenye zapiski Kazanskogo gosudarstvennogo universiteta. Seriâ Fiziko-matematičeskie nauki/Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki · January 1, 2020

Quantum Search for a Given Substring in the Text Using a Hashing Technique

Marat Ablayev, Nailya Salikhova

Marat Ablayev
Open via DOI

Abstract

The problem of searching for a given substring in the text was considered. It is known that classical algorithms solve this problem in a linear time depending on the length of the text and the specified template. Quantum algorithms speed up the search by “square root times”. In this paper, we proposed a quantum algorithm that solves the search problem a) with a high probability of getting the correct result and b) with the same acceleration (by “square root times”) as compared with the classical one, but it c) requires much less memory (based on the number of qubits used) than the previously known quantum algorithms.

Quantum Computing Algorithms and ArchitectureAlgorithms and Data CompressionQuantum Information and Cryptographyquantum searchsubstring searchstring matching

More by Marat Ablayev