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

量子哈密顿演化的优化:从两个投影算符到局域哈密顿算符

Optimisation of Quantum Hamiltonian Evolution: From Two Projection Operators to Local Hamiltonians

Apoorva Patel, Anjani Priyadarsini

摘要:

给定一个量子哈密顿量和它的演化时间,对应的么正演化算符可以用许多不同的方式构造,对应于所需端点之间的不同轨迹和不同的级数展开。然后可以在这些可能性中进行选择,以获得最佳的计算复杂性和对误差的控制。它示出了如何建设Grover的算法的基础上的时间线性缩放和mammically在误差界,是指数级优越的错误复杂性的计划的基础上直接应用的Lie-Trotter公式。然后,该策略扩展到模拟的任何哈密尔顿是一个线性组合的两个投影算子,然后到任何本地有效地可计算的哈密尔顿。关键特征是根据最大可能的步骤而不是采取小的时间步长来构建演化。反射操作和Chebyshev展开用于有效地控制整体演化的总误差,而不用担心单个步骤的离散化误差。我们也使用量子态的数字实现,使得线性代数运算相当简单。

英文摘要:

Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points and different series expansions. A choice among these possibilities can then be made to obtain the best computational complexity and control over errors. It is shown how a construction based on Grover's algorithm scales linearly in time and logarithmically in the error bound, and is exponentially superior in error complexity to the scheme based on the straightforward application of the Lie-Trotter formula. The strategy is then extended first to simulation of any Hamiltonian that is a linear combination of two projection operators, and then to any local efficiently computable Hamiltonian. The key feature is to construct an evolution in terms of the largest possible steps instead of taking small time steps. Reflection operations and Chebyshev expansions are used to efficiently control the total error on the overall evolution, without worrying about discretisation errors for individual steps. We also use a digital implementation of quantum states that makes linear algebra operations rather simple to perform.

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

↑