This article presents a high-performance annealing processor named STochAsTIc Cellular automata Annealer (STATICA) for solving combinatorial optimization problems represented by fully connected graphs. Supporting fully connected graphs is strongly required for dealing with realistic optimization problems. Unlike previous annealing processors that follow Glauber dynamics, our proposed annealer can update multiple states of fully connected spins simultaneously by introducing different dynamics called stochastic cellular automata annealing. It allows us to utilize the pipeline-level and memory-bank-level parallelization in addition to the PE-level parallelization originally adopted in the previous annealers. The STATICA prototype chip, which supports 512-spin fully connected graph, has been fabricated with the 65-nm CMOS technology and realized as a 3 mm $\times \,\,{4}$ mm chip. Using the fabricated 512-spin chip and numerical projections for a 2048-spin chip, we have conducted experiments to reveal the annealing performance of STATICA and examined how to control its annealing process efficiently.

中文翻译：

---

STATICA：512-Spin 0.25M 重量退火处理器，具有所有自旋更新一次架构，用于具有完整自旋-自旋相互作用的组合优化

本文介绍了一种名为 STOchAsTIc Cellular automata Annealer (STATICA) 的高性能退火处理器，用于解决由全连接图表示的组合优化问题。处理现实的优化问题强烈需要支持全连接图。与之前遵循 Glauber 动力学的退火处理器不同，我们提出的退火器可以通过引入称为随机元胞自动机退火的不同动力学同时更新完全连接自旋的多个状态。除了先前退火器中最初采用的 PE 级并行化之外，它还允许我们利用流水线级和内存库级并行化。STATICA 原型芯片，支持 512-spin 全连接图，已使用 65 纳米 CMOS 技术制造并实现为 3 毫米 $\times \,\,{4}$ mm 芯片。使用制造的 512-spin 芯片和 2048-spin 芯片的数值预测，我们进行了实验以揭示 STATICA 的退火性能，并研究如何有效地控制其退火过程。