arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.15334quant-ph
收藏

用置换展开法模拟含时哈密顿量的量子算法

Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion

Yi-Hsiang Chen, Amir Kalev, Itay Hen

摘要:

我们提出了一个量子算法的动力学模拟的含时哈密顿量。我们的方法涉及扩展的相互作用图片的哈密尔顿作为一个广义排列的总和,这导致一个积分免费戴森系列的时间演化算子。在此表示下,我们利用幺正线性组合技术对时间演化算符进行了量子模拟。我们优化的时间步长的演化的基础上的哈密顿的动力学特性,导致门计数的规模与$L^1$ -norm-like缩放只相对于规范的相互作用哈密顿,而不是总的哈密顿。我们证明了该算法的成本是独立的哈密顿的频率,这意味着它的优势,系统具有高度振荡的组件,和时间衰减系统的成本不与总的进化时间渐近缩放。此外,我们的算法保留了接近最佳的$\log(1/ε)/\log\log(1/ε)$缩放与模拟误差$ε$。

英文摘要:

We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series of the time-evolution operator. Under this representation, we perform a quantum simulation for the time-evolution operator by means of the linear combination of unitaries technique. We optimize the time steps of the evolution based on the Hamiltonian's dynamical characteristics, leading to a gate count that scales with an $L^1$-norm-like scaling with respect only to the norm of the interaction Hamiltonian, rather than that of the total Hamiltonian. We demonstrate that the cost of the algorithm is independent of the Hamiltonian's frequencies, implying its advantage for systems with highly oscillating components, and for time-decaying systems the cost does not scale with the total evolution time asymptotically. In addition, our algorithm retains the near optimal $\log(1/ε)/\log\log(1/ε)$ scaling with simulation error $ε$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑