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

多体局部系统的仿真复杂性

Simulation Complexity of Many-Body Localized Systems

Adam Ehrenberg, Abhinav Deshpande, Christopher L. Baldwin, Dmitry A. Abanin, Alexey V. Gorshkov

摘要:

我们使用复杂性理论严格调查的困难,经典模拟下的多体局域化(MBL)的哈密顿演化。使用的定义功能,MBL系统有一套完整的准局部积分的运动(LIOMs),我们证明了一个过渡的经典复杂性模拟这样的系统作为演化时间的函数。一方面,我们构造了一个准多项式时间张量网络启发算法,用于强模拟1D MBL系统(即,计算局部可观测量的任意乘积的期望值)在系统规模中演化为任意时间多项式。在另一方面,我们证明,即使是弱模拟,即采样,成为正式困难后,指数长的进化时间,假设广泛认为在复杂性理论的approximatures。最后,利用我们的经典模拟结果的后果,我们还表明,量子线路的MBL系统的复杂性是次线性的演化时间。这一结果与最近的一个证明相对应,即随机量子线路的复杂性随时间线性增长。

英文摘要:

We use complexity theory to rigorously investigate the difficulty of classically simulating evolution under many-body localized (MBL) Hamiltonians. Using the defining feature that MBL systems have a complete set of quasilocal integrals of motion (LIOMs), we demonstrate a transition in the classical complexity of simulating such systems as a function of evolution time. On one side, we construct a quasipolynomial-time tensor-network-inspired algorithm for strong simulation of 1D MBL systems (i.e., calculating the expectation value of arbitrary products of local observables) evolved for any time polynomial in the system size. On the other side, we prove that even weak simulation, i.e. sampling, becomes formally hard after an exponentially long evolution time, assuming widely believed conjectures in complexity theory. Finally, using the consequences of our classical simulation results, we also show that the quantum circuit complexity for MBL systems is sublinear in evolution time. This result is a counterpart to a recent proof that the complexity of random quantum circuits grows linearly in time.

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

↑