We know that the Grover algorithm outputs a marked item. Now we want to know the locations of all items. I can't find any paper to solve this problem.
$\begingroup$
$\endgroup$
1
-
1$\begingroup$ quantumcomputing.stackexchange.com/q/5318/11793 is perhaps relevant. $\endgroup$– CondoJun 30, 2021 at 14:32
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
0
Grover's search returns a uniform superposition of all marked items. So, yes, in your last step, you measure it and find a random sample out of that set. If you want others, just repeat and you'll get another random sample.
If you want to be a bit more directed, you can explicitly exclude any items you've previously found by unmarking them in your oracle step.
answered Jun 30, 2021 at 13:41