Perfect example of how "if the code is compact, it's fast" can be deceiving :)

Search is all you need!

If you have the time.

Or if we can expand quantum superposition algorithms from 2^N states, for quantum circuits with N control qubits, to 2^(T*N) superpositions over T time steps, via some kind of superposition tree recursion. The number of superpositions increasing exponentially for T steps (and then reducing for another T steps) on a single recursive physical circuit.

That is not supported by the physical laws we have, but it is an interesting idea.