A classical limit of Grover’s algorithm induced by dephasing: Coherence versus entanglement
A classical limit of Grover’s algorithm induced by dephasing: Coherence versus entanglement
A new approach to the classical limit of Grover's algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover's unitary operations, which drives pure quantum states to decohered mixed states. One can identify a specific element among $N$ unsorted elements by a probability of the …