arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1710.03431quant-ph
收藏

时间相关绝热主方程的量子轨迹方法

Quantum trajectories for time-dependent adiabatic master equations

Ka Wa Yip, Tameem Albash, Daniel A. Lidar

AI总结:

本文提出用量子轨迹方法展开时间相关绝热主方程,通过演化N维态矢量替代N²维密度矩阵,可在并行计算下获得最高N²倍加速,并在8和16量子比特量子退火算例中验证了有效性与洞察力。

摘要:

我们描述了一种用于展开 Lindblad 形式量子绝热主方程的量子轨迹技术。通过演化一个维度为 $N$ 的复态矢量,而不是维度为 $N^2$ 的复密度矩阵,使得对更大系统尺寸的模拟变得可行。运行许多轨迹(这是恢复主方程演化所必需的)的成本可以通过并行运行轨迹来最小化,这使得该方法适用于高性能计算集群。一般来说,轨迹方法相比直接求解主方程可以提供高达 $N$ 倍的加速优势。在只需要某些可观测量的期望值的特殊情况下,甚至可能获得高达 $N^2$ 倍的优势。我们通过展示在 $8$-量子比特量子退火示例中与量子绝热主方程直接解的一致性来测试该方法。我们还将量子轨迹方法应用于一个 $16$-量子比特示例,该示例最初是为了证明隧穿在量子退火中的作用而引入的,直接使用主方程求解该示例要耗时得多。量子轨迹方法提供了对单个量子跳跃轨迹及其统计的洞察,从而揭示了超越主方程的开放系统量子绝热演化。

英文摘要:

We describe a quantum trajectories technique for the unraveling of the quantum adiabatic master equation in Lindblad form. By evolving a complex state vector of dimension $N$ instead of a complex density matrix of dimension $N^2$, simulations of larger system sizes become feasible. The cost of running many trajectories, which is required to recover the master equation evolution, can be minimized by running the trajectories in parallel, making this method suitable for high performance computing clusters. In general, the trajectories method can provide up to a factor $N$ advantage over directly solving the master equation. In special cases where only the expectation values of certain observables are desired, an advantage of up to a factor $N^2$ is possible. We test the method by demonstrating agreement with direct solution of the quantum adiabatic master equation for $8$-qubit quantum annealing examples. We also apply the quantum trajectories method to a $16$-qubit example originally introduced to demonstrate the role of tunneling in quantum annealing, which is significantly more time consuming to solve directly using the master equation. The quantum trajectories method provides insight into individual quantum jump trajectories and their statistics, thus shedding light on open system quantum adiabatic evolution beyond the master equation.

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

↑