[pclmulqdq]

To load those bits into your quantum computer, you need to spend O(n) time. Most practical searches are O(n).

[bawolff]

Not neccesarily, you can calculate them on the fly.

[zerodensity]

How so you mean calculating them on the fly? You need to at least load the data to perform operations on it.

[bawolff]

Grover's algorithm does not require you to load the data to be searched through if it can be generated instead. Grover's algorithm is not neccesarily searching through a list but searching through the output of a function. Sure if your function is an array index operator you need to load the underlying data, but many large search problems are not that.

[zerodensity]

That clears that up thanks.