Before revision:  Our algorithm builds on a result of independent interest: we give a quantum algorithm to find the first marked element in a collection of m objects, that works even in the presence of two-sided bounded errors on the input oracle.
After revision:  We also give a simple quantum algorithm to find the first marked element in a collection of m objects, that works even in the presence of two-sided bounded errors on the input oracle.