Annealing Algorithm Initial State via Eigenvector Calculation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing annealing algorithms for solving Ising model problems often start with randomly set initial states, leading to reduced accuracy in finding the ground state, as these initial states may be far from the optimal solution.

Innovation Solution

An information processing apparatus and method that calculates at least one eigenvector of a coupling coefficient matrix to determine an initial state for the annealing algorithm, improving the accuracy of solving Ising model problems by setting a more optimal initial state based on the eigenvector.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If the initial state is set randomly using random numbers, then the simplicity of the method is maintained, but the accuracy of solving the problem deteriorates because the initial state may be far from the ground state

Engineering Contradiction:
Improveaccuracy of solving problemVSAvoidcomplexity of initial state determination
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by calculating the eigenvector of the coupling coefficient matrix before executing the annealing algorithm. This preprocessing step determines an optimal initial state based on the problem's coupling coefficients, ensuring the annealing process starts from a more favorable state that is closer to the ground state, thereby improving solution accuracy without adding significant operational complexity during the annealing process itself

Inventive Principle:
Principle #10Preliminary action

2Productivity

If the initial state is set far from the ground state, then the annealing algorithm can explore more states, but the time required to converge to the ground state increases

Engineering Contradiction:
Improveconvergence speed of annealing algorithmVSAvoidtime required to reach ground state
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

By performing eigenvector calculation as a preliminary step, the system determines an initial state that is strategically positioned closer to the ground state. This reduces the number of annealing iterations required to converge, thereby improving productivity while minimizing time loss compared to random initialization that requires extensive exploration

Inventive Principle:
Principle #10Preliminary action

3Reliability

If a simple random initial state is used, then the ease of operation is maintained, but the reliability of obtaining an accurate solution decreases

Engineering Contradiction:
Improvereliability of obtaining accurate solutionVSAvoidsimplicity of initial state setup
Core Design Contradiction:
ReliabilityVSEase of operation

Solution Approach 1:

The eigenvector calculation is performed automatically as a preliminary computational step before the annealing process. This maintains ease of operation from the user perspective while significantly improving reliability by ensuring the initial state is optimally determined based on the problem's coupling coefficient matrix, leading to more reliable convergence to accurate solutions

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS11853658B2Information processing apparatus, information processing method, and non-transitory computer readable medium
Publication Date: 2023.12.26 NEC CORP
  • US11853658B2 patent drawing
  • US11853658B2 patent drawing
  • US11853658B2 patent drawing

AI summary

The present disclosure provides an information processing apparatus capable of improving the accuracy of solving a problem when an annealing algorithm is executed. An information processing apparatus 1 includes a calculation unit 2 and an arithmetic unit 4. The calculation unit 2 calculates at least one eigenvector of a coupling coefficient matrix including a coupling coefficient indicating a strength of interaction between each of a plurality of binary variables that indicate states of a plurality of respective spins in an Ising model, the coupling coefficient matrix being given in advance in accordance with a problem to be solved by an annealing algorithm. The arithmetic unit 4 executes the annealing algorithm from an initial state set based on the at least one eigenvector.