Limit Theorems for the Discrete-Time Quantum Walk on a Graph with Joined Half Lines

Abstract

We consider a discrete-time quantum walk Wt,κ at time t on a graph with joined half lines Jκ, which is composed of κ half lines with the same origin. Our analysis is based on a reduction of the walk on a half line. The idea plays an important role to analyze the walks on some class of graphs with symmetric initial states. In this paper, we introduce a quantum walk with an enlarged basis and show that Wt,κ can be reduced to the walk on a half line even if the initial state is asymmetric. For Wt,κ, we obtain two types of limit theorems. The first one is an asymptotic behavior of Wt,κ which corresponds to localization. For some conditions, we find that the asymptotic behavior oscillates. The second one is the weak convergence theorem for Wt,κ. On each half line, Wt,κ converges to a density function like the case of the one-dimensional lattice with a scaling order of t. The results contain the cases of quantum walks starting from the general initial state on a half line with the general coin and homogeneous trees with the Grover coin.

Limit measures of inhomogeneous discrete-time quantum walks in one dimension

“…The QW with one defect also belongs to M K as in the case of typical homogeneous QWs [24,25,26,27,28,29,32,33].…”

Return Probability of the Fibonacci Quantum Walk

“…Limit theorems for quantum walks has been well studied by many authors [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19], for example. Related to quantum physics localization of the quantum has been investigated [20][21][22][23], for example.…”

Topological phases and delocalization of quantum walks in random environments

“…The sign of the reflecting coin operator determines the presence or absence of edge states. 26,27 In case of the Hadamard walks (θ = π/4), the edge states appear if C − R is introduced at the boundary.…”