------------------------------------------------------------------- "Fault-Ignorant Quantum Search" Abstract: We investigate the problem of quantum searching on a noisy quantum computer. Taking a "fault-ignorant" approach, we design quantum algorithms that solve the task for various different noise strengths, possibly unknown beforehand. The rationale is to avoid costly overheads, such as traditional quantum error correction. Proving lower bounds on algorithm runtimes, which may depend on the actual level of noise, we find that the quadratic speedup is lost (in our noise models). Nevertheless, for low noise levels, our algorithms outperform the best noiseless classical search algorithm. Finally, we provide a more general framework to formulate fault-ignorant algorithms.