Chapter 13: QAOA for Canonical Problems

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:

Applies QAOA to MaxCut, graph coloring, maximum independent set, portfolio selection, knapsack, and scheduling-style problems. Demonstrates how each problem is encoded and what the measured bitstrings mean.