- Offers an expanded introduction to the field of quantum walks
- Covers key topics in quantum computation including Grover’s algorithm
- Includes a new chapter on the Element Distinctness Algorithm
Buy this book
- About this book
-
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 Grover's algorithm and the most important quantum walk models, such as the coined, continuous-time, and Szedgedy's 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 reader's 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.
- About the authors
-
Dr. Renato Portugal is a full researcher at the National Laboratory of Scientific Computing (LNCC). He received the Howard E. Brandt paper award in 2017. He is member of the editorial board of the journal Natural Computing. His past positions include Visiting Professor in the Department of Applied Mathematics and the Symbolic Computation Group at the University of Waterloo, Visiting Professor in the Department of Physics at Queen’s University of Kingston, and Researcher at the Brazilian Center for Research in Physics, Brazil. He received his doctoral degree at the Brazilian Center for Research in Physics. He has published over 150 articles in Scientific Journals and refereed proceedings, with an h-index of 19, and three books. He has developed 7 software packages, including his latest: The Invar Package in 2007. He was General Chair of the Workshop-School of Quantum Information and Computation (WECIQ 2010), and Chair of the Programme Committee for the Workshop-School of Quantum Information and Computation (WECIQ 2006).
- Table of contents (11 chapters)
-
-
Introduction
Pages 1-4
-
The Postulates of Quantum Mechanics
Pages 5-18
-
Introduction to Quantum Walks
Pages 19-40
-
Grover’s Algorithm and Its Generalization
Pages 41-67
-
Coined Walks on Infinite Lattices
Pages 69-88
-
Table of contents (11 chapters)
Buy this book
Services for this Book
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Quantum Walks and Search Algorithms
- Authors
-
- Renato Portugal
- Series Title
- Quantum Science and Technology
- Copyright
- 2018
- Publisher
- Springer International Publishing
- Copyright Holder
- Springer Nature Switzerland AG
- eBook ISBN
- 978-3-319-97813-0
- DOI
- 10.1007/978-3-319-97813-0
- Hardcover ISBN
- 978-3-319-97812-3
- Series ISSN
- 2364-9054
- Edition Number
- 2
- Number of Pages
- XIV, 308
- Number of Illustrations
- 41 b/w illustrations, 15 illustrations in colour
- Topics
