将时间演化分解为基本步骤
Factorizing time evolution into elementary steps
摘要：
我们提出了一种方法来分解的量子系统的时间演化算子通过一个（有限）序列的基本操作是时间有序的。我们的建议借鉴了以前的方法的基础上李代数技术和其他因式分解程序，并需要一组优化操作，提供最终的结果。具体地说，该算法在每一步产生三个最优量，即所需的酉操作的最优持续时间，最优的功能依赖的驱动函数的最优时间，和最优的基本厄米特操作，诱导额外的酉操作要实施。通过这种方式得到的酉运算的结果序列是随时间连续的。我们将我们的建议与现有的方法进行比较，并强调哪些关键假设可以放宽实际实施。
英文摘要：
We propose an approach to factorize the time-evolution operator of a quantum system through a (finite) sequence of elementary operations that are time-ordered. Our proposal borrows from previous approaches based on Lie algebra techniques and other factorization procedures, and requires a set of optimization operations that provide the final result. Concretely, the algorithm produces at each step three optimal quantities, namely the optimal duration of the desired unitary operation, the optimal functional dependence of the driving function on the optimal time, and the optimal elementary Hermitian operation that induces the additional unitary operation to be implemented. The resulting sequence of unitary operations that is obtained this way is sequential with time. We compare our proposal with existing approaches, and highlight which key assumptions can be relaxed for practical implementations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
