Answers are grounded in this paper and cite their sources.
Dynamical stabilization properties of error avoiding quantum codes are investigated beyond the perturbative regime. As an example Grover's search algorithm and its behaviour under a particular class of coherent errors are studied. Numerical examples which demonstrate that error avoiding quantum codes may be capable of stabilizing quantum algorithms well beyond the regime for which they were designed originally are presented.
No takes yet. Share an insight, caveat, or question.
Mussinger et al. (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: