关于在异或机上解决结构化的SAT问题:一个半素数分解研究
On the Limits of Ising Machines for Circuit-Derived SAT
AI总结:
本文研究了异或机在解决结构化SAT问题上的限制,提出混合方法提升解决能力,通过半素数分解案例展示异或机的潜力。
摘要:
异或机正成为一种新的技术,用于解决各种具有实际重要性的计算上困难的问题类别,但它们在结构化SAT工作负载上的限制,代表了众多现实应用,仍然未被探索。我们首次系统地研究了这些问题,使用半素数分解作为代表案例。我们的结果表明,高度限制性的'紧'约束,当映射到优化形式时,从根本上扭曲了异或动态,这些扭曲在将问题分解以适应有限硬件时会被放大。我们提出了一种混合方法,将约束重的组件卸载到经典预处理,而将计算上具有挑战性的部分保留给异或机。结构化SAT代表了现实应用的关键一步,但今天仍然无法达到,由于异或机的限制。我们的发现揭示了约束处理是核心障碍,并强调了混合硬件软件方法作为解锁异或机长期潜力的途径。我们对制造的异或芯片进行了评估,并证明我们的流程在45-spin全连接异或芯片上,不改变硬件的情况下,将可解决的问题规模从8位(94变量)增加到11位(190变量)以上,超过了一倍。
英文摘要:
Emerging Ising machines are promising for solving computationally hard optimization problems, yet their limits on structured, circuit-derived satisfiability (SAT) problems remain poorly understood. Using semiprime factorization as a representative benchmark, we show that tight constraints, when mapped into optimization form, fundamentally distort the energy landscape, and that these distortions are amplified when problems are decomposed to fit limited Ising machine capacity. To address this, we propose a hybrid flow that offloads Ising-harmful structure to lightweight preprocessing while reserving the genuinely hard search for the Ising machine. We further show that generic, circuit-structure-unaware decomposition is insufficient for circuit-derived instances, and that structure-aware partitioning is essential. These findings identify constraint handling as a central obstacle, highlighting hybrid hardware-software approaches as the path forward for scaling Ising machines to real-world SAT workloads. Evaluated on fabricated 45-spin all-to-all Ising chips, our flow extends solvable problem sizes from 8-bit (94 variables) to 11-bit (190 variables) without any hardware changes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。