Quantum algorithms are prone to errors during their execution that may alter the outcome considerably. Although several error correcting schemes have been proposed, they require a considerable overhead in terms of resources.
At this infant stage of quantum computing when only a limited number of qubits can be coherently controlled, a relevant question to be considered is: How robust is a quantum algorithm against disorders when error correction is absent?
In this poster, we address this question for the spatial search algorithm formulated as a continuous time quantum walk (CTQW) and show that it is robust to naturally occurring static errors.