A note on the discrete-time evolutions of quantum walk on a graph
classification
🧮 math-ph
math.MPquant-ph
keywords
walkevolutionmatrixquantumdiscrete-timegraphcertaincharacteristic
read the original abstract
For a quantum walk on a graph, there exist many kinds of operators for the discrete-time evolution. We give a general relation between the characteristic polynomial of the evolution matrix of a quantum walk on edges and that of a kind of transition matrix of a classical random walk on vertices. Furthermore we determine the structure of the positive support of the cube of some evolution matrix, which is said to be useful for isospectral problem in graphs, under a certain condition.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.