Statistical performance of ensemble quantum computers in search algorithms

We consider the statistical performance of ensemble quantum computers applied to search algorithms. In particular we consider algorithms implemented on pseudo pure initial states and determine the initial polarization required so that the quantum algorithm outperforms classical probabilistic competitors in terms of failure probabilities.