The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena by performing a detailed numerical study of discrete-time quantum walks. In one dimension (1D), we compute the structure of the probability distribution, which is not a smooth curve but shows oscillatory features on all length scales. By analyzing walks up to $N$ = 1000000 steps, we discuss the scaling characteristics and limiting forms of the QW in both real and Fourier space. In 2D, with a view to ready experimental realization, we consider two types of QW, one based on a four-faced coin and the other on sequential flipping of a single two-faced coin. Both QWs may be generated using two two-faced coins, which in the first case are completely unentangled and in the second are maximally entangled. We draw on our 1D results to characterize the properties of both walks, demonstrating maximal speed-up and emerging semi-classical behavior in the maximally entangled QW.
We present and study a two-particle quantum walk on the line in which the two particles interact via a long-range Coulombian-like interaction. We obtain the spectrum of the system as well as study the type of molecules that form, attending to the bosonic or fermionic nature of the walkers. The usual loss of distinction between attractive and repulsive forces does not entirely apply in our model because of the long-range of the interaction.
We study the effects of long-range hopping and long-range inter-particle interactions on quantum walk of hard-core bosons in ideal and disordered one-dimensional lattices. We find that the range of hopping has a much more significant effect on the particle correlation dynamics than the range of interactions. We illustrate that long-range hopping makes the correlation diagrams asymmetric with respect to the sign of the interaction and examine the relative role of repulsive and attractive interactions on the dynamics of scattering by isolated impurities and Anderson localization in dis- ordered …
We study the effect of small decoherence in continuous-time quantum walks on long-range interacting cycles, which are constructed by connecting all the two nodes of distance m on the cycle graph. In our investigation, each node is continuously monitored by an individual point contact, which induces the decoherence process. We obtain the analytical probability distribution and the mixing time upper bound. Our results show that, for small rates of decoherence, themixing time upper bound is independent of distance parameter m and is proportional to inverse of decoherence rate.
We realize a pair of simultaneous ten-step one-dimensional quantum walks with two walkers sharing coins, which we prove is analogous to the ten-step two-dimensional quantum walk with a single walker holding a four-dimensional coin. Our experiment demonstrates a ten-step quantum walk over an 11x11 two-dimensional lattice with a line defect, thereby realizing a localized walker state.
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 …
Quantum walk acts obviously different from its classical counterpart, but decoherence will lessen and close the gap between them. To understand this process, it is necessary to investigate the evolution of quantum walk under different situation of decoherence. In this article, we study a non-Markovian decoherent quantum walk on a line. In the short time regime, the behavior of the walk deviates from both idea quantum walks and classical random walks. The position variance as a measure of quantum walk starts oscillating from the first several steps and tends to be linear on time and showing a d…
We analyze the long time behavior of a discrete time quantum walk subject to decoherence with a strong spatial dependence, acting on one half of the lattice. We show that, except for limiting cases on the decoherence parameter, the quantum walk at late times behaves sub-ballistically, meaning that the characteristic features of the quantum walk are not completely spoiled. Contrarily to expectations, the asymptotic behavior is non Markovian, and depends on the amount of decoherence. This feature can be clearly shown on the long time value of the Generalized Chiral Distribution (GCD).
A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as $P(\ell) = αδ(\ell-1) + (1-α) δ(\ell-2^n)$ with $n \geq 1$. Even the $n=1$ case shows a drastic change in the scaling behaviour for any $α\neq 0,1$. Specifically, $\langle x^2\rangle \propto t^{3/2}$ for $0 < α< 1$, implying the walk is slower compared to the usual quantum walk. This scaling behaviour, which is neither conventional quantum nor classical, can be…
Discrete-time quantum walk in one-dimension is studied from a path-integral perspective. This enables derivation of a closed-form expression for amplitudes corresponding to any coin-position basis of the state vector of the quantum walker at an arbitrary step of the walk. This provides a new approach to the foundations and applications of quantum walks.
In this paper we study a one-dimensional quantum random walk with the Hadamard transformation which is often called the Hadamard walk. We construct the Hadamard walk using a transition matrix on probability amplitude and give some results on symmetry of probability distributions for the Hadamard walk.
We obtain stationary measures for the one-dimensional three-state Grover walk with one defect by solving the corresponding eigenvalue problem. We clarify a relation between stationary and limit measures of the walk.
In this paper, we numerically study quantum walks on two kinds of two-dimensional graphs: cylindrical strip and Mobius strip. The two kinds of graphs are typical two-dimensional topological graph. We study the crossing property of quantum walks on these two models. Also, we study its dependence on the initial state, size of the model. At the same time, we compare the quantum walk and classical walk on these two models to discuss the difference of quantum walk and classical walk.
In this paper we investigate one dimensional quantum walks with two-step memory, which can be viewed as an extension of quantum walks with one-step memory. We develop a general formula for the amplitudes of the two-step-memory walk with Hadamard coin by using path integral approach, and numerically simulate its process. The simulation shows that the probability distribution of this new walk is different from that of the Hadamard quantum walk with one-step memory, while it presents some similarities with that of the normal Hadamard quantum walk without memory.
We analyze the solution of the coined quantum walk on a line. First, we derive the full solution, for arbitrary unitary transformations, by using a new approach based on the four "walk fields" which we show determine the dynamics. The particular way of deriving the solution allows a rigorous derivation of a long wavelength approximation. This long wavelength approximation is useful as it provides an approximate analytical expression that captures the basics of the quantum walk and allows us to gain insight into the physics of the process.
The first general analytic solutions for the one-dimensional walk in position and momentum space are derived. These solutions reveal, among other things, new symmetry features of quantum walk probability densities and further insight into the behaviour of their moments. The analytic expressions for the quantum walk probability distributions provide a means of modelling quantum phenomena that is analogous to that provided by random walks in the classical domain.
We analyze final-time dependent discrete-time quantum walks in one dimension. We compute asymptotics of the return probability of the quantum walk by a path counting approach. Moreover, we discuss a relation between the quantum walk and the corresponding final-time dependent classical random walk.
Full state revivals in a quantum walk can be viewed as returning of the walker to the initial quantum state in a periodic fashion during the propagation of the walk. In this paper we show that for any given number of spatial dimensions, a coin operator can be constructed to generate a quantum walk having full revivals with any desired period. From the point of view of quantum computation and simulations, these coin operators can be useful in implementing quantum walks which oscillate between any two states with a finite periodicity.
We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.
We introduce and analyze a one-dimensional quantum walk with two time-independent rotations on the coin. We study the influence on the property of quantum walk due to the second rotation on the coin. Based on the asymptotic solution in the long time limit, a ballistic behaviour of this walk is observed. This quantum walk retains the quadratic growth of the variance if the combined operator of the coin rotations is unitary. That confirms no localization exhibits in this walk. This result can be extended to the walk with multiple time-independent rotations on the coin.
The Pólya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. Štefaňák, I. Jex and T. Kiss, Phys. Rev. Lett. \textbf{100}, 020501 (2008)] which is based on a specific measurement scheme. The Pólya number of a quantum walk depends in general on the choice of the coin and the initial coin state, in contrast to classical random walks where the lattice dimension uniquely determines it. We analyze several examples to depict the variety of possible recurrence properties. First, we show that for the class of quantum walks driven by in…
Stationary measures of quantum walks on the one-dimensional integer lattice are well studied. However, the stationary measure for the higher dimensional case has not been clarified. In this paper, we give the stationary amplitude for quantum walks on the d-dimensional integer lattice with a finite support by solving the corresponding eigenvalue problem. As a corollary, we can obtain the stationary measures of the Grover walks. In fact, the amplitude for the stationary measure is an eigenfunction with eigenvalue 1.
Coined quantum walks may be interpreted as the motion in position space of a quantum particle with a spin degree of freedom; the dynamics are determined by iterating a unitary transformation which is the product of a spin transformation and a translation conditional on the spin state. Coined quantum walks on the d-dimensional lattice can be treated as special cases of coined quantum walks on d-dimensional Euclidean space. We study quantum walks on d-dimensional Euclidean space and prove that the sequence of rescaled probability distributions in position space associated to the unitary evolutio…
The discrete quantum walk in N dimensions is analyzed from the perspective of its dispersion relations. This allows understanding known properties, as well as designing new ones when spatially extended initial conditions are considered. This is done by deriving wave equations in the continuum, which are generically of the Schrödinger type, and allow devising interesting behaviors, such as ballistic propagation without deformation, or the generation of almost flat probability distributions, what is corroborated numerically. There are however special points where the energy surfaces display inte…
We analyze the quantum walk in higher spatial dimensions and compare classical and quantum spreading as a function of time. Tensor products of Hadamard transformations and the discrete Fourier transform arise as natural extensions of the quantum coin toss in the one-dimensional walk simulation, and other illustrative transformations are also investigated. We find that entanglement between the dimensions serves to reduce the rate of spread of the quantum walk. The classical limit is obtained by introducing a random phase variable.
In this paper, we consider decoherence in continuous-time quantum walks on long-range interacting cycles (LRICs), which are the extensions of the cycle graphs. For this purpose, we use Gurvitz's model and assume that every node is monitored by the corresponding point contact induced the decoherence process. Then, we focus on large rates of decoherence and calculate the probability distribution analytically and obtain the lower and upper bounds of the mixing time. Our results prove that the mixing time is proportional to the rate of decoherence and the inverse of the distance parameter ($\emph{…
Multi-dimensional quantum walks usually require large coin spaces. Here we show that the non-localized case of the spatial density probability of the two-dimensional Grover walk can be obtained using only a two-dimensional coin space and a quantum walk in alternate directions. We present a formal proof of this correspondence and analyze the behavior of the coin-position entanglement as well as the x-y spatial entanglement in our scheme with respect to the Grover one. We show that our experimentally simpler scheme allows to entangle the two orthogonal directions of the walk more efficiently.
Quantum walks with long-range steps $R^{-γ}$ ($R$ being the distance between sites) on a discrete line behave in similar ways for all $γ\geq2$. This is in contrast to classical random walks, which for $γ>3$ belong to a different universality class than for $γ\leq 3$. We show that the average probabilities to be at the initial site after time $t$ as well as the mean square displacements are of the same functional form for quantum walks with $γ=2$, 4, and with nearest neighbor steps. We interpolate this result to arbitrary $γ\geq2$.
In this paper, we work on a quantum walk whose system is manipulated by a five-diagonal unitary matrix, and present long-time limit distributions. The quantum walk launches off a location and delocalizes in distribution as its system is getting updated. The five-diagonal matrix contains a phase term and the quantum walk becomes a standard coined walk when the phase term is fixed at special values. Or, the phase term gives an effect on the quantum walk. As a result, we will see an explicit form of a long-time limit distribution for a quantum walk driven by the matrix, and thanks to the exact fo…
We present two long-time limit theorems of a 3-state quantum walk on the line when the walker starts from the origin. One is a limit measure which is obtained from the probability distribution of the walk at a long-time limit, and the other is a convergence in distribution for the walker's position in a rescaled space by time. In addition, as an application of the walk, we obtain discrete uniform limit measures from the 3-state walk with a delocalized initial state.
This study investigates unitary equivalent classes of one-dimensional quantum walks. We prove that one-dimensional quantum walks are unitary equivalent to quantum walks of Ambainis type and that translation-invariant one-dimensional quantum walks are Szegedy walks. We also present a necessary and sufficient condition for a one-dimensional quantum walk to be a Szegedy walk.
This study investigated the unitary equivalent classes of one-dimensional quantum walks. We determined the unitary equivalent classes of one-dimensional quantum walks, two-phase quantum walks with one defect, complete two-phase quantum walks, one-dimensional quantum walks with one defect and translation-invariant one-dimensional quantum walks. The unitary equivalent classes of one-dimensional quantum walks with initial states were also considered.
The possibility of fine-tuning the couplings between optical modes is a key requirement in photonic circuits for quantum simulations. In these architectures, emulating the long-time evolution of particles across large lattices requires sophisticated setups, that are often intrinsically lossy. Here we report ultra-long photonic quantum walks across several hundred optical modes, obtained by propagating a light beam through very few closely-stacked liquid-crystal metasurfaces. By exploiting spin-orbit effects, these implement space-dependent polarization transformations that mix circularly polar…
The quantum walk differs fundamentally from the classical random walk in a number of ways, including its linear spreading and initial condition dependent asymmetries. Using stationary phase approximations, precise asymptotics have been derived for one-dimensional two-state quantum walks, one-dimensional three-state Grover walks, and two-dimensional four-state Grover walks. Other papers have investigated asymptotic behavior of a much larger set of two-dimensional quantum walks and it has been shown that in special cases the regions of polynomial decay can be parameterized. In this paper, we sho…
We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Chain is of order 2. This corresponds to the walk having a memory of up to two previous steps. We derive the amplitudes and probabilities for these walks, and point out how they differ from both classical random walks, and quantum walks without memory.
A powerful strategy to accelerate quantum-walk-based search algorithms leverages on resetting protocols, where a detector monitors a target site and the evolution of the walker is restarted if no detection occurs within a fixed time interval. The optimal resetting rate can be extracted from the time evolution of the probability $S(t)$ that the detector has not clicked up to time $t$. We analyze $S(t)$ for a quantum walk on a one-dimensional lattice when the coupling between sites decays algebraically as $d^{-α}$ with the distance $d$, for $α\in(0,\infty)$. At long times, $S(t)$ decays with a u…
Random walks are fundamental models of stochastic processes with applications in various fields including physics, biology, and computer science. We study classical and quantum random walks under the influence of stochastic resetting on arbitrary networks. Based on the mathematical formalism of quantum stochastic walks, we provide a framework of classical and quantum walks whose evolution is determined by graph Laplacians. We study the influence of quantum effects on the stationary and long-time average probability distribution by interpolating between the classical and quantum regime. We comp…
We consider a discrete time quantum walker in one dimension, where at each step, the step length $\ell$ is chosen from a distribution $P(\ell) \propto \ell^{-δ-1}$ with $\ell \leq \ell_{max}$. We evaluate the probability $f(x,t)$ that the walker is at position $x$ at time $t$ and its first two moments. As expected, the disorder effectively localizes the walk even for large values of $δ$. Asymptotically, $\langle x^2 \rangle \propto t^{3/2}$ and $\langle x \rangle \propto t^{1/2}$ independent of $δ$ and $\ell$, both finite. The scaled distribution $f(x,t)t^{1/2}$ plotted versus $x/t^{1/2}$ show…
The dynamics of the survival probability of quantum walkers on a one-dimensional lattice with random distribution of absorbing immobile traps are investigated. The survival probability of quantum walkers is compared with that of classical walkers. It is shown that the time dependence of survival probability of quantum walkers has a piecewise stretched exponential character depending on the density of traps in numerical and analytical observations. The crossover between the quantum analogs of the Rosenstock and Donsker-Varadhan behaviors is identified.
The Hadamard walk is a typical model of the discrete-time quantum walk. We investigate sojourn times of the Hadamard walk on a line by a path counting method.
We study decoherence in the quantum walk on the xy-plane. We generalize the method of decoherent coin quantum walk, introduced by [T.A. Brun, et.al, Phys.Rev.A 67 (2003) 032304],which could be applicable to all sorts of decoherence in two dimensional quantum walks, irrespective of the unitary transformation governing the walk. As an application we study decoherence in the presence of broken line noise in which the quantum walk is governed by the two-dimensional Hadamard operator.
We introduce a family of quantum walks on cycles parametrized by their liveliness, defined by the ability to execute a long-range move. We investigate the behaviour of the probability distribution and time-averaged probability distribution. We show that the liveliness parameter, controlling the magnitude of the additional long-range move, has a direct impact on the periodicity of the limiting distribution. We also show that the introduced model provides a method for network exploration which is robust against trapping.
There has recently been considerable interest in quantum walks in connection with quantum computing. The walk can be considered as a quantum version of the so-called correlated random walk. We clarify a strong structural similarity between both walks and study limit theorems and absorption problems for correlated random walks by our PQRS method, which was used in our analysis of quantum walks.
In this paper we consider the model with decoherence operators introduced by [Brun,T.A, et.al, Phys.Rev.A 67 (2003) 032304] which has recently been considered in the two-dimensional setting by [Ampadu,C., Brun-Type Formalism for Decoherence in Two Dimensional Quantum Walks, Communication in Theoretical Physics To Appear, arXiv:1104.2061 (2011)] to obtain the limit of the decoherent quantum walk.
