English

pc-COP: An Efficient and Configurable 2048-p-Bit Fully-Connected Probabilistic Computing Accelerator for Combinatorial Optimization

Emerging Technologies 2025-04-08 v1

Abstract

Probabilistic computing is an emerging quantum-inspired computing paradigm capable of solving combinatorial optimization and various other classes of computationally hard problems. In this work, we present pc-COP, an efficient and configurable probabilistic computing hardware accelerator with 2048 fully connected probabilistic bits (p-bits) implemented on Xilinx UltraScale+ FPGA. We propose a pseudo-parallel p-bit update architecture with speculate-and-select logic which improves overall performance by 4×4 \times compared to the traditional sequential p-bit update. Using our FPGA-based accelerator, we demonstrate the standard G-Set graph maximum cut benchmarks with near-99% average accuracy. Compared to state-of-the-art hardware implementations, we achieve similar performance and accuracy with lower FPGA resource utilization.

Keywords

Cite

@article{arxiv.2504.04543,
  title  = {pc-COP: An Efficient and Configurable 2048-p-Bit Fully-Connected Probabilistic Computing Accelerator for Combinatorial Optimization},
  author = {Kiran Magar and Shreya Bharathan and Utsav Banerjee},
  journal= {arXiv preprint arXiv:2504.04543},
  year   = {2025}
}

Comments

Published in 2024 IEEE High Performance Extreme Computing Conference (HPEC)

R2 v1 2026-06-28T22:48:39.507Z