We study a natural construction of a general class of inhomogeneous quantum walks (namely, walks whose transition probabilities depend on position). Within the class we analyze walks that are periodic in position and show that, depending on the period, such walks can be bounded or unbounded in time; in the latter case we analyze the asymptotic speed. We compare the construction to others in the existing literature. As an example we give a quantum version of a nonirreducible classical walk: the P\'olya Urn.
We study a natural construction of a general class of inhomogeneous quantum walks (namely, walks whose transition probabilities depend on position). Within the class we analyze walks that are periodic in position and show that, depending on the period, such walks can be bounded or unbounded in time; in the latter case we analyze the asymptotic speed. We compare the construction to others in the existing literature. As an example we give a quantum version of a nonirreducible classical walk: the P'olya Urn.
We examined three different types of one-dimensional quantum walks, all exhibit some degree of inhomogeneity. The first is inhomogeneous only insofar as the coin operator differs at even and odd positions along the line. The second has a coin operator that is inhomogeneous and oscillatory in time. The third has a coin operator that is inhomogeneous and oscillatory in space, differing at every position along the line. Much progress is made towards attaining asymptotics for the first walk, although our analytical solution does not yet agree with the numerics. An asymptotic approach is attempted for the second walk, although it seems that this approach may not be well- suited to the walk. The third walk, it seems, requires more machinery, although progress is made using symmetry and a pentadiagonal transition operator is obtained. This general pentadiagonal operator gives hope for much progress in the near future.
We define and analyze quantum computational variants of \nrandom walks on one-dimensional lattices. In particular, we analyze a quantum analog of the symmetric random \nwalk, which we call the Hadamard walk. Several striking \ndifferences between the quantum and classical cases are ob- served. For example, when unrestricted in either direction, \nthe Hadamard walk has position that is nearly uniformly \ndistributed in the range [-t/√2, t/√2] after t steps, which \nis in sharp contrast to the classical random walk, which has \ndistance O(√t) from the origin with high probability. With \nan absorbing boundary immediately to the left of the starting position, the probability that the walk exits to the left is 2/π, and with an additional absorbing boundary at location n, the probability that the walk exits to the left actually increases, approaching 1/√2 in the limit. In the classical case both values are 1.
We present an alternative definition of discrete-time coined quantum walks convenient for capturing a rather broad spectrum of a walker's behavior on arbitrary graphs. It includes and covers both the geometry of possible walker's positions with interconnecting links and the prescribed rule in which directions the walker will move at each vertex. While the former allows for the analysis of inhomogeneous quantum walks on graphs with vertices of varying degree, the latter offers us to choose, investigate, and compare quantum walks with different shift operators. The synthesis of both key ingredients constitutes a well-suited playground for analyzing percolated quantum walks on a quite general class of graphs. Analytical treatment of the asymptotic behavior of percolated quantum walks is presented and worked out in details for the Grover walk on graphs with maximal degree 3. We find that for these walks with cyclic shift operators, the existence of an edge-3 coloring of the graph allows for nonstationary asymptotic behavior of the walk. For different shift operators, the general structure of localized attractors is investigated, which determines the overall efficiency of a source-to-sink quantum transport across a dynamically changing medium. As a simple nontrivial example of the theory, we treat a single-excitation transport on a percolated cube.
The discrete-time quantum walk (QW) is a quantum version of the random walk (RW) and has been widely investigated for the last two decades. Some remarkable properties of QW are well known. For example, QW has a ballistic spreading, i.e., QW is quadratically faster than RW. For some cases, localization occurs: a walker stays at the starting position forever. In this paper, we consider stationary measures of two-state QWs on the line. It was shown that for any space-homogeneous model, the uniform measure becomes the stationary measure. However, the corresponding result for space-inhomogeneous model is not known. Here, we present a class of space-inhomogeneous QWs on the line and cycles in which the uniform measure is stationary. Furthermore, we briefly discuss a difference between QWs and RWs.
In this thesis we study the propagation behavior of quantum particles which perform discrete-time quantum walks on spatial lattices.By definition, quantum walks are discrete-time evolutions such that a single time step couples only neighboring lattice sites.Additionally, we assume in this thesis that the dynamical law commutes with all translations of the spatial lattice, that is we consider translationally invariant quantum walks.The results presented in the following are separated into two parts: The first part is devoted to the study of single-particle quantum walks, and in the second part we investigate quantum walks of several particles.Single-particle quantum walks: Our aim is to study the asymptotic behavior of particles undergoing general translationally invariant quantum walks.Employing perturbation theory, we establish a direct method for computing the asymptotic distribution of the particle's position rescaled by an appropriate time-dependent factor.If the time evolution is implemented by a unitary operator commuting with all lattice translations and with empty pure point spectrum, we find linear scaling of the asymptotic position distribution.In this case, the asymptotic distribution of position divided by time is determined by the analog of the group velocity.If, on the other hand, the quantum walk is subject to decoherence, we expect that it behaves like a classical random walk.We provide explicit criteria under which this intuitive statement is true, that is, the asymptotic scaling of the particle's position distribution is that of a diffusion process.We find that the asymptotic distribution of position divided by the square root of time is a mixture of Gaussians in this case.However, we also provide examples of decoherent quantum walks which violate these criteria, and exhibit linear scaling of the asymptotic position distribution. Many-particle quantum walks:We investigate unitary quantum walks of two particles with collisional interactions.That is, the particles perform independent single-particle quantum walks if they are at distinct lattice sites, and an interaction takes place if both particles occupy the same lattice site.We prove that such quantum walks generically exhibit a molecular binding effect between the particles.More precisely, for a measurement of the particles' positions we have a bound on the probability to obtain a certain result which decays exponentially with the particles' distance.As a preparatory step for this analysis, we consider single-particle quantum walks with point defects, and provide a method to compute their eigenvalues in the spectral gap of the quantum walk without defect.We further generalize our model to arbitrary numbers of particles and study the behavior of local excitations in many-particle quantum walks.