量子和经典局部算法逼近Max $k$ XOR的界
Bounds on approximating Max $k$XOR with quantum and classical local algorithms
摘要:
我们考虑局部算法近似求解Max $k$ XOR的能力,这是之前使用经典和量子算法(MaxCut和Max E3 LIN 2)研究的两个约束满足问题的推广。在Max $k$ XOR中,每个约束都是$k$变量和奇偶校验位的XOR。在具有随机符号(奇偶校验)或每个变量没有重叠子句和$D+1$子句的情况下,我们计算Farhi等人[arXiv:1411.4028]的深度1 QAOA的预期满意分数,并与Hirvonen等人[arXiv:1402.2543]的局部阈值算法的推广进行比较。值得注意的是,量子算法优于$k > 4$的阈值算法。另一方面,我们强调了QAOA在这个问题上实现计算量子优势的潜在困难。我们首先通过数值计算平均场$k$ -自旋玻璃的基态能量密度$P(k)$来计算几乎所有大的随机规则Max $k$ XOR实例的最大满意分数的紧上限[arXiv:1606.02365]。上界随着$k$的增长比两种单局部算法的性能快得多。我们还确定了低深度量子线路(包括QAOA)的一个新的阻塞结果时,$k=3$,推广的结果Bravyi等人[arXiv:1910.08980]时,$k=2$。我们推测,一个类似的障碍存在于所有的$k$。
英文摘要:
We consider the power of local algorithms for approximately solving Max $k$XOR, a generalization of two constraint satisfaction problems previously studied with classical and quantum algorithms (MaxCut and Max E3LIN2). In Max $k$XOR each constraint is the XOR of exactly $k$ variables and a parity bit. On instances with either random signs (parities) or no overlapping clauses and $D+1$ clauses per variable, we calculate the expected satisfying fraction of the depth-1 QAOA from Farhi et al [arXiv:1411.4028] and compare with a generalization of the local threshold algorithm from Hirvonen et al [arXiv:1402.2543]. Notably, the quantum algorithm outperforms the threshold algorithm for $k > 4$. On the other hand, we highlight potential difficulties for the QAOA to achieve computational quantum advantage on this problem. We first compute a tight upper bound on the maximum satisfying fraction of nearly all large random regular Max $k$XOR instances by numerically calculating the ground state energy density $P(k)$ of a mean-field $k$-spin glass [arXiv:1606.02365]. The upper bound grows with $k$ much faster than the performance of both one-local algorithms. We also identify a new obstruction result for low-depth quantum circuits (including the QAOA) when $k=3$, generalizing a result of Bravyi et al [arXiv:1910.08980] when $k=2$. We conjecture that a similar obstruction exists for all $k$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。