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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AR 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
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.