Can quantum chaos enhance the stability of quantum computation?
Tomaž Prosen, Marko Žnidarič · Journal of Physics A Mathematical and General · 2001
We consider the stability of a general quantum algorithm (QA) 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 on decreasing the 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' QA is devised, which is qualitatively more robust against static random residual n -qubit interaction.