Is there a variant of Grover's algorithm that would work on something
like a real database? In the simplest case (which happens to be the
one I'm interested in), the database consists of an N-bit key and a
single bit value; all the keys appear in the database, and only one of
them has a 1 bit; all the others have a 0 bit. Computing the value
from the key takes too much work to repeat sqrt(N) times; I'd like to
compute it once, store it, and then search on it.