I'm specifically looking at implementing Durr, Hoyer, A Quantum Algorithm for Finding the Minimum in qiskit, finding the index with the smallest value in a list using grover's algorithm.
Say you have a list L, [1, 4, 0, 2] for example, and an oracle that takes the superposition of all possible indexes of that list, n. How do you write the oracle in such a way that you can use the value of n to get L[n]?
