One-dimensional discrete-time quantum walks on random environments
Quantum Information Processing
Localization of an inhomogeneous discrete-time quantum walk on the line
Quantum Information Processing
New developments in quantum algorithms
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Continuous-time quantum walks on the threshold network model
Mathematical Structures in Computer Science
Quantum walks and elliptic integrals
Mathematical Structures in Computer Science
On the von neumann entropy of certain quantum walks subject to decoherence†
Mathematical Structures in Computer Science
Coalgebraic walks, in quantum and turing computation
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
One dimensional quantum walks with memory
Quantum Information & Computation
Sojourn times of the Hadamard walk in one dimension
Quantum Information Processing
Return probability of one-dimensional discrete-time quantum walks with final-time dependence
Quantum Information & Computation
Entanglement for discrete-time quantum walks on the line
Quantum Information & Computation
Time averaged distribution of a discrete-time quantum walk on the path
Quantum Information Processing
Asymptotic distributions of quantum walks on the line with two entangled coins
Quantum Information Processing
Quantum walks: a comprehensive review
Quantum Information Processing
Realization of the probability laws in the quantum central limit theorems by a quantum walk
Quantum Information & Computation
| Hi-index | 0.00 |
Quantum 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