A coherent Ising machine for 2000-node optimization problems
Citations Over TimeTop 1% of 2016 papers
Abstract
The analysis and optimization of complex systems can be reduced to mathematical problems collectively known as 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 2000-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 2000 nodes. Our coherent Ising machine outperformed simulated annealing in terms of accuracy and computation time for a 2000-node complete graph.
Related Papers
- → Cluster-exact approximation of spin glass groundstates(1996)45 cited
- → Phase transitions in spin-one Ising systems(1966)23 cited
- → Special purpose computer system for Ising models(1988)18 cited
- → Spreading of 'damage' in a three-dimensional Ising model(1987)78 cited
- → Ising system bounds for arbitrary spin(1974)