- #1

dakshina gandikota

- 2

- 0

https://people.cs.umass.edu/~strubell/doc/quantum_tutorial.pdf

https://www.codeproject.com/Articles/1131573/Grovers-Search-Algorithm-explained

I have these questions:

- The Oracle "knows" the correct bits in the first invocation itself. So why do sqrt(N) invocations where N is the number of states given by N=2
^{L}and L is the number of qubits? - Conversely, the intent seems: to increase the amplitude of the answer bits taking into account the noise from the environment during computation. I don't find any other reason to invoke the oracle beyond once. Anyone agree?

David Deutsch explains the diffusion in the algorithm using NAND and XOR gates. Can anyone explain to me what he means by that?