Energy-Efficient p-Bit-Based Fully-Connected Quantum-Inspired Simulated Annealer with Dual BRAM Architecture
arXiv:2602.16143 · doi:10.1109/ACCESS.2026.3651741
Abstract
Probabilistic bits (p-bits) offer an energy-efficient hardware abstraction for stochastic optimization; however, existing p-bit-based simulated annealing accelerators suffer from poor scalability and limited support for fully connected graphs due to fan-out and memory overhead. This paper presents an energy-efficient FPGA architecture for stochastic simulated quantum annealing (SSQA) that addresses these challenges. The proposed design combines a spin-serial and replica-parallel update schedule with a dual-BRAM delay-line architecture, enabling scalable support for fully connected Ising models while eliminating fan-out growth in logic resources. By exploiting SSQA, the architecture achieves fast convergence using only final replica states, significantly reducing memory requirements compared to conventional p-bit-based annealers. Implemented on a Xilinx ZC706 FPGA, the proposed system solves an 800-node MAX-CUT benchmark and achieves up to 50% reduction in energy consumption and over 90\% reduction in logic resources compared with prior FPGA-based p-bit annealing architectures. These results demonstrate the practicality of quantum-inspired, p-bit-based annealing hardware for large-scale combinatorial optimization under strict energy and resource constraints.
References in corpus (14)
- Ising formulations of many NP problems
- Quantum annealing with more than one hundred qubits
- Theory of Quantum Annealing of an Ising Spin Glass
- PyCUDA and PyOpenCL: A Scripting-Based Approach to GPU Run-Time Code Generation
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- Stochastic p-bits for Invertible Logic
- VLSI Implementation of Deep Neural Network Using Integral Stochastic Computing
- p-Bits for Probabilistic Spin Logic
- Massively Parallel Probabilistic Computing with Sparse Ising Machines
- Demonstration of nanosecond operation in stochastic magnetic tunnel junctions
- Hardware-aware Boltzmann machine learning using stochastic magnetic tunnel junctions
- Memory-Efficient FPGA Implementation of Stochastic Simulated Annealing
- Enhanced Convergence in p-bit Based Simulated Annealing with Partial Deactivation for Large-Scale Combinatorial Optimization Problems
- Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems