https://www.toshiba.co.jp/rdc/rd/detail_e/e1904_01.html?from=RSS_PRESS&uid=20190420-6062e
The newly developed technique, the Simulated Bifurcation Algorithm, quickly obtains highly accurate approximate solutions (good solutions) for complex large-scale combinatorial optimization problems─problems that have resisted solution for a long time, and that are very difficult to solve using conventional techniques. Potentially even more important, the algorithm also realizes excellent scalability at a low cost using current computers, which could revolutionize current optimization processes.
For example, by using field-programmable gate arrays (FPGAs), a good solution to an optimization problem with 2,000 fully connected variables (approximately 2 million connections) can be obtained in just 0.5 milliseconds. This is approximately 10 times faster than the laser-based quantum computer recognized as the world’s fastest can solve the same problem.