Coined discrete-time quantum walks are studied using simple deterministic dynamical systems as coins whose classical limit can range from being integrable to chaotic. It is shown that a Loschmidt echo-like fidelity plays a central role, and when the coin is chaotic this is approximately the characteristic function of a classical random walker. Thus the classical binomial distribution arises as a limit of the quantum walk and the walker exhibits diffusive growth before eventually becoming ballistic. The coin-walker entanglement growth is shown to be logarithmic in time as in the case of many-body localization and coupled kicked rotors, and saturates to a value that depends on the relative coin and walker space dimensions. In a coin-dominated scenario, the chaos can thermalize the quantum walk to typical random states such that the entanglement saturates at the Haar averaged Page value, unlike in a walker-dominated case when atypical states seem to be produced.
Coined discrete-time quantum walks are studied using simple deterministic dynamical systems as coins whose classical limit can range from being integrable to chaotic. It is shown that a Loschmidt echo-like fidelity plays a central role, and when the coin is chaotic this is approximately the characteristic function of a classical random walker. Thus the classical binomial distribution arises as a limit of the quantum walk and the walker exhibits diffusive growth before eventually becoming ballistic. The coin-walker entanglement growth is shown to be logarithmic in time as in the case of many-body localization and coupled kicked rotors, and saturates to a value that depends on the relative coin and walker space dimensions. In a coin-dominated scenario, the chaos can thermalize the quantum walk to typical random states such that the entanglement saturates at the Haar averaged Page value, unlike in a walker-dominated case when atypical states seem to be produced.
We use simple deterministic dynamical systems as coins in studying quantum walks. These dynamical systems can be chosen to display, in the classical limit, a range of behaviors from the integrable to chaotic, or deterministically random. As an example of an integrable coin we study the Fourier walk that generalizes the Hadamard walk and show that the walker slows down with coin dimensionality, which controls the effective Planck constant. Introducing multi-Harper maps as deterministic models of random walks we study the effect of coin chaos on the quantum walk. We also demonstrate that breaking time-reversal symmetry in the coin dynamics effectively slows down the walk.
Abstract. The coin-position entanglement generated by the evolution operator of a discrete–time quantum walk is quantified, using the von Neumann entropy of the reduced density operator (entropy of entanglement). In the case of a single walker, the entropy of entanglement converges, in the long time limit, to a well defined value which depends on the initial state. Exact expressions are obtained for local and non-local initial conditions. We also discuss the asymptotic bi-partite entanglement generated by non-separable coin operations for two coherent quantum walkers. In this case, the entropy of entanglement is observed to increase logarithmically with time. 1.
We explore a discrete-time, coined quantum walk on a quantum network where the coherent superposition of walker moves originates from the unitary interaction of the walker coin with the qubit degrees of freedom in the quantum network. The walk dynamics leads to a growth of entanglement between the walker and the network on one hand and, on the other, between the network qubits among themselves. The initial entanglement among the network qubits plays a crucial role in determining the asymptotic values of these entanglement measures and the quantum walk statistics. Specifically, the entanglement entropy of the walker-network state and the negativity of the quantum network-qubit state saturate to values increasing with the initial network entanglement. The asymptotic time-averaged walker-position probability distribution shows increasing localization around the initial walker position with higher initial network entanglement. A potential application of these results as a characterization tool for quantum network properties is suggested.
It is believed that in the long time limit, the limiting behavior of the discrete-time quantum random walk will cross from quantum to classical if we take into account of the decoherence. The computer simulation has already shown that for the discrete-time one-dimensional Hadamard quantum random walk with coin decoherence such that the measurement operators on the coin space are defined by A0 = Ic √1 − p, A1 = |R > < R| √p and A2 = |L > < L > < L| √p is diffusive when 0 < p ≤ 1 and it is ballistic when P = 0. In this thesis, we are going to let p to be dynamical depending on the step t, that is, we consider p = 1/tß, ß ≥ 0 and we found that it has sub-ballistic behavior for 0 < ß < 1. Furthermore, we study not only the coin decoherence, but the total decoherence, that means the measurement operators apply on the Hilbert space H = Hp ⊗ Hc instead of the coin space only. We find that the results are both sub-ballistic for the coin and total decoherence when 0 < ß < 1. Moreover, according to the model given in [T. A. Brun, H. A. Carteret, and A. Ambainis, Phys. Rev. A 67, 032304 (2003)], we know that if the walker has chance to hop to the second nearest neighbor lattice in one step, the long-time behavior is also sub-ballistic and it is similar to that the walker can hop to the third nearest neighbor lattice in one step. By the way, we also find that if we combine the classical part of the model given in [Jing Zhao and Peiqing Tong. One-dimensional quantum walks subject to next nearest neighbor hopping decoherence, Nanjing Normal University, preprint (2014)] with different step length, then this decoherence will also cross from quantum to classical. Finally, we define the quantum γ-stable walk and obtain the quantum γ-stable law with decoherence. By this decoherence, we can see that the limiting behavior of the quantum stable walk will also cross from quantum to classical and we shows that it spreads out faster than the classical stable walk.
Out-of-time-ordered correlators (OTOCs) have recently attracted significant attention, finding applications in disparate areas, from the physics of many-body systems to quantum black holes, with an exponential growth of the OTOCs indicating quantum chaos. Here we consider OTOCs in the context of coined discrete quantum walks, a well-studied model of quantization of classical random walks with applications to quantum algorithms. Three separate cases of operators, variously localized in the coin and walker spaces, are discussed in this context and it is found that the approximated behavior of the OTOC is well described by simple algebraic functions in all three cases with different timescales of growth. The quadratic increase of OTOCs signals the absence of quantum chaos in these simplest forms of quantum walks.
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., nonrandom) case, we allow any unitary operator which commutes with translations and couples only sites at a finite distance from each other. For example, a single step of the walk could be composed of any finite succession of different shift and coin operations in the usual sense, with any lattice dimension and coin dimension. We find ballistic scaling and establish a direct method for computing the asymptotic distribution of position divided by time, namely as the distribution of the discrete time analog of the group velocity. In the random case, we let a Markov chain (control process) pick in each step one of finitely many unitary walks, in the sense described above. In ballistic order, we find a nonrandom drift which depends only on the mean of the control process and not on the initial state. In diffusive scaling, the limiting distribution is asymptotically Gaussian, with a covariance matrix (diffusion matrix) depending on momentum. The diffusion matrix depends not only on the mean but also on the transition rates of the control process. In the nonrandom limit, i.e., when the coins chosen are all very close or the transition rates of the control process are small, leading to long intervals of ballistic evolution, the diffusion matrix diverges. Our method is based on spatial Fourier transforms, and the first and second order perturbation theory of the eigenvalue 1 of the transition operator for each value of the momentum.