Abstract This article critically investigates the limitations of the simulated annealing algorithm using probabilistic bits (pSA) in solving large-scale combinatorial optimization problems. The study begins with an in-depth analysis of the pSA process. focusing on the issues resulting from unexpected oscillations among p-bits. These oscillations hinder the energy reduction of the Isin... https://foldlyers.shop/product-category/3m/