A p-dit probabilistic Ising machine reaches best-known QAP solutions on 95% of QAPLIB instances (vs 36% for Gurobi) with 2-3 orders of magnitude faster time-to-quality on the largest case.
A Full -Stack View of Probabilistic Computing With p -Bits: Devices, Architectures, and Algorithms
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Ising machine probabilistic computing achieves optimal ML detection for XL-MIMO up to 2048x2048 antennas in 100 iterations and extends to 256-QAM via p-dits while matching or beating MMSE.
citing papers explorer
-
P-dit Probabilistic Ising Machine for Solving the Quadratic Assignment Problem
A p-dit probabilistic Ising machine reaches best-known QAP solutions on 95% of QAPLIB instances (vs 36% for Gurobi) with 2-3 orders of magnitude faster time-to-quality on the largest case.
-
Physics-Inspired Probabilistic Computing for Extremely Large-Scale MIMO Detection in Future 6G Wireless Systems
Ising machine probabilistic computing achieves optimal ML detection for XL-MIMO up to 2048x2048 antennas in 100 iterations and extends to 256-QAM via p-dits while matching or beating MMSE.