10% off all books and free delivery over £50
Buy from our bookstore and 25% of the cover price will be given to a school of your choice to buy more books. *15% of eBooks.

Discrete Quantum Walks on Graphs and Digraphs

View All Editions (1)

The selected edition of this book is not available to buy right now.
Add To Wishlist
Write A Review

About

Discrete Quantum Walks on Graphs and Digraphs Synopsis

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.

About This Edition

ISBN: 9781009261685
Publication date:
Author: C D Godsil, Hanmeng Zhan
Publisher: Cambridge University Press
Format: Paperback
Pagination: 300 pages
Series: London Mathematical Society Lecture Note Series
Genres: Combinatorics and graph theory
Set theory
Algebra
Algorithms and data structures

Frequently asked questions