Dynamical stabilization properties of error avoiding quantum codes are inve
stigated beyond the perturbative regime. As an example Grover's search algo
rithm and its behaviour under a particular class of coherent errors are stu
died. Numerical examples which demonstrate that error avoiding quantum code
s may be capable of stabilizing quantum algorithms well beyond the regime f
or which they were designed originally are presented.