- Additional Authors
- Zhan, Hanmeng.
- Description
- 1 online resource (pages cm)
- Summary
- "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"--
- Series Statement
- London Mathematical Society lecture note series
- Uniform Title
- Discrete quantum walks on graphs and digraphs (Online)
- Alternative Title
- Discrete quantum walks on graphs and digraphs (Online)
- Subject
- Bibliography (note)
- Includes bibliographical references and index.
- Access (note)
- Access restricted to authorized users.
- Contents
- Grover Search -- Two Reflections -- Applications -- Averaging -- Covers and Embeddings -- Vertex-Face Walks -- Shunts -- 1-Dimensional Walks.
- LCCN
- 2022033127
- OCLC
- ssj0002761364
- Author
Godsil, C. D. (Christopher David), 1949-
- Title
Discrete quantum walks on graphs and digraphs [electronic resource] / Chris Godsil, Harmony Zhan.
- Imprint
Cambridge ; New York, NY : Cambridge University Press, 2023.
- Series
London Mathematical Society lecture note series
- Bibliography
Includes bibliographical references and index.
- Access
Access restricted to authorized users.
- Connect to:
- Added Author
Zhan, Hanmeng.