A 2048-spin bulk acoustic wave Ising machine for number partitioning and Sudoku
31 points
3 days ago
| 4 comments
| arxiv.org
| HN
shoo
37 minutes ago
[-]
The paper could be improved by including a strong classical non-Ising-machine solution approach as one of the methods benchmarked against.

E.g. take the same 8-core Ryzen machine they use to implement their simulated Ising Machine HbSB method & use it to run a standard classical solver as would be done industrially to tackle these kinds of problems outside of academia - perhaps an industrial grade commercial MIP solver (Gurobi) for those problem classes that are known to have reasonable MIP formulations, or a good constraint solver for Sudoku, etc.

Depending on how hard the specific test problem instances are, perhaps a commercial MIP solver would be able to solve some of these problems optimally & instantly using its black box of presolve witchcraft tricks.

reply
semireg
40 minutes ago
[-]
Kind of like the “uncooked spaghetti length” sorting algorithm: gravity. Hold them in your fist vertically, let them gently fall to a flat surface. Sorted.
reply
BretonForearm
37 minutes ago
[-]
Spaghetti length is made visible (quickly comparable), but it's still not sorted.
reply
muti
20 minutes ago
[-]
The abstract reads like copy for the Turbo encabulator
reply
thisisauserid
2 hours ago
[-]
tl;dr:

A new, stable computer uses sound waves to solve really hard puzzles.

Not the game 2048. But yes, the game Sodoku.

reply