arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.09133quant-phcond-mat.str-elcs.DSphysics.chem-ph
收藏

关于实现 Trotter 步骤的复杂性

On the complexity of implementing Trotter steps

Guang Hao Low, Yuan Su, Yu Tong, Minh C. Tran

AI总结:

我们开发了在哈密顿量项数上亚线性的 Trotter 步骤实现方法,适用于相互作用幂律衰减的哈密顿量,并证明了均匀电子气模拟的门复杂度渐近改进,同时给出了通用哈密顿量的电路下界。

摘要:

量子动力学可以通过按顺序对哈密顿量中的基本项进行指数化,在量子计算机上进行模拟。然而,这种 Trotter 步骤的实现具有依赖于总哈密顿量项数的门复杂性,与使用更先进技术的算法相比显得不利。我们开发了执行更快 Trotter 步骤的方法,其复杂性在项数上呈亚线性。我们针对一类相互作用强度随距离按幂律衰减的哈密顿量实现了这一点。我们的方法包括一种基于递归块编码的方法和一种基于平均成本模拟的方法,克服了这些先进量子模拟技术的归一化因子障碍。当哈密顿量系数的某些块具有低秩时,我们也实现了更快的 Trotter 步骤。结合更严格的误差分析,我们表明,在实空间中,使用 $n$ 个自旋轨道和 $η$ 个电子的第二量子化来模拟均匀电子气,只需使用 $\left(η^{1/3}n^{1/3}+\frac{n^{2/3}}{η^{2/3}}\right)n^{1+o(1)}$ 个门就足够了,渐近地改进了先前的最佳工作。当在 Born-Oppenheimer 近似下引入原子核的外部势时,我们获得了类似的结果。我们证明了当哈密顿量系数取连续范围的值时,电路下界,表明具有对易项的通用 $n$ 量子比特 $2$-局部哈密顿量,在时间 $t=Ω(ε)$ 内以精度 $ε=Ω(1/poly(n))$ 演化,至少需要 $Ω(n^2)$ 个门。我们的证明基于从 Hamming 权重-$2$ 子空间内对角酉的近似合成到门高效归约,这可能具有独立的意义。因此,我们的结果表明,利用哈密顿量的结构性质既是实现具有较低门复杂性的 Trotter 步骤的必要条件,也是充分条件。

英文摘要:

Quantum dynamics can be simulated on a quantum computer by exponentiating elementary terms from the Hamiltonian in a sequential manner. However, such an implementation of Trotter steps has gate complexity depending on the total Hamiltonian term number, comparing unfavorably to algorithms using more advanced techniques. We develop methods to perform faster Trotter steps with complexity sublinear in the number of terms. We achieve this for a class of Hamiltonians whose interaction strength decays with distance according to power law. Our methods include one based on a recursive block encoding and one based on an average-cost simulation, overcoming the normalization-factor barrier of these advanced quantum simulation techniques. We also realize faster Trotter steps when certain blocks of Hamiltonian coefficients have low rank. Combining with a tighter error analysis, we show that it suffices to use $\left(η^{1/3}n^{1/3}+\frac{n^{2/3}}{η^{2/3}}\right)n^{1+o(1)}$ gates to simulate uniform electron gas with $n$ spin orbitals and $η$ electrons in second quantization in real space, asymptotically improving over the best previous work. We obtain an analogous result when the external potential of nuclei is introduced under the Born-Oppenheimer approximation. We prove a circuit lower bound when the Hamiltonian coefficients take a continuum range of values, showing that generic $n$-qubit $2$-local Hamiltonians with commuting terms require at least $Ω(n^2)$ gates to evolve with accuracy $ε=Ω(1/poly(n))$ for time $t=Ω(ε)$. Our proof is based on a gate-efficient reduction from the approximate synthesis of diagonal unitaries within the Hamming weight-$2$ subspace, which may be of independent interest. Our result thus suggests the use of Hamiltonian structural properties as both necessary and sufficient to implement Trotter steps with lower gate complexity.

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

↑