We introduce spontaneous decay of qubits to damp the oscillations in a single-item quantum search. This allows a more robust mode of operation where the readout is performed after the system has reached a steady state, rather than after a prescribed number of iterations. We show numerically for up to q=29 qubits that, with near-unit probability, the readout yields an error-free solution after O(log q) repetitions. The huge size of the state space is dealt with by exploiting a symmetry in the master equation that reduces the scaling of computer resources from exponential to polynomial.