@article{niroula_nam_2021,
title={A quantum algorithm for string matching},
DOI={10.1038/s41534-021-00369-3},
abstractNote={AbstractAlgorithms that search for a pattern within a larger data-set appear ubiquitously in text and image processing. Here, we present an explicit, circuit-level implementation of a quantum pattern-matching algorithm that matches a search string (pattern) of length M inside a longer text of length N. Our algorithm has a time complexity of $$\tilde{O}(\sqrt{N})$$
O
̃
(
N
)
, while the space complexity remains modest at O(N + M). We report the quantum gate counts relevant for both pre-fault-tolerant and fault-tolerant regimes.},
publisher={Springer Science and Business Media LLC},
author={Niroula, Pradeep and Nam, Yunseong},
year={2021},
month={Feb}
}