A Quantum Query Complexity Trichotomy for Regular Languages
Electronic Colloquium on Computational Complexity, pp. 612019.
We present a trichotomy theorem for the quantum query complexity of regular languages. Every regular language has quantum query complexity Theta(1), ~Theta(sqrt n), or Theta(n). The extreme uniformity of regular languages prevents them from taking any other asymptotic complexity. This is in contrast to even the context-free languages, w...More
PPT (Upload PPT)