Quantum walks, Ihara zeta functions and cospectrality in regular graphs

In this paper we explore an interesting relationship between discrete-time quantum walks and the Ihara zeta function of a graph. The paper commences by reviewing the related literature on the discrete-time quantum walks and the Ihara zeta function. Mathematical definitions of the two concepts are then provided, followed by analyzing the relationship between them. Based on this analysis we are able to account for why the Ihara zeta function can not distinguish cospectral regular graphs. This analysis suggests a means by which to develop zeta functions that have potential in distinguishing such structures.

[1]  H. Bass.  THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE , 1992 .

[2]  Simone Severini,et al.  A Matrix Representation of Graphs and its Spectrum as a Graph Invariant , 2006, Electron. J. Comb..

[3]  Andris Ambainis,et al.  QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS , 2003, quant-ph/0403120.

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

[5]  Peter J. Cameron,et al.  Strongly regular graphs , 2003 .

[6]  Y. Ihara.  On discrete subgroups of the two by two projective linear group over p-adic fields , 1966 .

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

[8]  Norio Konno,et al.  One-dimensional discrete-time quantum walks on random environments , 2009, Quantum Inf. Process..

[9]  Julia Kempe,et al.  Quantum random walks: An introductory overview , 2003, quant-ph/0303081.

[10]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[11]  A. Terras,et al.  Zeta functions of finite graphs and coverings, III , 1996 .

[12]  R. Shankar,et al.  Principles of Quantum Mechanics , 2010 .

[13]  Geoffrey Scott,et al.  The coefficients of the Ihara zeta function , 2008 .

[14]  Dong Zhou,et al.  Two-particle quantum walks applied to the graph isomorphism problem , 2010, 1002.3003.

[15]  Robert Joynt,et al.  Physically-motivated dynamical algorithms for the graph isomorphism problem , 2005, Quantum Inf. Comput..

[16]  Simone Severini,et al.  Coined quantum walks lift the cospectrality of graphs and trees , 2005, Pattern Recognit..

[17]  T. Sunada,et al.  Zeta Functions of Finite Graphs , 2000 .

[18]  L. Beineke,et al.  Topics in algebraic graph theory , 2004 .

[19]  J. B. Wang,et al.  A classical approach to the graph isomorphism problem using quantum walks , 2007, 0705.2531.

[20]  Ki-ichiro Hashimoto,et al.  ARTIN TYPE L-FUNCTIONS AND THE DENSITY THEOREM FOR PRIME CYCLES ON FINITE GRAPHS , 1992 .

[21]  Andrew M. Childs,et al.  Universal computation by quantum walk. , 2008, Physical review letters.

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