基于重叠间隙性质的组合NLTS
Combinatorial NLTS From the Overlap Gap Property
AI总结:
本文提供了一类满足组合NLTS的哈密顿量的“非码”构造,利用随机K-SAT的重叠间隙性质和近满足赋值空间的聚类性质,证明了组合近基态无法由浅层量子电路制备,并预计该方法可扩展至其他随机结构。
摘要:
在近期的一项重要进展中,Anshu、Breuckmann和Nirkhe [ABN22]对Freedman和Hastings提出的所谓无低能平凡态(NLTS)猜想给出了肯定的解答。该猜想假设在n比特量子系统上存在大小为线性的局部哈密顿量,使得没有任何近基态可以通过浅层(亚对数深度)电路来制备。[ABN22]中的构造基于近期发展的良好量子码。该方向的早期成果包括所谓的组合NLTS(NLTS的一个较弱版本)的构造,其中如果一个态违反的哈密顿量项至多为一个趋于零的比例,则该态被定义为低能态 [AB22]。这些构造同样基于码。在本文中,我们提供了一类满足组合NLTS的哈密顿量的“非码”构造。该构造受 [AB22] 启发,但我们的证明利用了随机K-SAT的复杂解空间几何,而非码的性质。具体而言,已知在特定的子句与变量密度之上,随机K-SAT的满足赋值集合表现出重叠间隙性质,这意味着它可以被划分为指数级数量的簇,每个簇至多占满足解总集合的指数级微小比例。我们为近满足赋值空间确立了该聚类性质的一种稳健版本,并证明对于我们构造的哈密顿量,每一个组合近基态都会诱导一个由该集合支撑的近均匀分布。随后使用标准论证表明,这种分布无法由深度为o(log n)的量子电路制备。由于聚类性质在许多随机结构中均有体现,包括正常着色和最大割,我们预计该方法也可扩展至这些模型。
英文摘要:
In an important recent development, Anshu, Breuckmann, and Nirkhe [ABN22] resolved positively the so-called No Low-Energy Trivial State (NLTS) conjecture by Freedman and Hastings. The conjecture postulated the existence of linear-size local Hamiltonians on n qubit systems for which no near-ground state can be prepared by a shallow (sublogarithmic depth) circuit. The construction in [ABN22] is based on recently developed good quantum codes. Earlier results in this direction included the constructions of the so-called Combinatorial NLTS -- a weaker version of NLTS -- where a state is defined to have low energy if it violates at most a vanishing fraction of the Hamiltonian terms [AB22]. These constructions were also based on codes. In this paper we provide a "non-code" construction of a class of Hamiltonians satisfying the Combinatorial NLTS. The construction is inspired by one in [AB22], but our proof uses the complex solution space geometry of random K-SAT instead of properties of codes. Specifically, it is known that above a certain clause-to-variables density the set of satisfying assignments of random K-SAT exhibits an overlap gap property, which implies that it can be partitioned into exponentially many clusters each constituting at most an exponentially small fraction of the total set of satisfying solutions. We establish a certain robust version of this clustering property for the space of near-satisfying assignments and show that for our constructed Hamiltonians every combinatorial near-ground state induces a near-uniform distribution supported by this set. Standard arguments then are used to show that such distributions cannot be prepared by quantum circuits with depth o(log n). Since the clustering property is exhibited by many random structures, including proper coloring and maximum cut, we anticipate that our approach is extendable to these models as well.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。