Discrete Quantum Walks on Graphs and Digraphs

Discrete Quantum Walks on Graphs and Digraphs by Chris Godsil


ISBN
9781009261685
Published
Binding
Paperback
Pages
300
Dimensions
152 x 230 x 9mm

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.
137.99


This product is unable to be ordered online. Please check in-store availability.
Enter your Postcode or Suburb to view availability and delivery times.

You might also like


RRP refers to the Recommended Retail Price as set out by the original publisher at time of release.
The RRP set by overseas publishers may vary to those set by local publishers due to exchange rates and shipping costs.
Due to our competitive pricing, we may have not sold all products at their original RRP.