Classical Machines, for Solving the Toughest Problems in Computer Science

Eli Yablonovitch, T. Patrick Xiao, Sri Krishna Vadlamani · 2019

Classical analog processors are now solving hard Computer Science problems that were thought to require a Quantum Computer. There are now classical machines that solve Ising type optimizations, opening the door toward other NP-hard problems as well.

Read the paper · More papers on PaperTik