String Matching in O(n+m) Quantum Time
Abstract
We show how to determine whether a given pattern p of length m occurs in a given text t of length n in O(n+m) O allows for logarithmic factors in m and n/m time, with inverse polynomial failure probability. This algorithm combines quantum searching algorithms with a technique from parallel string matching, called Deterministic Sampling.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.