  We consider stability of a general quantum algorithm with respect to a fixed
but unknown residual interaction between qubits, and show a surprising fact,
namely that the average fidelity of quantum computation increases by decreasing
average time correlation function of the perturbing operator in sequences of
consecutive quantum gates. Our thinking is applied to the quantum Fourier
transformation where an alternative 'less regular' quantum algorithm is devised
which is qualitatively more robust against static random residual n-qubit
interaction.
