Abstract
Quantum random walk search algorithm has shown a quadratic speed up, which is similar to Grover's algorithm, over classical search algorithms. However, there does not exist any quantum search algorithm which requires fewer queries than O(pN) when searching on a database of N items. In this thesis, we analyze the relationship between the entanglement and the quantum random walk search algorithm. And also, we give some trials for random walk search on a line. It appears that quantum random walks are useful and °exible tools for designing quantum algorithms.