arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.01226cond-mat.str-elcond-mat.quant-gasquant-ph
收藏

时间演化的Chebyshev矩阵乘积态方法

Chebyshev matrix product state approach for time evolution

Jad C. Halimeh, Fabian Kolley, Ian P. McCulloch

摘要:

我们提出并测试了Holzner等人最初提出的时间演化量子多体系统的新算法[Phys. Rev. B 83,195 - 115(2011)]。该方法是基于合并的矩阵乘积状态(MPS)形式主义的方法扩展的时间演化算子的切比雪夫多项式。我们计算了一维晶格上在玻色-哈伯德哈密顿量下淬灭的硬核玻色子系统的含时可观量。我们比较新的算法更标准的方法使用MPS架构。我们发现,Chebyshev方法给出了数值精确的结果为小的时间。然而,可达时间小于与其他国家的最先进的方法获得的。我们进一步扩展了新的方法,使用基于频谱分解的投影方案,利用有效带宽显着小于全带宽,导致更长的进化时间比非投影方法和更有效的信息存储,数据压缩,和更少的计算工作量。

英文摘要:

We present and test a new algorithm for time-evolving quantum many-body systems initially proposed by Holzner et al. [Phys. Rev. B 83, 195115 (2011)]. The approach is based on merging the matrix product state (MPS) formalism with the method of expanding the time-evolution operator in Chebyshev polynomials. We calculate time-dependent observables of a system of hardcore bosons quenched under the Bose-Hubbard Hamiltonian on a one-dimensional lattice. We compare the new algorithm to more standard methods using the MPS architecture. We find that the Chebyshev method gives numerically exact results for small times. However, the reachable times are smaller than the ones obtained with the other state-of-the-art methods. We further extend the new method using a spectral-decomposition-based projective scheme that utilizes an effective bandwidth significantly smaller than the full bandwidth, leading to longer evolution times than the non-projective method and more efficient information storage, data compression, and less computational effort.

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

↑