Quantum Algorithms for String Processing
Quantum Physics
2023-05-19 v1
Abstract
In the paper, we investigate two problems on strings. The first one is the String matching problem, and the second one is the String comparing problem. We provide a quantum algorithm for the String matching problem that uses exponentially less quantum memory than existing ones. The algorithm uses the hashing technique for string matching, quantum parallelism, and ideas of Grover's search algorithm. Using the same ideas, we provide two algorithms for the String comparing problem. These algorithms also use exponentially less quantum memory than existing ones. Additionally, the second algorithm works exponentially faster than the existing one.
Cite
@article{arxiv.2012.00372,
title = {Quantum Algorithms for String Processing},
author = {Farid Ablayev and Marat Ablayev and Kamil Khadiev and Nailya Salihova and Alexander Vasiliev},
journal= {arXiv preprint arXiv:2012.00372},
year = {2023}
}
Comments
13 pages