How the quantum search algorithm works
Variation noted, here’s what a quantum search algorithm might look like:
The search register contains candidate solutions ∣x⟩=∣x1,x2,…,xn⟩ to the search problem. The key point is that you should think of the search register as being in some superposition ∑xαx∣x⟩ of different possible routes through the cities, and x as being some bit string representation of a route. Step 1 of the quantum search algorithm will just be some fixed quantum circuit, made up of standard quantum gates – things like the Hadamard and CNOT gates, as discussed in the previous essay.
Source: quantum.country