Consider the number of steps needed by algorithms to locate the minimum of functions defined on the d-cube, where the functions are known to have no local minima except the global minimum. Regard this ...

Quantum walks, the quantum analogue of classical random walks, have emerged as a pivotal framework in the study of quantum dynamics and information processing. These systems exploit inherently quantum ...

In this paper we give a survey of some recent results for random walk in random scenery (RWRS). On ${\Bbb Z}^{d},d\geq 1$, we are given a random walk with i.i.d. increments and a random scenery with i ...