
Discrete Quantum Walks on Graphs and Digraphs
Cambridge University Press
Published on 12. January 2023
Book
Paperback/Softback
300 pages
978-1-009-26168-5 (ISBN)
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.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Product notice
Paperback (trade)
Illustrations
Worked examples or Exercises
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 8 mm
Weight
231 gr
ISBN-13
978-1-009-26168-5 (9781009261685)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Chris Godsil | Hanmeng Zhan
Discrete Quantum Walks on Graphs and Digraphs
E-Book
01/2023
Cambridge University Press
€119.99
Available for download
Persons
Chris Godsil is Distinguished Professor Emeritus at the University of Waterloo. He has written three books: Algebraic Combinatorics (1993), Algebraic Graph Theory (2004, co-authored with Gordon Royle) and The Erdos-Ko-Rado Theorem: Algebraic Approaches (2015, co-authored with Karen Meagher).
Author
University of Waterloo, Ontario
Simon Fraser University, British Columbia
Content
Preface; 1. Grover search; 2. Two reflections; 3. Applications; 4. Averaging: 5. Covers and embeddings; 6. Vertex-face walks; 7. Shunts; 8. 1-Dimensional walks; References; Glossary; Index.