Format:
1 Online-Ressource (xii, 136 Seiten)
ISBN:
9781009261692
Series Statement:
London Mathematical Society lecture note series
Content:
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
Note:
Title from publisher's bibliographic system (viewed on 10 Jan 2023)
,
Grover Search -- Two Reflections -- Applications -- Averaging -- Covers and Embeddings -- Vertex-Face Walks -- Shunts -- 1-Dimensional Walks
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 978-1-00-926168-5
Language:
English
Subjects:
Mathematics
DOI:
10.1017/9781009261692
URL:
Volltext
(URL des Erstveröffentlichers)
Author information:
Godsil, Chris 1949-
