We present an approach using quantum walks (QWs) to redistribute ultracold atoms in an optical lattice. Different density profiles of atoms can be obtained by exploiting the controllable properties of QWs, such as the variance and the probability distribution in position space using quantum coin parameters and engineered noise. The QW evolves the density profile of atoms in a superposition of position space resulting in a quadratic speedup of the process of quantum phase transition. We also discuss implementation in presently available setups of ultracold atoms in optical lattices.
We consider quantum random walks on congested lattices and contrast them to classical random walks. Congestion is modelled with lattices that contain static defects which reverse the walker's direction. We implement a dephasing process after each step which allows us to smoothly interpolate between classical and quantum random walkers as well as study the effect of dephasing on the quantum walk. Our key results show that a quantum walker escapes a finite boundary dramatically faster than a classical walker and that this advantage remains in the presence of heavily congested lattices. Also, we …
Quantum random walks are the quantum counterpart of classical random walks, and were recently studied in the context of quantum computation. A quantum random walker is subject to self interference, leading to a remarkably different behavior than that of classical random walks such as ballistic propagation or localization due to disorder. Physical implementations of quantum walks have only been made in very small scale systems severely limited by decoherence. Here we show that the propagation of photons in waveguide lattices, which have been studied extensively in recent years, are essentially …
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.
The existence of localization for the Grover walk on the multi-dimensional lattice is known. This paper gives some conditions for the existence of localization for the space-homogeneous quantum walks. We also prove that localization does not occur for the Fourier walk on the multi-dimensional lattice.
We propose an experimental realization of discrete quantum random walks using neutral atoms trapped in optical lattices. The random walk is taking place in position space and experimental implementation with present day technology --even using existing set-ups-- seems feasible. We analyze the influence of possible imperfections in the experiment and investigate the transition from a quantum random walk to the classical random walk for increasing errors and decoherence.
In this paper, we introduce a quantum walk whose local scattering at each vertex is denoted by a unitary circulant matrix; namely the circulant quantum walk. We also introduce another quantum walk induced by the circulant quantum walk; namely the optical quantum walk, whose underlying graph is a $2$-regular directed graph and obtained by blowing up the original graph in some way. We propose a design of an optical circuit which implements the stationary state of the optical quantum walk. We show that if the induced optical quantum walk does not have $+1$ eigenvalue, then the stationary state of…
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.
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a walker traverses while maintaining coherence. Here, we do this by combining the fast, programmable control provided by optical tweezer arrays with the scalable, homogeneous environment of an optical lattice. Using this new combination of tools we study continuous-time quantum walks of single atoms on a 2D square lattice, and perform proof-of-principle demonstra…
We consider the support of the limit distribution of the Grover walk on crystal lattices with the linear scaling. The orbit of the Grover walk is denoted by the parametric plot of the pseudo-velocity of the Grover walk in the wave space. The region of the orbit is the support of the limit distribution. In this paper, we compute the regions of the orbits for the triangular, hexagonal and kagome lattices. We show every outer frame of the support is described by an ellipse. The shape of the ellipse depends only on the realization of the fundamental lattice of the crystal lattice in $\mathbb{R}^2$…
In this paper, we study the quantum walk on the 2D Penrose Lattice, which is intermediate between periodic and disordered structure. Quantum walk on Penrose Lattice is less efficient in transport comparing to the regular lattices. By calculating the final remaining probability on the initial nodes and estimating the low bound. Our results show that the broken of translational symmetry induces both the localized states and degeneracy of eigenstates at $E=0$, this two differences from regular lattices influence efficiency of quantum walk. Also, we observe the transition from inefficient to effic…
Quantum walks have emerged as an interesting candidate for the implementation of quantum information processing protocols. Optical implementations of quantum walks have been demonstrated by various groups and some have received high-profile coverage. It is often claimed that quantum walks provide an avenue towards universal quantum computation. In this comment I wish to dispel some misconceptions surrounding the prospects of quantum walks as a route towards universal optical quantum computation.
In this paper, we consider stationary measures of discrete-time three-state quantum walks including the Fourier and Grover walks in the one-dimensional lattice. We give non-uniform stationary measures by solving the corresponding eigenvalue problem. Our new method is based on a reduced matrix, which is different from the generating function approach in our previous work. As a corollary, the Fourier walk on the cycle has a stationary measure with a periodicity.
A discrete-time staggered quantum walk was recently introduced as a generalization that allows to unify other versions, such as the coined and Szegedy's walk. However, it also produces new forms of quantum walks not covered by previous versions. To explore their properties, we study here the staggered walk on a hexagonal lattice. Such a walk is defined using a set of overlapping tessellations that cover the graph edges, and each tessellation is a partition of the node set into cliques. The hexagonal lattice requires at least three tessellations. Each tessellation is associated with a local uni…
In this paper, we present a detailed study on discrete-time Dirac quantum walks (DQWs) on triangular and honeycomb lattices. At the continuous limit, these DQWs coincide with the Dirac equation. Their differences in the discrete regime are analyzed through the dispersion relations, with special emphasis on Zitterbewegung. An extension which couples these walks to arbitrary discrete electromagnetic field is also proposed and the resulting Bloch oscillations are discussed.
I obtain the dynamics of the continuous time quantum walk on a $d$-dimensional lattice, with periodic boundary conditions, as an appropriate limit of the dynamics of the discrete time quantum walk on the same lattice. This extends the main result of arXiv:quant-ph/0606050 which proved this limit for the infinite line. By highlighting the main features of the limiting procedure, I then extend it to general graphs. For a given discrete time quantum walk on a general graph, I single out the type of continuous dynamics (Hamiltonians) that can be obtained as a limit of the discrete time dynamics.
We consider the problem of searching a general $d$-dimensional lattice of $N$ vertices for a single marked item using a continuous-time quantum walk. We demand locality, but allow the walk to vary periodically on a small scale. By constructing lattice Hamiltonians exhibiting Dirac points in their dispersion relations and exploiting the linear behaviour near a Dirac point, we develop algorithms that solve the problem in a time of $O(\sqrt N)$ for $d>2$ and $O(\sqrt N \log N)$ in $d=2$. In particular, we show that such algorithms exist even for hypercubic lattices in any dimension. Unlike previo…
Chaotic walking of cold atoms in a tilted optical lattice, created by two counter propagating running waves with an additional external field, is demonstrated theoretically and numerically in the semiclassical and Hamiltonian approximations. The effect consists in random-like changing the direction of atomic motion in a rigid lattice under the influence of a constant force due to a specific behavior of the atomic dipole-moment component that changes abruptly in a random-like manner while atoms cross standing-wave nodes. Chaotic walking generates a fractal-like scattering of atoms that manifest…
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.
In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the coherent dynamics depends on the initial states and coin parameters. For infinite size of lattice, we derive an explicit expression for the return probability, which shows scaling behavior $P(0,t)\sim t^{-1}$ and does not depends on the initial states of the walk. In the long-time limit, the probability distribution shows various patterns, depending on the initial states, coin parameters and the lattice size. The average mixing time $M_ε$ closes to the limiting probability in linear $N$ (size of t…
From the unitary operator used for implementing two-state discrete-time quantum walk on one-, two- and three- dimensional lattice we obtain a two-component Dirac-like Hamiltonian. In particular, using different pairs of Pauli basis as position translation states we obtain three different form of Hamiltonians for evolution on one-dimensional lattice. We extend this to two- and three-dimensional lattices using different Pauli basis states as position translation states for each dimension and show that the external coin operation, which is necessary for one-dimensional walk is not a necessary req…
A return probability of random walks is one of the interesting subjects. As it is well known, the return probability strongly depends on the structure of the space where the random waker moves. On the other hand, the return probability of quantum walks, which are quantum models corresponding to random walks, has also been investigated to some extend lately. In this paper, we present a limit of the return probability for a discrete-time 3-state quantum walk on a hexagonal lattice.
We study the effect of inter-component interactions on the dynamical properties of quantum walkers. We consider the simplest situation of two indistinguishable non-interacting walkers on a tilted optical lattice interacting with a walker from a different component. The mediated effect of the third particle is then analyzed in the backdrop of various controlling parameters. The interaction-induced two-particle correlations are shown to be non-trivially affected by the particle statistics, choice of initial states, and tilting configurations of the lattice. Our analysis thus offers an overall pi…
Numerical methods for the 1-D Dirac equation based on operator splitting and on the quantum lattice Boltzmann (QLB) schemes are reviewed. It is shown that these discretizations fall within the class of quantum walks, i.e. discrete maps for complex fields, whose continuum limit delivers Dirac-like relativistic quantum wave equations. The correspondence between the quantum walk dynamics and these numerical schemes is given explicitly, allowing a connection between quantum computations, numerical analysis and lattice Boltzmann methods. The QLB method is then extended to the Dirac equation in curv…
We present a new scheme for a discrete-time quantum walk on two- and three-dimensional lattices using a two-state particle. We use different Pauli basis as translational eigestates for different axis and show that the coin operation, which is necessary for one-dimensional walk is not a necessary requirement for two- and three- dimensional walk but can serve as an additional resource. Using this scheme, the probability distribution from Grover walk using four-state particle and other equivalent schemes on a square lattice using coin operation is reproduced. We also present the Hamiltonian form …
This paper presents the minimum supports of states for stationary measures of the Grover walk on the d-dimensional lattice by solving the corresponding eigenvalue problem. The numbers of the minimum supports for moving and flip-flop shifts are 2^d (d ge 1) and 4 (d ge 2), respectively.
Rules for quantizing the walker+coin parts of a classical random walk are provided by treating them as interacting quantum systems. A quantum optical random walk (QORW), is introduced by means of a new rule that treats quantum or classical noise affecting the coin's state, as sources of quantization. The long term asymptotic statistics of QORW walker's position that shows enhanced diffusion rates as compared to classical case, is exactly solved. A quantum optical cavity implementation of the walk provides the framework for quantum simulation of its asymptotic statistics. The simulation utilize…
Quantum random walk finds application in efficient quantum algorithms as well as in quantum network theory. Here we study the mixing time of a discrete quantum walk over a square lattice in presence percolation and decoherence. We consider bit-flip and phase damping noise, and evaluate the instantaneous mixing time for both the cases. Using numerical analysis we show that in case of phase damping noise probability distribution of walker's position is sufficiently close to the uniform distribution after infinite time. However, during the action of bit-flip noise, even after infinite time the to…
A proposal for the implementation of quantum walks using cold atom technology is presented. It consists of one atom trapped in time varying optical superlattices. The required elements are presented in detail including the preparation procedure, the manipulation required for the quantum walk evolution and the final measurement. These procedures can be, in principle, implemented with present technology.
We study how a single lattice defect in a discrete time quantum walk affects the return probability of a quantum particle. This defect at the starting position is modeled by a quantum coin that is distinct from the others over the lattice. This coin has a dependence on $ω$ which quantifies the intensity of the localization. For some sorts of lattice defects, we show how the localization can have a dependence just on $ω$, and also, the polar $α$ and azimuth $β$ angles of the initial qubit by numerical calculations. We propose a lattice defect whose localization has additional dependence on $β+ω…
Quantum walks have been very successful in the development of search algorithms in quantum information, in particular in the development of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in two-dimensional lattices has proved difficult, requiring additional degrees of freedom. Here, we demonstrate that continuous-time quantum walk search is possible in two-dimensions by changing the search topology to a graphene lattice, utilising the Dirac point in the energy spectrum. This is made possible by making a change to standard methods of marking a …
We present a thorough classification of the isotropic quantum walks on lattices of dimension $d=1,2,3$ for cell dimension $s=2$. For $d=3$ there exist two isotropic walks, namely the Weyl quantum walks presented in Ref. [G. M. D'Ariano and P. Perinotti, Phys. Rev. A 90, 062106 (2014)], resulting in the derivation of the Weyl equation from informational principles. The present analysis, via a crucial use of isotropy, is significantly shorter and avoids a superfluous technical assumption, making the result completely general.
A quantum walk whose continuous limit coincides with Dirac equation is usually called a Dirac Quantum Walk (DQW). A new systematic method to build DQWs coupled to electromagnetic (EM) fields is introduced and put to test on several examples of increasing difficulty. It is first used to derive the EM coupling of a well-known $3D$ walk on the cubic lattice. Recently introduced DQWs on the triangular and honeycomb lattice are then re-derived, showing for the first time that these are the only DQWs that can be defined with spinors living on the vertices of these lattices. As a third example of the…
We address memory effects and diffusive properties of a continuous-time quantum walk on a one-dimensional percolation lattice affected by spatially correlated random telegraph noise. In particular, by introducing spatially correlated time-dependent fluctuations in nearest-neighbor hopping amplitudes, we describe random domains characterized by global noise. The resulting open dynamics of the walker is then unraveled by an ensemble average over all the noise realizations. Our results show that time-dependent noise assisted by spatial correlations leads to strong memory effects in the walker dyn…
We discuss how the coined quantum walk on the line or on the circle can be implemented using optical waves. We propose several optical cavity configurations for these implementations.
The classical walking behaviors of a single atom in an amplitude-modulated standing wave lattice beyond the internal dynamics are investigated. Based on a simple effective model, we identify a diversity of dynamic regimes of atomic motion by periodically adjusting the lattice depth. Harmonic oscillation or pendulum rotation with classical step-jumping, random scattering walking, chaotic transportation, quasi-periodic trapped motion and roughly ballistic free flying are found in this simple model within different parametric regions by approximate analyses. Our study demonstrates a complex motio…
We propose an optical cavity implementation of the two-dimensional coined quantum walk on the line. The implementation makes use of only classical resources, and is tunable in the sense that a large number of different unitary transformations can be implemented by tuning some parameters of the device.
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 walks are more than tools for building quantum algorithms. They have been used effectively to model and simulate quantum dynamics in many complex physical processes. Particularly, a variant of discrete-time quantum walk known as split-step quantum walk is closely related to Dirac cellular automata and topological insulators whose realizations rely on position-dependent control of evolution operators. Owing to the ease of manipulating multiple degrees of freedom of photons, we provide an optical setup of split-step operators which in combination with position-dependent coin (PDC) operat…
The properties of the coinless quantum walk model have not been as thoroughly analyzed as those of the coined model. Both evolve in discrete time steps but the former uses a smaller Hilbert space, which is spanned merely by the site basis. Besides, the evolution operator can be obtained using a process of lattice tessellation, which is very appealing. The moments of the probability distribution play an important role in the context of quantum walks. The ballistic behavior of the mean square displacement indicates that quantum-walk-based algorithms are faster than random-walk-based ones. In thi…
In this paper, we consider discrete-time quantum walks with moving shift (MS) and flip-flop shift (FF) on two-dimensional lattice $\mathbb{Z}^2$ and torus $π_N^2=(\mathbb{Z}/N)^2$. Weak limit theorems for the Grover walks on $\mathbb{Z}^2$ with MS and FF were given by Watabe et al. and Higuchi et al., respectively. The existence of localization of the Grover walks on $\mathbb{Z}^2$ with MS and FF was shown by Inui et al. and Higuchi et al., respectively. Non-existence of localization of the Fourier walk with MS on $\mathbb{Z}^2$ was proved by Komatsu and Tate. Here our simple argument gave non…
We propose a novel implementation of discrete time quantum walks for a neutral atom in an array of optical microtraps or an optical lattice. We analyze a one-dimensional walk in position space, with the coin, the additional qubit degree of freedom that controls the displacement of the quantum walker, implemented as a spatially delocalized qubit, i.e., the coin is also encoded in position space. We analyze the dependence of the quantum walk on temperature and experimental imperfections as shaking in the trap positions. Finally, combining a spatially delocalized qubit and a hyperfine qubit, we a…
We simulate dynamics of many-particle systems of bosons and fermions using discrete time quantum walks on lattices. We present a computational proof of a behavior of the simulated systems similar to the one observed in Hamiltonian dynamics during quantum thermalization. We record the time evolution of the entropy and the temperature of a specific particle configuration during the entire dynamics and observe how they relax to a state we call quantum walks thermal state. This observation is made on two types of lattices while simulating different numbers of particles walking on two grid graphs w…
We address the dynamics of continuous-time quantum walks on one-dimensional disordered lattices inducing dynamical noise in the system. Noise is described as time-dependent fluctuations of the tunneling amplitudes between adjacent sites, and attention is focused on non-Gaussian telegraph noise, going beyond the usual assumption of fast Gaussian noise. We observe the emergence of two different dynamical behaviors for the walker, corresponding to two opposite noise regimes: slow noise (i.e. strong coupling with the environment) confines the walker into few lattice nodes, while fast noise (weak c…
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…
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 …
This paper is concerned with the continuous-time quantum walk on Z, Z^d, and infinite homogeneous trees. By using the generating function method, we compute the limit of the average probability distribution for the general isotropic walk on Z, and for nearest-neighbor walks on Z^d and infinite homogeneous trees. In addition, we compute the asymptotic approximation for the probability of the return to zero at time t in all these cases.
Quantum Random Walks (QRW) were first defined as one-particle sectors of Quantum Lattice Gas Automata (QLGA). Recently, they have been generalized to include history dependence, either on previous coin (internal, i.e., spin or velocity) states or on previous position states. These models have the goal of studying the transition to classicality, or more generally, changes in the performance of quantum walks in algorithmic applications. We show that several history dependent QRW can be identified as one-particle sectors of QLGA. This provides a unifying conceptual framework for these models in w…
Dynamical properties of two bosonic quantum walkers in a one-dimensional lattice are studied theoretically. Depending on the initial state, interactions, lattice tilting, and lattice disorder, whole plethora of different behaviors are observed. Particularly, it is shown that two bosons system manifests the many-body localization like behavior in the presence of a quenched disorder. The whole analysis is based on a specific decomposition of the temporal density profile into different contributions from singly and doubly occupied sites. In this way, the role of interactions is extracted. Since t…
We propose a twisted Szegedy walk for estimating the limit behavior of a discrete-time quantum walk on a crystal lattice, an infinite abelian covering graph, whose notion was introduced by [14]. First, we show that the spectrum of the twisted Szegedy walk on the quotient graph can be expressed by mapping the spectrum of a twisted random walk onto the unit circle. Secondly, we show that the spatial Fourier transform of the twisted Szegedy walk on a finite graph with appropriate parameters becomes the Grover walk on its infinite abelian covering graph. Finally, as an application, we show that if…
We investigate continuous-time quantum walks of two indistinguishable particles [bosons, fermions or hard-core bosons (HCBs)] in one-dimensional lattices with nearest-neighbor interactions. The results for two HCBs are well consistent with the recent experimental observation of two-magnon dynamics [Nature 502, 76 (2013)]. The two interacting particles can undergo independent- and/or co-walking depending on both quantum statistics and interaction strength. Two strongly interacting particles may form a bound state and then co-walk like a single composite particle with statistics-dependent walk s…
