Discrete quantum walks on graphs and digraphs / C. Godsil, H. Zhan.

"Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so t...

Full description

Bibliographic Details

Online Access:	Full Text (via Cambridge)
Main Authors:	Godsil, C. D. (Christopher David), 1949- (Author), Zhan, Hanmeng (Author)
Format:	Electronic eBook
Language:	English
Published:	Cambridge, United Kingdom ; New York, NY : Cambridge University Press, 2023.
Series:	London Mathematical Society lecture note series.
Subjects:	Graph theory. Matrices. Algorithms. Quantum computing. Discrete mathematics.