Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links

Discrete Quantum Walks on Graphs and Digraphs

Discrete Quantum Walks on Graphs and Digraphs

Discrete Quantum Walks on Graphs and Digraphs

Authors:
Chris Godsil, University of Waterloo, Ontario
Hanmeng Zhan, Simon Fraser University, British Columbia
Published:
January 2023
Format:
Paperback
ISBN:
9781009261685

Looking for an inspection copy?

Please email academicmarketing@cambridge.edu.au to enquire about an inspection copy of this book.

AUD$105.41
exc GST
Paperback
$85.00 USD
eBook

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.

  • Relates the properties of the discrete quantum walk to the properties of the underlying graph
  • Introduces new graph theoretical problems arising from quantum walks
  • Explores the connection between graph embeddings and quantum walks

Product details

January 2023
Paperback
9781009261685
300 pages
230 × 152 × 9 mm
0.23kg
Available

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.