arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.03605quant-ph
收藏

Lee-Yang张量与哈密顿量复杂性

Lee-Yang tensors and Hamiltonian complexity

University of Waterloo(滑铁卢大学);IBM Quantum, IBM T.J. Watson Research Center(IBM量子,IBM T.J.沃森研究中心);Perimeter Institute for Theoretical Physics(理论物理珀蒂默研究所)

Benjamin Wong, Sergey Bravyi, David Gosset, Yinchen Liu

AI总结:

本文研究了Lee-Yang张量在量子态和算符中的应用,发现r=1是关键阈值,并提出了一种基于该模型的高效量子退火算法。

摘要:

一个具有n个二进制索引的复张量可以与n个复变量的多元多项式相对应。我们称其为半径为r的Lee-Yang张量,当且仅当多项式在所有变量位于半径为r的开圆盘内时不为零。在本文中,我们研究以计算基为表达方式的量子态和算符,这些张量是Lee-Yang张量。我们首先回顾了其基本性质,包括在张量收缩和某些量子操作下的封闭性。我们证明了Lee-Yang半径r>1的量子态可以通过准多项式规模的电路制备。我们还证明了每个Lee-Yang半径r>1的厄米特算符具有唯一的主特征向量。这些结果表明r=1是量子态和算符的关键阈值。最后,我们考虑了一种双局部哈密顿量族,其中每个相互作用项在能量上倾向于一个变形的EPR态|00⟩+s|11⟩(其中0≤s≤1)。我们数值研究了该模型,并发现对于所有考虑的图,基态的Lee-Yang半径至少为r=1/√s,而两个最小特征值之间的能隙至少为1-s²。我们推测这些下界在更一般的情况下也成立;特别是,这将为均匀加权二分图上的量子最大割问题提供一个高效的量子退火算法。

英文摘要:

A complex tensor with $n$ binary indices can be identified with a multilinear polynomial in $n$ complex variables. We say it is a Lee-Yang tensor with radius $r$ if the polynomial is nonzero whenever all variables lie in the open disk of radius $r$. In this work we study quantum states and observables which are Lee-Yang tensors when expressed in the computational basis. We first review their basic properties, including closure under tensor contraction and certain quantum operations. We show that quantum states with Lee-Yang radius $r > 1$ can be prepared by quasipolynomial-sized circuits. We also show that every Hermitian operator with Lee-Yang radius $r > 1$ has a unique principal eigenvector. These results suggest that $r = 1$ is a key threshold for quantum states and observables. Finally, we consider a family of two-local Hamiltonians where every interaction term energetically favors a deformed EPR state $|00\rangle + s|11\rangle$ for some $0 \leq s \leq 1$. We numerically investigate this model and find that on all graphs considered the Lee-Yang radius of the ground state is at least $r = 1/\sqrt{s}$ while the spectral gap between the two smallest eigenvalues is at least $1-s^2$. We conjecture that these lower bounds hold more generally; in particular, this would provide an efficient quantum adiabatic algorithm for the quantum Max-Cut problem on uniformly weighted bipartite graphs.

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

↑