发表机构
Toyota Technological Institute at Chicago（芝加哥丰田技术研究所）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
提出经典多项式时间算法，在常数密度下强反驳随机量子3-SAT，利用SDP和非交换性克服成对独立性障碍，否证了Feige假设的量子类比。
AI 中文摘要
我们给出了一个经典多项式时间算法，该算法在足够大的常数约束密度下强反驳随机量子$3$-SAT，从而否证了Feige随机$3$-SAT假设的量子类比。这与经典随机$3$-SAT形成鲜明对比，后者仅在约束密度$\Delta\gtrsim n^{1/2}$时已知有多项式时间强反驳。尽管量子$3$-SAT与其经典对应物一样存在成对独立性障碍，我们的基于SDP的反驳通过利用量子约束的非交换性克服了这一障碍。
英文摘要
We give a classical polynomial-time algorithm that strongly refutes random quantum $3$-SAT at sufficiently large constant constraint density, thereby disproving the quantum analogue of Feige's random $3$-SAT hypothesis. This stands in sharp contrast to classical random $3$-SAT, for which polynomial-time strong refutation is known only at constraint density $Δ\gtrsim n^{1/2}$. Although quantum $3$-SAT shares the pairwise-independence barrier of its classical counterpart, our SDP-based refutation overcomes this barrier by exploiting the noncommutativity of quantum constraints.
