Constrained Binary Quadratic Optimization via Bipartite Graph Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for constrained binary quadratic optimization are inefficient due to the difficulty in processing large-scale problems within practical time, as they require sequential state updates to satisfy constraints, which slows down Markov chain Monte Carlo and simulated annealing processes.
Innovation Solution
The method converts a binary quadratic model with constraints into a complete bipartite graph structure, allowing variables to be updated in parallel while satisfying constraints, using an information processing device with an arithmetic unit that manages interaction and bias coefficients to calculate next states efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If sequential state updates are performed to satisfy constraints in constrained binary quadratic optimization, then constraint satisfaction is ensured, but processing time increases significantly
Solution Approach 1:
The patent divides variables into two separate groups (first variable group and second variable group) and performs state updates for each group in parallel. This segmentation allows the system to maintain constraint satisfaction while eliminating sequential processing bottlenecks, directly resolving the contradiction between reliability and time loss.
Solution Approach 2:
The patent transforms the constrained binary quadratic optimization problem into a complete bipartite graph structure, adding a dimensional aspect to the problem representation. This transformation enables parallel processing of state updates while maintaining constraint relationships, thereby reducing processing time without sacrificing constraint satisfaction.
2Productivity
If parallel state updates are performed to speed up processing, then processing efficiency improves, but constraint satisfaction becomes difficult to maintain
Solution Approach 1:
By segmenting variables into two distinct groups that can be updated in parallel, the patent enables simultaneous processing while maintaining constraint satisfaction. The segmentation ensures that constraints are preserved within each group during parallel updates, resolving the contradiction between productivity and reliability.
3Measurement precision
If conventional Markov chain Monte Carlo methods are used for constrained optimization, then solution accuracy is maintained, but computational complexity increases for large-scale problems
Solution Approach 1:
The patent introduces a bipartite graph structure as an additional dimensional framework for representing the optimization problem. This transformation reduces computational complexity by enabling parallel processing while maintaining the accuracy of solution search through preserved constraint relationships, effectively resolving the contradiction between measurement precision and device complexity.
Data Source
AI summary
Provided are an optimization method, an information processing device, and an information processing system capable of efficiently performing a ground state search of a constrained binary quadratic model. The information processing device performs the ground state search for the constrained binary quadratic model by substituting the ground state search for the binary quadratic model in which the interaction relationship between variables has a complete bipartite graph structure. Here, this information processing device divides the variable group corresponding to the vertex set divided into two in the complete bipartite graph into a group capable of updating the state in which the constraint is satisfied. Then, this information processing device can update the group of each variable group in parallel based on the information of the energy function and the variable, and execute the process of searching the ground state.