arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.00021quant-phcond-mat.stat-mechcs.CC
收藏

随机浅二维量子线路的高效经典模拟

Efficient classical simulation of random shallow 2D quantum circuits

John Napp, Rolando L. La Placa, Alexander M. Dalzell, Fernando G. S. L. Brandao, Aram W. Harrow

摘要:

随机量子线路通常被认为是难以用经典方法模拟的。在某些情况下,这一点已经得到了正式的证明,而且没有证据表明,对于具有均匀随机门的电路,典型实例的近似模拟几乎和精确模拟一样困难。我们证明,这是不是这样的情况下,表现出一个浅电路家庭的均匀随机门,不能有效地经典模拟接近准确的标准硬度假设下,但可以模拟近似为所有,但一个超多项式小部分的电路实例的时间线性的量子位和门的数量。此外,我们推测,足够浅的随机电路是有效地模拟更普遍。为此,我们提出并分析了两个模拟算法。实现我们的算法之一,数值上,我们给出了有力的证据,它是有效的渐近,在某些情况下,在实践中。为了论证分析效率,我们减少了二维浅随机电路的模拟,模拟的一种形式的1D动态组成的随机本地幺正和弱测量的交替轮-一种类型的过程,通常被观察到经历一个相变从一个有效的模拟制度到一个无效的模拟制度的测量强度是不同的。使用从量子线路到统计力学模型的映射,我们给出了证据,类似的计算相变发生在我们的算法的电路架构,如局部希尔伯特空间维度和电路深度的参数是不同的。

英文摘要:

Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random gates, approximate simulation of typical instances is almost as hard as exact simulation. We prove that this is not the case by exhibiting a shallow circuit family with uniformly random gates that cannot be efficiently classically simulated near-exactly under standard hardness assumptions, but can be simulated approximately for all but a superpolynomially small fraction of circuit instances in time linear in the number of qubits and gates. We furthermore conjecture that sufficiently shallow random circuits are efficiently simulable more generally. To this end, we propose and analyze two simulation algorithms. Implementing one of our algorithms numerically, we give strong evidence that it is efficient both asymptotically and, in some cases, in practice. To argue analytically for efficiency, we reduce the simulation of 2D shallow random circuits to the simulation of a form of 1D dynamics consisting of alternating rounds of random local unitaries and weak measurements -- a type of process that has generally been observed to undergo a phase transition from an efficient-to-simulate regime to an inefficient-to-simulate regime as measurement strength is varied. Using a mapping from quantum circuits to statistical mechanical models, we give evidence that a similar computational phase transition occurs for our algorithms as parameters of the circuit architecture like the local Hilbert space dimension and circuit depth are varied.

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

↑