Discrete Quantum Walks on Graphs and Digraphs
Book information
Description
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 there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.
Similar books
Erdős – Ko – Rado Theorems : Algebraic Approaches
2016 · PDF
An introduction to the Moebius function [expository notes]
2004 · PDF
Finite Geometry [Lecture notes]
2004 · PDF
Association Schemes [Lecture notes]
2010 · PDF
Combinatorial Design Theory [expository notes]
2010 · PDF
Algebraic Graph Theory
2001 · DJVU
Algebraic Combinatorics (Chapman Hall Crc Mathematics Series)
1993 · DJVU
Algebraic Graph Theory
2001 · PDF