Ising machines outperform every tested Potts machine on Max-k-Cut problems, with the performance gap widening from k=3 to k=4.
Energy land- scapes of combinatorial optimization in Ising machines.Physical Review E, 110(4):045308
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
Simulations predict that a virtually connected photonic probabilistic computer solves Erdos-Renyi graph spin-glass ground states orders of magnitude faster than digital annealing units by avoiding embedding and sparsification.
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.
-
A virtually connected probabilistic computer as a solver for higher-order, densely connected, or reconfigurable combinatorial optimisation problems
Simulations predict that a virtually connected photonic probabilistic computer solves Erdos-Renyi graph spin-glass ground states orders of magnitude faster than digital annealing units by avoiding embedding and sparsification.