经典和量子有界深度近似算法
Classical and Quantum Bounded Depth Approximation Algorithms
摘要:
我们考虑一些经典的和量子的近似优化算法与有界深度。首先,我们定义了一类“局部”经典优化算法,并表明这些算法的单步版本可以实现相同的性能作为单步QAOA MAX-3-LIN-2。其次,我们证明了这类经典算法推广了文献中先前考虑的一类,并且经典算法的单步将优于所有无三角形MAX-CUT实例上的单步QAOA。事实上,除了$4$的度选择,现有的单步经典算法在这些图上已经优于QAOA,而对于其余的$4$选择,我们表明这里的推广优于它。它在有界度图上的MAX-3-LIN-2上的性能不能实现与一类“全局”经典算法所能实现的相同的缩放。这些结果表明,这种局部经典算法可能至少是有前途的近似优化的QAOA。
英文摘要:
We consider some classical and quantum approximate optimization algorithms with bounded depth. First, we define a class of "local" classical optimization algorithms and show that a single step version of these algorithms can achieve the same performance as the single step QAOA on MAX-3-LIN-2. Second, we show that this class of classical algorithms generalizes a class previously considered in the literature, and also that a single step of the classical algorithm will outperform the single-step QAOA on all triangle-free MAX-CUT instances. In fact, for all but $4$ choices of degree, existing single-step classical algorithms already outperform the QAOA on these graphs, while for the remaining $4$ choices we show that the generalization here outperforms it. Finally, we consider the QAOA and provide strong evidence that, for any fixed number of steps, its performance on MAX-3-LIN-2 on bounded degree graphs cannot achieve the same scaling as can be done by a class of "global" classical algorithms. These results suggest that such local classical algorithms are likely to be at least as promising as the QAOA for approximate optimization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。