## Quantum Walks for Computer ScientistsQuantum computation, one of the latest joint ventures between physics and the theory of computation, is a scientific field whose main goals include the development of hardware and algorithms based on the quantum mechanical properties of those physical systems used to implement such algorithms.Solving difficult tasks (for example, the Satisfiability Problem and other NP-complete problems) requires the development of sophisticated algorithms, many ofwhich employ stochastic processes as their mathematical basis.Discrete random walks are a popular choice among those stochastic processes.Inspired on the success of discrete random walks in algorithm development, quantum walks, an emerging field of quantum computation, is a generalization of random walks into the quantum mechanical world.The purpose of this lecture is to provide a concise yet comprehensive introduction to quantum walks.Table of Contents: Introduction / Quantum Mechanics / Theory of Computation / Classical Random Walks / Quantum Walks / Computer Science and Quantum Walks / Conclusions |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

Quantum Mechanics | 8 |

Theory of Computation | 26 |

Classical Random Walks | 39 |

Quantum Walks | 60 |

Computer Science and Quantum Walks | 88 |

Conclusions | 100 |

### Other editions - View all

### Common terms and phrases

algorithm development algorithms based brieﬂy Cayley graphs classical algorithm classical discrete random classical random walks coin operator complex computer science computer scientists continuous quantum walks corresponding deﬁne Deﬁnition density operator deterministic discrete and continuous discrete quantum walks discrete random walk DQWL entanglement evolution operator example exponential ﬁeld of quantum ﬁnd ﬁnding ﬁnite ﬁrst function given by Eq graph G Grover’s Hadamard walk Hilbert space hitting hypercube inﬁnite line initial introduce linear operator Markov chain mathematical matrix mixing nodes nondeterministic computation NP-complete number of steps oracle particle performance physical systems polynomial probability distribution properties of quantum proposed quantum algorithms quantum computation Quantum Information quantum mechanics quantum system qubit reﬂecting satisﬁable scientiﬁc shift operator solving stationary distribution stochastic processes studied Theorem theory of computation truth assignment unitary operator unrestricted classical random vector space veriﬁer walker walks on graphs