Searching via nonlinear quantum walk on the 2D-grid

We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer \cite{meyer2013nonlinear}, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional grid, keeping the same computational advantage \BHg{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 \cite{Childs_2014}. The numerical simulations showed that the walker finds the marked vertex in $O(N^{1/4} \log^{3/4} N)$ steps, with probability $O(1/\log N)$, for an overall complexity of $O(N^{1/4}\log^{7/4}N)$. 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

ICIS 2008 Panel Report: IS Has Outgrown the Need for Reference Discipline Theories, or Has It?

We view the current belief in reference discipline theories and their value in MIS research as exhibiting dominance in our field. This article is based on the panel discussion at the 2008 International Conference on Information Systems (ICIS) held in Paris, France. It examines why this dominance has the potential to harm the future prospects of our intellectual endeavors. In counterpoint, we present the argument that the use of reference disciplines should continue. Aside from the fact that the belief in the value of reference discipline is continued, there are benefits derived from anchoring research initiatives in reference discipline theories which should be acknowledged. Under certain situations such use should be encouraged and broadened. Additionally, we will present arguments for viable alternatives to relying on reference disciplines in theory building. The alternatives are aimed at building and expanding indigenous IS theory