Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Discrete Quantum Walks on Graphs and Digraphs

Discrete Quantum Walks on Graphs and Digraphs

Godsil, Chris
Zhan, Hanmeng

Paperback

Series: London Mathematical Society Lecture Note

General Mathematics

ISBN10: 1009261681
ISBN13: 9781009261685
Publisher: Cambridge University Press
Published: Jan 12 2023
Pages: 300
Weight: 0.50
Height: 0.39 Width: 5.59 Depth: 8.66
Language: English
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.

Also in

General Mathematics

View All