Searching via nonlinear quantum walk on the 2D-grid

09/16/2020

∙

by   Basile Herzog, et al.

∙

0

∙

share

We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer <cit.>, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional grid, keeping the same computational advantage with respect to the classical algorithms. For this purpose, we have considered the free lattice Hamiltonian, with linear dispersion relation introduced by Childs and Ge <cit.>. The numerical simulations showed that the walker finds the marked vertex in O(N^1/4log^3/4 N) steps, with probability O(1/log N), for an overall complexity of O(N^1/4log^7/4N). We also proved that there exists an optimal choice of the walker parameters to avoid that the time measurement precision affects the complexity searching time of the algorithm.