Report

A coherent Ising machine for 2000-node optimization problems

See allHide authors and affiliations

Science  20 Oct 2016:
aah4243
DOI: 10.1126/science.aah4243

You are currently viewing the abstract.

View Full Text

Abstract

The analysis and optimization of complex systems can be reduced to mathematical problems called combinatorial optimization. Many such problems can be mapped onto ground-state-search problems of the Ising model, and various artificial spin systems are now emerging as promising approaches. However, physical Ising machines have suffered from limited numbers of spin-spin couplings because of implementations based on localized spins, resulting in severe scalability problems. We report a 2,000-spin network with all-to-all spin-spin couplings. Using a measurement and feedback scheme, we coupled time-multiplexed degenerate optical parametric oscillators to implement maximum cut problems on arbitrary graph topologies with up to 2,000 nodes. Our coherent Ising machine could outperform simulated annealing in terms of accuracy and computation time for a 2,000-node complete graph.

View Full Text