Integration of Reconfigurable p‐Bit and 1R Crossbar Array for Memristive Probabilistic Computing Authors: Keunho Soh, Ji Eun Kim, Suk Yeop Chun, Su In Hwang, Byung Seok Kim, Young Jae Lee, Ho Won Jang, Jung Ho Yoon Published: 2026 ABSTRACT ABSTRACTProbabilistic computing has emerged as an efficient paradigm for solving complex problems with high dimensionality and massive combinatorial search spaces. In particular, combinatorial optimization problems (COPs) can be mapped onto energy‐based models described by an interaction (J) matrix and bias (h) vector. In hardware implementations, these parameters can be physically encoded as conductance values in a resistive crossbar array (CBA), while probabilistic bits (p‐bits) provide a stochastic update of the energy state based on a weighted‐sum operation across the CBA. Here, we present a memristive probabilistic computing system that integrates volatile memristors as p‐bits and non‐volatile memristors organized in a selector‐less 1R CBA for representing the J matrix and h vector. The volatile memristors perform stochastic conductive filament formation and rupture to generate reconfigurable probabilistic outputs, while the non‐volatile memristors form a nanocluster‐based conductive path that enable reliable array operation without additional selector devices. The integrated system is experimentally validated through reversible AND and NAND gate operations in both forward and inverse modes. Furthermore, the scalability and generality of the proposed architecture were evaluated through simulation of a 2‐bit binary multiplier operation. This work presents a practical and scalable framework for fully hardware‐based probabilistic computing using memristive technologies. Introduction Combinatorial optimization problems (COPs) arise in a wide range of scientific and engineering applications, where the objective is to identify optimal configurations from exponentially large discrete search spaces. Representative examples include scheduling, [1, 2] satisfiability, [3, 4] and graph optimization problems, [5, 6] all of which exhibit rapidly increasing computational complexity as system size grows. Conventional deterministic digital computing architectures are often inefficient for solving such problems, as they rely on exhaustive search or iterative numerical methods [7]. Probabilistic computing offers an alternative paradigm by treating randomness as a computational resource, enabling efficient exploration of complex energy landscapes and convergence toward the lowest energy solutions [8]. Such problems can be formulated as energy minimization problems defined by pairwise interactions and local biases: E=−∑i