A Scalable and Resource‐Efficient Pipelined p‐Computer for Probabilistic Ising Machines
Authors:
- Deborah VolpeDVDeborah Volpe
- Eleonora RaimondoEREleonora Raimondo
- Andrea GrimaldiAGAndrea Grimaldi
- Pedram Khalili AmiriPAPedram Khalili Amiri
- Stefano ChiappiniSCStefano Chiappini
- Mario CarpentieriMCMario Carpentieri
- Hyunsoo YangHYHyunsoo Yang
- Massimo ChiappiniMCMassimo Chiappini
- Giovanni FinocchioGFGiovanni Finocchio
Open Access
- 25 August 2026
- journal article
- research article
- Published by Wiley in Advanced Intelligent Systems
- Vol. 8 (11) , e70521
Abstract
Probabilistic Ising machines (PIMs) based on probabilistic bits offer a hardware‐friendly route to solve combinatorial optimization problems, but most digital implementations achieve high throughput by exploiting sparse interactions. This limits their applicability to dense problems, for which memory bandwidth and data movement become the dominant bottlenecks. Here, we show a resource‐efficient pipelined field‐programmable gate array architecture enabling high‐throughput execution of fully‐connected PIMs while maintaining scalability and modularity. This architecture design combines a deeply pipelined (>20 stages) probabilistic bit‐update path, which overlaps spin evaluation and local‐field updates, with a bandwidth‐aware on‐chip memory organization for the coupling and bias matrices. The architecture supports 512 p‐bits with 16‐bit fixed‐point coefficients and 1024 and 2048 p‐bits with 10‐bit and 2‐bit coefficients, respectively, and operates at up to 300 MHz. At a fixed degree of parallelization, it delivers an order‐of‐magnitude higher update rate than an optimized nonpipelined baseline, while improving the time‐area trade‐off for dense workloads. Validation on portfolio optimization and low‐density parity‐check decoding shows close agreement with software references and substantial reductions in time‐to‐solution relative to the nonpipelined design, establishing pipelining as an effective route to scalable digital probabilistic computing for dense optimization problems.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Evaluating Spintronics-Compatible Implementations of Ising MachinesPhysical Review Applied, 2023
- Embedding Overhead Scaling of Optimization Problems in Quantum AnnealingPRX Quantum, 2021
- Entropic barriers as a reason for hardness in both classical and quantum algorithmsPhysical Review Research, 2021
- Performance Comparison of Typical Binary-Integer Encodings in an Ising MachineIEEE Access, 2021
- FPGA-Based Simulated Bifurcation Machine2019
- Binary optimization by momentum annealingPhysical Review E, 2019
- Application of Combinatorial Optimization in Logistics2018
- Quantum annealing with manufactured spinsNature, 2011
- A survey for the quadratic assignment problemEuropean Journal of Operational Research, 2007
- Quantum annealing in the transverse Ising modelPhysical Review E, 1998