Discrete Quantum Walks on Graphs and Digraphs (Paperback)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	London Mathematical Society Lecture Note Series
Release date:	2023
Authors:	Chris Godsil • Hanmeng Zhan
Dimensions:	230 x 152 x 9mm (L x W x T)
Format:	Paperback - Trade
Pages:	300
ISBN-13:	978-1-00-926168-5
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Mathematical foundations > Set theory Books > Science & Mathematics > Mathematics > Algebra > General
LSN:	1-00-926168-1
Barcode:	9781009261685

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!