Abstract Adiabatic quantum algorithm is developed to reduce the time complexity of a classical nondeterministic polynomial problem to a polynomial one. However, our numerical and analytical results reveal that the evolution time of the factorization with a standard adiabatic quantum algorithm increases exponentially with the system size. By introducing the expectation of practical computation time T E , we find the optimal T E on the single evolution time requires the quantum algorithm to work in the diabatic regime, contrast to the traditional adiabatic quantum algorithm.

中文翻译：

---

数分解中的高效非绝热量子算法

摘要 绝热量子算法是为了将经典的非确定性多项式问题的时间复杂度降低为多项式问题而开发的。然而，我们的数值和分析结果表明，使用标准绝热量子算法分解的演化时间随着系统大小呈指数增长。通过引入实际计算时间 TE 的期望，我们发现单个演化时间上的最优 TE 需要量子算法在非绝热状态下工作，与传统的绝热量子算法形成对比。