Combines classical processing with quantum computation in one procedure. Classical logic prepares circuits, selects iteration counts, evaluates measured outcomes, checks stopping conditions, and updates the next quantum run. section 11.0 section 11.1
A typical hybrid optimization loop:
- Prepare a quantum state with a circuit and run a chosen number of Grover iterations. section 11.1
- Measure the circuit and process the outcome classically to determine whether it is good. section 11.1
- Update circuit parameters or the search threshold, then repeat until progress or a stopping condition ends the search. section 11.3.3
Grover adaptive search
For f(k) = k² − 5 with 0 ≤ k < 4, a circuit encodes the polynomial, an oracle marks desired outcomes, and Grover iterations amplify them. Classical processing examines measurements and controls subsequent iterations. The same pattern supports a knapsack optimizer: measured selections are converted into value and weight, then the minimum value and circuit parameters are adjusted. section 11.1 section 11.3.3
Figure 11.2 A flow diagram of Grover adaptive search
Use the flow diagram to trace the feedback loop from quantum execution through classical evaluation and back to the next iteration. section 11.1




