量子混沌能增强量子计算的稳定性吗？
Can quantum chaos enhance stability of quantum computation?
摘要：
我们考虑了一般量子算法相对于量子比特之间的固定但未知的剩余相互作用的稳定性，并显示了一个令人惊讶的事实，即量子计算的平均保真度通过减少连续量子门序列中扰动算子的平均时间关联函数而增加。我们的思想被应用到量子傅立叶变换，其中设计了一种替代的“不太规则”的量子算法，该算法在定性上对静态随机剩余n量子比特相互作用更鲁棒。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
