The Grover walk, which is related to Grover's search algorithm on a quantum computer, is one of the typical discrete time quantum walks. However, a localization of the two-dimensional Grover walk starting from a fixed point is strikingly different from other types of quantum walks. The present paper explains the reason why the walker who moves according to the degree-four Grover operator can remain at the starting point with a high probability. It is shown that the key factor for the localization is due to the degeneration of eigenvalues of the time evolution operator. In fact, the global time evolution of the quantum walk on a large lattice is mainly determined by the degree of degeneration. The dependence of the localization on the initial state is also considered by calculating the wave function analytically.
The Grover walk, which is related to Grover's search algorithm on a quantum computer, is one of the typical discrete time quantum walks. However, a localization of the two-dimensional Grover walk starting from a fixed point is strikingly different from other types of quantum walks. The present paper explains the reason why the walker who moves according to the degree-four Grover operator can remain at the starting point with a high probability. It is shown that the key factor for the localization is due to the degeneration of eigenvalues of the time evolution operator. In fact, the global time evolution of the quantum walk on a large lattice is mainly determined by the degree of degeneration. The dependence of the localization on the initial state is also considered by calculating the wave function analytically.
Abstract Localization phenomena of quantum walks makes the propagation dynamics of a walker strikingly different from that corresponding to classical random walks. In this paper, we study the localization phenomena of four-state discrete-time quantum walks on two-dimensional lattices with coin operators as one-parameter orthogonal matrices that are also permutative, a combinatorial structure of the Grover matrix. We show that the proposed walks localize at its initial position for canonical initial coin states when the coin belongs to classes which contain the Grover matrix that we consider in this paper, however, the localization phenomena depends on the coin parameter when the class of parametric coins does not contain the Grover matrix.
We study the dynamical localization of discrete time evolution of topological split-step quantum random walk (QRW) on a single-site defect starting from a uniform distribution. Using analytical and numerical calculations, we determine the high localization probability regions in the parameter space of the quantum walker. These regions contain two or more pairs of trapped states, forming near a lattice defect. By investigating the spectral properties of the discrete-time evolution operators, we show that these trapped states have large overlap with the initial uniformly distributed state, thus offering a simple interpretation of the localization effect. As this localization scheme could be interpreted as a variation of spatial quantum search algorithm, we compare the localization probability and time with other types of two-dimensional quantum walks that do not have topological phases and realize localization time scaling similar to Grover's algorithm. Finally we show that mechanism of localization we identified is robust against the influence of disorder.
We systematically study the localization effect in discrete-time quantum walks on a honeycomb network and establish the mathematical framework. We focus on the Grover walk first and rigorously derive the limit form of the walker's state, showing it has a certain probability to be localized at the starting position. The relationship between localization and the initial coin state is concisely represented by a linear map. We also define and calculate the average probability of localization by generating random initial states. Further, coin operators varying with positions are considered and the sufficient condition for localization is discussed. We also similarly analyze another four-state Grover walk. Theoretical predictions are all in accord with numerical simulation results. Finally, our results are compared with previous works to demonstrate the unusual trapping effect of quantum walks on a honeycomb network, as well as the advantages of our method.
The field of quantum computation and quantum simulation has been recently driven to a new rising edge by the experimental realization of quantum walks in various setups, highlighting that different physical systems can be adapted for the implementation of these models. In particular, optical systems have shown their full potential, allowing the experimental demonstration of two-dimensional quantum walks for the first time [1, 2], even if several further progresses will sur ely be obtained also in the other physical scenarios that have been already exploited for the one-dimensional case [3, 4]. From the theoretical point of view, the interest in twodimensional quantum walks has been boosted by the fact that, differently from the one-dimensional version, highe rdimensional schemes (i.e., walkers moving on structures with dimension larger than one) can be exploited for the efficient implementation of quantum search algorithms [5]. In particular, the Grover walk has been intensively studied due to its localization feature [6]. It has been proved that the non localized case of the Grover walk can be simulated by a walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions i n which the walker can move [7]. In the quest for more feasible quantum walk models, an important step forward is presented in this paper: a strong localization-like effect can be indeed obtained in the modified version of the alternate quantum walk presented here, reducing the gap with the standard two-dimensional version. This result could pave the way for adapting this scheme to the realization of quantum algorithms, providing a clear advantage in terms of experimental resources. After a short introduct ion on the quantum walk studied here, we characterize it in terms of its relevant parameters and show that a proper choice can guarantee a non-negligible probability of finding the walke r at the origin even for large times. We then hint at a qualitative relation between the ability of the system to localize and th e behavior of coherences established in the state of the parti cles performing a two-particle equivalent scheme of the walk, which in turns provides information on the way correlations are set up between them. We discuss the robustness of this model to imperfections and its possible experimental realization with the current state-of-the-art settings in linear o ptics and cold-atom devices. Let us consider a quantum system with two degrees of freedom, and thus described by a vector in the composite Hilbert space H = HW ⊗ HC . The coin space HC is a two-dimensional Hilbert space spanned by {|0i,|1i} and the walker space HW is an infinite-dimensional Hilbert space spanned by {|x,yi}, with x and y assuming all possible integer values. We take as a basis of this space H the set {|x,y,ci}, with |x,y,ci= |x,yiW ⊗ |ciC ; x and y could denote, for instance, the position of a particle ( walker) along the x and y directions, respectively, while |ciC is an internal twolevel degree of freedom. From now on, we consider|0,0iW as the initial state of our walker, and |+yiC = (|0iC+i|1iC)/ √ 2 as the coin one. The evolution of the system is given by a sequence of conditional shift, coin operations, and phase gates. The effec t of the two different conditional shift operations
We analyze the role of dimensionality in the time evolution of discrete-time quantum walks through the example of the three-state walk on a two-dimensional triangular lattice. We show that the three-state Grover walk does not lead to trapping (localization) or recurrence to the origin, in sharp contrast to the Grover walk on the two-dimensional square lattice. We determine the power-law scaling of the probability at the origin with the method of stationary phase. We prove that only a special subclass of coin operators can lead to recurrence, and there are no coins that lead to localization. The propagation for the recurrent subclass of coins is quasi-one dimensional.
We investigate a generalized Hadamard walk in two dimensions with five inner states. The particle governed by a five-state quantum walk (5QW) moves, in superposition, either leftward, rightward, upward, or downward according to the inner state. In addition to the four degrees of freedom, it is allowed to stay at the same position. We calculate rigorously the wave function of the particle starting from the origin in the plane for any initial state, and give the spatial distribution of probability of finding the particle. We also investigate the localization problem for the two-dimensional five-state quantum walk: Does the probability of finding a particle anywhere on the plane converge to zero even after infinite time steps except initial states?