Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching
Longest common substring (LCS) is an important text processing problem, which has
recently been investigated in the quantum query model. The decision version of this …
recently been investigated in the quantum query model. The decision version of this …
On the quantum time complexity of divide and conquer
We initiate a systematic study of the time complexity of quantum divide and conquer
algorithms for classical problems. We establish generic conditions under which search and …
algorithms for classical problems. We establish generic conditions under which search and …