Ising machines outperform every tested Potts machine on Max-k-Cut problems, with the performance gap widening from k=3 to k=4.
Self-entrainment of a population of coupled non-linear oscillators
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
dataset 1
citation-polarity summary
years
2026 3representative citing papers
Deep-Koopman-KANDy recovers symbolic Koopman dictionaries post-training by replacing the encoder and decoder with KANs and applying a level-set construction with chain-rule gradients, achieving high recall on Lorenz and expected behavior on other maps.
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
-
Comparative Study of Potts Machine Dynamics and Performance for Max-k-Cut
Ising machines outperform every tested Potts machine on Max-k-Cut problems, with the performance gap widening from k=3 to k=4.
-
Deep-Koopman-KANDy: Dictionary Discovery for Deep-Koopman Operators with Kolmogorov-Arnold Networks for Dynamics
Deep-Koopman-KANDy recovers symbolic Koopman dictionaries post-training by replacing the encoder and decoder with KANs and applying a level-set construction with chain-rule gradients, achieving high recall on Lorenz and expected behavior on other maps.
-
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.