Theory of Ising Machines and a Common Software Platform for Ising Machines
Shu Tanaka, Yoshiki Matsuda, Nozomu Togawa
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.
Topics & Concepts
Ising modelQuadratic unconstrained binary optimizationSquare-lattice Ising modelComputer scienceSoftwareBinary numberQuadratic equationStatistical physicsMathematicsPhysicsQuantum computerQuantum mechanicsQuantumArithmeticGeometryProgramming languageQuantum Computing Algorithms and ArchitectureComputability, Logic, AI AlgorithmsCellular Automata and Applications