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. This significantly reduces the resources necessary for its feasible experimental realization. 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. Our scheme allows us to entangle the two orthogonal directions of the walk more efficiently.

We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and Th. Busch, Phys. Rev. Lett. 106, 080502 (2011)]. For a particular initial state of the coin, this walk is able to perfectly reproduce the spatial probability distribution of the non-localized case of the Grover walk. Here, we present a more detailed proof of this equivalence. We also extend the analysis to other initial states, in order to provide a more complete picture of our walk. We show that this scheme outperforms the Grover walk in the generation of x-y spatial entanglement for any initial condition, with the maximum entanglement obtained in the case of the particular aforementioned state. Finally, the equivalence is generalized to wider classes of quantum walks and a limit theorem for the alternate walk in this context is presented.

We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the obtained results, we discuss the properties of the introduced model and the difference in comparison to the memoryless model.Comment: 6 pages, 2 figures, published versio

State Key Laboratory of N etworking and Switching T echnology, Beijing U niversity of P osts and T elecommunications, Beijing, 100876, China a) T he De Brun Centre f or Computational Algebra, School of M athematics, Statistics and Applied M athematics, N ational U niversity of Ireland, Galway b) (Received X XX XXXX; revised manuscript received X XX XXXX) Lazy quantum walks were presented by Andrew M. Childs to prove that the continuous-time quantum walk is a limit of the discrete-time quantum walk [Commun.Math.Phys.294,581-603(2010)].In this paper, we discuss properties of lazy quantum walks. Our analysis shows that lazy quantum walks have O(t n ) order of the n-th moment of the corresponding probability distribution, which is the same as that for normal quantum walks. Also, the lazy quantum walk with DFT (Discrete Fourier Transform) coin operator has a similar probability distribution concentrated interval to that of the normal Hadamard quantum walk. Most importantly, we introduce the concepts of occupancy number and occupancy rate to measure the extent to which the walk has a (relatively) high probability at every position in its range. We conclude that lazy quantum walks have a higher occupancy rate than other walks such as normal quantum walks, classical walks and lazy classical walks.

No abstract