Chapter 14: Complexity and the Quadratic Speedup

This section is already in the book plan, but it has not been written fully yet. The book owner can press Generate section to write this part with the language model connected to TheoryTrace.

Section plan:

Compares Grover's O(sqrt(N)) oracle complexity with classical O(N) search, explains query complexity, and discusses why Grover's speedup is provably optimal for unstructured search.