arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.04016quant-phcs.AI
收藏

约束满足问题的量子近似方法

Quantum-Inspired Approximations to Constraint Satisfaction Problems

Applied Research Laboratories, The University of Texas at Austin(德克萨斯大学奥斯汀分校应用研究实验室)

S. Andrew Lanham

摘要:

约束满足问题的两个对比算法范例是连续的相邻配置的局部探索与使用关于问题的全局信息产生新的配置(例如,近似满足配置的概率分布的边缘)。本文提出了新的算法,后者的框架,最终产生满意的配置使用布尔傅立叶分析方法的估计。该方法广泛地受到量子振幅放大算法的启发,因为它最大限度地增加了近似函数的振幅,超过了给定顺序细化的满意配置。我们证明,满意的解决方案可以检索到类似于量子测量的过程中有效的稀疏在傅立叶域,并提出了一个完整的求解器的建设使用这种新的近似。细化策略中的自由度为在进化计算框架中设计求解器提供了进一步的机会。结果表明,对本地求解器的布尔可满足性(SAT)问题的竞争力表现,鼓励未来的工作,了解布尔傅立叶分析和约束满足之间的联系。

英文摘要:

Two contrasting algorithmic paradigms for constraint satisfaction problems are successive local explorations of neighboring configurations versus producing new configurations using global information about the problem (e.g. approximating the marginals of the probability distribution which is uniform over satisfying configurations). This paper presents new algorithms for the latter framework, ultimately producing estimates for satisfying configurations using methods from Boolean Fourier analysis. The approach is broadly inspired by the quantum amplitude amplification algorithm in that it maximally increases the amplitude of the approximation function over satisfying configurations given sequential refinements. We demonstrate that satisfying solutions may be retrieved in a process analogous to quantum measurement made efficient by sparsity in the Fourier domain, and present a complete solver construction using this novel approximation. Freedom in the refinement strategy invites further opportunities to design solvers in an evolutionary computing framework. Results demonstrate competitive performance against local solvers for the Boolean satisfiability (SAT) problem, encouraging future work in understanding the connections between Boolean Fourier analysis and constraint satisfaction.

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

↑