Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
(net)
price for USA
ISBN 978-1-4614-6336-8
digitally watermarked, no DRM
Included Format: PDF and EPUB
download immediately after purchase
Hardcover version
You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.
Standard shipping is free of charge for individual customers.
(net)
price for USA
ISBN 978-1-4614-6335-1
free shipping for individuals worldwide
usually dispatched within 3 to 5 business days
Softcover (also known as softback) version.
You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.
Standard shipping is free of charge for individual customers.
(net)
price for USA
ISBN 978-1-4899-8802-7
free shipping for individuals worldwide
Due: January 17, 2013
This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks.
It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which can be modeled by a graph. The goal is to find a specific node knowing that the particle uses the edges to jump from one node to the next.
This book is self-contained with main topics that include:
The reader will benefit from the pedagogical aspects of the book, learning faster and with more ease than would be possible from the primary research literature. Exercises and references further deepen the reader's understanding, and guidelines for the use of computer programs to simulate the evolution of quantum walks are also provided.
Content Level » Graduate
Keywords » Abstract Search Algorithms - Continuous-time Algorithms - Discrete-time Quantum Walks - Grover’s Algorithm - Quantum Algorithms - Quantum Hitting Times - Quantum Markov Chains - Quantum Mixing Times - Quantum Search Algorithms - Quantum Walks on Graphs - Szegedy’s Quantum-walk Model
Related subjects » Applied & Technical Physics - Quantum Physics - Theoretical Computer Science
Introduction.- The Postulates of Quantum Mechanics.- Introduction to Quantum Walks.- Grover's Algorithm and its Generalization.- Quantum Walks on Infinite Graphs.- Quantum Walks on Finite Graphs.- Limiting Distribution and Mixing Time.- Spatial Algorithms.- Hitting Time.- Appendix: Linear Algebra for Quantum Computation.
Get alerted on new Springer publications in the subject area of Quantum Physics.