Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix

Abstract Using the spectral distribution associated with the adjacency matrix of graphs, we introduce a new method of calculation of amplitudes of continuous-time quantum walk on some rather important graphs, such as line, cycle graph C n , complete graph K n , graph G n , finite path and some other finite and infinite graphs, where all are connected with orthogonal polynomials such as Hermite, Laguerre, Tchebichef, and other orthogonal polynomials. It is shown that using the spectral distribution, one can obtain the infinite time asymptotic behavior of amplitudes simply by using the method of stationary phase approximation (WKB approximation), where as an example, the method is applied to star, two-dimensional comb lattices, infinite Hermite and Laguerre graphs. Also by using the Gauss quadrature formula one can approximate the infinite graphs with finite ones and vice versa, in order to derive large time asymptotic behavior by WKB method. Likewise, using this method, some new graphs are introduced, where their amplitudes are proportional to the product of amplitudes of some elementary graphs, even though the graphs themselves are not the same as the Cartesian product of their elementary graphs. Finally, by calculating the mean end to end distance of some infinite graphs at large enough times, it is shown that continuous-time quantum walk at different infinite graphs belong to different universality classes which are also different from those of the corresponding classical ones.

[1]  Christino Tamon,et al.  On mixing in continuous-time quantum walks on some circulant graphs , 2003, Quantum Inf. Comput..

[2]  Andris Ambainis,et al.  One-dimensional quantum walks , 2001, STOC '01.

[3]  Alexander Russell,et al.  Quantum Walks on the Hypercube , 2002, RANDOM.

[4]  Edward Farhi,et al.  An Example of the Difference Between Quantum and Classical Random Walks , 2002, Quantum Inf. Process..

[5]  M. Ferrero,et al.  Fundamental Problems in Quantum Physics , 1995 .

[6]  T. Chihara,et al.  An Introduction to Orthogonal Polynomials , 1979 .

[7]  Julia Kempe,et al.  Discrete Quantum Walks Hit Exponentially Faster , 2005 .

[8]  John Watrous,et al.  Continuous-Time Quantum Walks on the Symmetric Group , 2003, RANDOM-APPROX.

[9]  Daniel A. Spielman,et al.  Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.

[10]  Quantum Probabilistic Approach to Spectral Analysis of Star Graphs , 2004 .

[11]  J. Shohat,et al.  The problem of moments , 1943 .

[12]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[13]  E. Farhi,et al.  Quantum computation and decision trees , 1997, quant-ph/9706062.

[14]  Norio Konno,et al.  Continuous-Time Quantum Walk on the Line , 2004 .

[15]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[16]  MONOTONE INDEPENDENCE, COMB GRAPHS AND BOSE EINSTEIN CONDENSATION , 2004 .

[17]  Andris Ambainis,et al.  Quantum random walks with decoherent coins , 2003 .

[18]  Andris Ambainis,et al.  Quantum walks on graphs , 2000, STOC '01.

[19]  QUANTUM DECOMPOSITION AND QUANTUM CENTRAL LIMIT THEOREM , 2003 .

[20]  M. Jafarizadeh,et al.  Supersymmetry and shape invariance in differential equations of mathematical physics , 1997 .

[21]  Christino Tamon,et al.  A note on graphs resistant to quantum uniform mixing , 2003 .

[22]  Christino Tamon,et al.  One-Dimensional Continuous-Time Quantum Walks , 2004, Quantum Inf. Process..

[23]  N. Bleistein,et al.  Asymptotic Expansions of Integrals , 1975 .

[24]  R. Leighton,et al.  Feynman Lectures on Physics , 1971 .

[25]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[26]  P. Zweifel.  Advanced Mathematical Methods for Scientists and Engineers , 1980 .