Quantum Walks and Search Algorithms

The revised edition of this book offers an extended overview of quantum walks and explains their role in building quantum algorithms, in particular search algorithms.Updated throughout, the book focuses on core topics including Grovers algorithm and the most important quantum walk models, such as the coined, continuous-time, and Szedgedys quantum walk models. There is a new chapter describing the staggered quantum walk model. The chapter on spatial search algorithms has been rewritten to offer a more comprehensive approach and a new chapter describing the element distinctness algorithm has been added. There is a new appendix on graph theory highlighting the importance of graph theory to quantum walks.As before, the reader will benefit from the pedagogical elements of the book, which include exercises and references to deepen the readers understanding, and guidelines for the use of computer programs to simulate the evolution of quantum walks.Review of the first edition:?The book is nicely written, the concepts are introduced naturally, and many meaningful connections between them are highlighted. The author proposes a series of exercises that help the reader get some working experience with the presented concepts, facilitating a better understanding. Each chapter ends with a discussion of further references, pointing the reader to major results on the topics presented in the respective chapter.? - Florin Manea, zbMATH.