We consider an interpolation with the parameter
p∈[0,1] between the discrete-time quantum (
p=0) and its intrinsic random (
p=1) walks on a finite connected graph. Its time evolution is defined by the convex combination of the Kraus (CPTP) maps of the quantum and random walks. The Kraus map of the random walk is represented by taking a kind of projection of that of the quantum walk. The time evolution of the interpolation is interpreted as the combination of the following two dynamics of
2 walkers on the same graph correlated with each other:
2 walkers move independently of each other (no-correlation) with probability
1−p, while
2 walkers always move into the same position (the maximal correlation) with probability
p at each time step. In this paper, we generalize the random walk to a new walk, namely, the correlated walk, which preserves the intrinsic property and relaxes the maximal correlation of the random walk. This correlation is determined by a partition of the arc sets in the underlying graph. We show that the eigenvalues of the interpolating walk between the correlated and quantum walks live in
{z∈C∣1−p≤∣z∣≤1} and that the absorption state coincides with that of the correlated walk, which is characterized by the underlying graph structures.
We show that with the addition of multiple walkers, quantum walks on a line can be transformed into lattice graphs of higher dimension. Thus, multi-walker walks can simulate single-walker walks on higher dimensional graphs and vice versa. This exponential complexity opens up new applications for present-day quantum walk experiments. We discuss the applications of such higher-dimensional structures and how they relate to linear optics quantum computing. In particular we show that multi-walker quantum walks are equivalent to the BosonSampling model for linear optics quantum computation proposed by Aaronson & Arkhipov. With the addition of control over phase-defects in the lattice, which can be simulated with entangling gates, asymmetric lattice structures can be constructed which are universal for quantum computation.