Proceedings Article10.1109/NANO.2017.8117327
A new computing architecture using Ising spin model implemented on FPGA for solving combinatorial optimization problems
Y. Kihara,Mitsuki Ito,Takanari Saito,M. Shiomura,S. Sakai,Jun-ichi Shirakashi +5 more
- 25 Jul 2017
- pp 256-258
13
TL;DR: A new computing architecture using Ising spin model was implemented using field-programmable gate array (FPGA), and Ising computing using FPGA was investigated to solve combinatorial optimization problems.
read more
Abstract: Recently, the new computing architecture using Ising spin model has been attracting considerable attention. It is well known that the Ising spin model represents the physical properties of ferromagnetic materials in terms of statistical mechanics. In this model, the spin states are varied in order to minimize the system energy automatically, by the interaction between connected adjacent spins. The new computing scheme maps combinatorial optimization problems based on Ising model and solves these problems by using ground state search operations exploiting its convergence property. In this report, a new computing architecture using Ising spin model was implemented using field-programmable gate array (FPGA), and Ising computing using FPGA was investigated to solve combinatorial optimization problems.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
TL;DR: Implementing SB with a field-programmable gate array, it is demonstrated that the SB machine can obtain good approximate solutions of an all-to-all connected 2000-node MAX-CUT problem in 0.5 ms, which is about 10 times faster than a state-of-the-art laser-based machine called a coherent Ising machine.
404
High-performance combinatorial optimization based on classical mechanics.
Hayato Goto,Kotaro Endo,Masaru Suzuki,Yoshisato Sakai,Taro Kanao,Yohei Hamakawa,Ryo Hidaka,Masaya Yamasaki,Kosuke Tatsumura +8 more
TL;DR: In this article, the authors proposed an algorithm based on classical mechanics, which is obtained by modifying a previously proposed algorithm called simulated bifurcation, to achieve not only high speed by parallel computing but also high solution accuracy for problems with up to one million binary variables.
131
Distance-based clustering using QUBO formulations
TL;DR: In this article , the authors proposed a hybrid algorithm using a low-latency Ising machine with a field-programmable gate array attached to a local server for clustering 200 unevenly distributed data points with a clustering score 18% higher than the simple method.
Agricultural labor market equilibrium based on FPGA platform and IoT communication
TL;DR: FPGA-based IoT (Internet of thing) systems are preferred as a source of communication in agricultural labor market equilibrium systems, for balancing marketability and flexibility in the economic sector.
16
Computational Properties of Ising Spin Model on Spin Connection Parameters
T. Miki,Mitsuki Ito,Yosuke Hirata,Yuki Kushitani,Moe Shimada,Jun-ichi Shirakashi +5 more
- 22 Jul 2019
TL;DR: This work investigated computational properties of Ising spin model with the various spin connection parameters through solving combinatorial optimization problems and found the architecture with fully connectable spins well suited for solving complex combinatorially optimization problems.
11
References
Human-level control through deep reinforcement learning
Volodymyr Mnih,Koray Kavukcuoglu,David Silver,Andrei Rusu,Joel Veness,Marc G. Bellemare,Alex Graves,Martin Riedmiller,Andreas K. Fidjeland,Georg Ostrovski,Stig Petersen,Charles Beattie,Amir Sadik,Ioannis Antonoglou,Helen King,Dharshan Kumaran,Daan Wierstra,Shane Legg,Demis Hassabis +18 more
TL;DR: This work bridges the divide between high-dimensional sensory inputs and actions, resulting in the first artificial agent that is capable of learning to excel at a diverse array of challenging tasks.
Mastering the game of Go with deep neural networks and tree search
David Silver,Aja Huang,Chris J. Maddison,Arthur Guez,Laurent Sifre,George van den Driessche,Julian Schrittwieser,Ioannis Antonoglou,Veda Panneershelvam,Marc Lanctot,Sander Dieleman,Dominik Grewe,John Nham,Nal Kalchbrenner,Ilya Sutskever,Timothy P. Lillicrap,Madeleine Leach,Koray Kavukcuoglu,Thore Graepel,Demis Hassabis +19 more
TL;DR: Using this search algorithm, the program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0.5, the first time that a computer program has defeated a human professional player in the full-sized game of Go.
A million spiking-neuron integrated circuit with a scalable communication network and interface
Paul A. Merolla,John V. Arthur,Rodrigo Alvarez-Icaza,Andrew S. Cassidy,Jun Sawada,Filipp Akopyan,Bryan L. Jackson,Nabil Imam,Chen Guo,Yutaka Nakamura,Bernard Brezzo,Ivan Vo,Steven K. Esser,Rathinakumar Appuswamy,Brian Taba,Arnon Amir,Myron D. Flickner,William P. Risk,Rajit Manohar,Dharmendra S. Modha +19 more
TL;DR: Inspired by the brain’s structure, an efficient, scalable, and flexible non–von Neumann architecture is developed that leverages contemporary silicon technology and is well suited to many applications that use complex neural networks in real time, for example, multiobject detection and classification.
4.2K
Quantum annealing with manufactured spins
Mark W. Johnson,M. H. S. Amin,Gildert Suzanne,Trevor Lanting,Firas Hamze,Neil G. Dickson,Richard Harris,Andrew J. Berkley,J. Johansson,Paul I. Bunyk,E. M. Chapple,C. Enderud,Jeremy P. Hilton,Kamran Karimi,E. Ladizinsky,N. Ladizinsky,T. Oh,I. Perminov,C. Rich,Murray C. Thom,E. Tolkacheva,C. J. S. Truncik,Sergey Uchaikin,J. Wang,B. Wilson,Geordie Rose +25 more
TL;DR: This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems.
2.1K
Optimization by Simulated Annealing: Quantitative Studies
TL;DR: Experimental studies of the simulated annealing method are presented and its computational efficiency when applied to graph partitioning and traveling salesman problems are presented.
2K
Related Papers (5)
Mark W. Johnson,M. H. S. Amin,Gildert Suzanne,Trevor Lanting,Firas Hamze,Neil G. Dickson,Richard Harris,Andrew J. Berkley,J. Johansson,Paul I. Bunyk,E. M. Chapple,C. Enderud,Jeremy P. Hilton,Kamran Karimi,E. Ladizinsky,N. Ladizinsky,T. Oh,I. Perminov,C. Rich,Murray C. Thom,E. Tolkacheva,C. J. S. Truncik,Sergey Uchaikin,J. Wang,B. Wilson,Geordie Rose +25 more