Experimental implementation of the quantum random-walk algorithm

Abstract

The relevance of random walks as possible way to construct quantum algorithms is discussed. The experimental implementation of the quantum random walk algorithm on a nuclear-magnetic-resonance quantum computer was presented. The results show that the quantum walk is in sharp contrast to its classical counterpart and that the properties of the quantum walk depend strongly on the quantum entanglement.