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.
Solving combinatorial optimisation problems using oscillator based Ising machines
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Presents weight-discretized quotient abstractions and CogSpike tool enabling formal verification of probabilistic SNNs via exponential state-space reduction and two correctness theorems.
citing papers explorer
-
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.
-
A Formal Tool for Verification of Probabilistic Spiking Neural Networks Based on Quotient Abstractions
Presents weight-discretized quotient abstractions and CogSpike tool enabling formal verification of probabilistic SNNs via exponential state-space reduction and two correctness theorems.