  Recently, quantized versions of random walks have been explored as effective
elements for quantum algorithms. In the simplest case of one dimension, the
theory has remained divided into the discrete-time quantum walk and the
continuous-time quantum walk. Though the properties of these two walks have
shown similarities, it has remained an open problem to find the exact relation
between the two. The precise connection of these two processes, both quantally
and classically, is presented. Extension to higher dimensions is also
discussed.
