Ising Machine Auxiliary Variable Initialization for Faster Ground-State Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current systems solving combinatorial optimization problems, such as the Ising problem, face inefficiencies in information transmission and processing time between host units and Ising machines, hindering the speed and accuracy of finding ground states in Ising models.
Innovation Solution
An information processing system comprising an Ising machine and a host unit that alternately updates main and auxiliary variables to efficiently search for the ground state of Ising models, utilizing a simulated bifurcation method and reconfigurable hardware to optimize the search process, allowing for faster and more accurate solutions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the host unit transmits the J matrix and h vector to the Ising machine and receives optimized Ising spin values, then the combinatorial optimization problem can be solved, but the information transmission and processing time between host unit and Ising machine increases
Solution Approach 1:
The patent segments the optimization process into two distinct parts: the host unit handles problem formulation and parameter transmission, while the Ising machine performs the actual ground state search and optimization. This segmentation allows each component to specialize in its optimal function, reducing overall processing time while maintaining solution accuracy.
Solution Approach 2:
The patent introduces an interface unit that acts as an intermediary between the host unit and the Ising machine. This interface efficiently manages data transmission, converting and transferring the J matrix and h vector parameters while receiving optimized Ising spin values, thereby minimizing communication overhead and processing time.
2Reliability
If the Ising machine performs a search process for the ground state of the Ising model, then the combinatorial optimization problem can be solved, but the time from start of calculation to output of solution increases
Solution Approach 1:
The patent replaces traditional mechanical or sequential computational methods with a physical Ising machine system that utilizes quantum or thermal effects to perform the ground state search. This substitution enables parallel processing of multiple spin configurations simultaneously, dramatically reducing calculation time while maintaining the ability to find accurate ground states.
Solution Approach 2:
The patent changes the operational parameters of the Ising machine by allowing dynamic adjustment of the J matrix and h vector parameters from the host unit. This enables the system to adapt to different optimization problems and converge faster to solutions by optimizing the energy landscape parameters.
Data Source
AI summary
According to an embodiment, an information processing system solves a combinatorial optimization problem. The information processing system includes an Ising machine and a host unit. The Ising machine is hardware configured to perform a search process for searching for the ground state of an Ising model that represents the combinatorial optimization problem. The host unit is hardware connected to the Ising machine via an interface and configured to control the Ising machine. In the search process, for each of a plurality of Ising spins, the Ising machine alternately repeats an auxiliary variable update process for updating an auxiliary variable by a main variable and a main variable update process for updating the main variable by the auxiliary variable multiple times. Prior to the search process, the host unit transmits, to the Ising machine, an initial value of the auxiliary variable corresponding to each of the plurality of Ising spins.