The search of an unstructured database amounts to finding one element having a certain property out $N$ elements. classical with oracle checking at time requires on average $N/2$ steps. Grover algorithm for the quantum search, and its unitary Hamiltonian evolution analogue, accomplish asymptotically optimally in $\mathcal{O} (\sqrt{N})$ We reformulate problem as dissipative Markov process actin...
