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.
Self-Supervised Transformers as Iterative Solution Improvers for Constraint Satisfaction
University of Toronto(多伦多大学);Vector Institute for Artificial Intelligence(向量人工智能研究所);Scale AI Research Chair in Data-Driven Algorithms for Modern Supply Chains(数据驱动算法现代供应链研究席位)
QAmplifyNet: Pushing the Boundaries of Supply Chain Backorder Prediction Using Interpretable Hybrid Quantum-Classical Neural Network
Khulna University of Engineering and Technology (KUET)(库尔纳工程技术大学(KUET));American International University-Bangladesh (AIUB)(孟加拉国美国国际大学(AIUB));The University of Aizu(会津大学)
State Key Lab of Processors, Institute of Computing Technology, Chinese Academy of Sciences(处理器国家重点实验室,计算技术研究所,中国科学院);School of Computer Science and Technology, University of Chinese Academy of Sciences(计算机科学与技术学院,中国科学院大学);QICI Quantum Information and Computation Initiative, School of Computing and Data Science, The University of Hong Kong(量子信息与计算倡议,计算与数据科学学院,香港大学)