Theory of Ising Machines and a Common Software Platform for Ising Machines
Authors:
- 1 January 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 659-666
Abstract
Ising machines are a new type of non-Neumann computer that specializes in solving combinatorial optimization problems efficiently. The input form of Ising machines is the energy function of the Ising model or quadratic unconstrained binary optimization form, and Ising machines operate to search for a condition to minimize the energy function. We describe the theory of Ising machines and the present status of the Ising machines, software for Ising machines, and applications using Ising machines.Keywords
This publication has 32 references indexed in Scilit:
- Ising formulations of many NP problemsFrontiers in Physics, 2014
- Quantum annealing for Dirichlet process mixture models with applications to network clusteringNeurocomputing, 2013
- Quantum annealing with manufactured spinsNature, 2011
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph designQuantum Information Processing, 2010
- Nonmonotonic dynamics in a frustrated Ising model with time-dependent transverse fieldPhysical Review E, 2010
- Quantum response to time-dependent external fieldsJournal of Physics: Conference Series, 2009
- Minor-embedding in adiabatic quantum computation: I. The parameter setting problemQuantum Information Processing, 2008
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001
- Quantum annealing in the transverse Ising modelPhysical Review E, 1998
- Optimization by Simulated AnnealingScience, 1983