A quantum algorithm using suffix arrays and quantum longest-common-prefix comparisons solves multiple string matching in O*(n + sqrt(mL)) queries, matching the lower bound up to logs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Algorithm for the Multiple String Matching Problem
A quantum algorithm using suffix arrays and quantum longest-common-prefix comparisons solves multiple string matching in O*(n + sqrt(mL)) queries, matching the lower bound up to logs.