Patent ID: 11966450
Assignee: KABUSHIKI KAISHA TOSHIBA
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 17:
18. The device according to claim 15, wherein
the combinatorial optimization problem is a quadratic unconstrained binary optimization (QUBO) problem, and
the updating circuit is configured to calculate the second variable of the ith element at the target time by Equation (103) or Equation (104),

yi(t+Δt)=yi(t)+[{−D+p(t+Δt)}xi(t+Δt)+fi(t+Δt)]Δt  (103)

yi(t+Δt)=yi(t)+[{−D+p(t)}xi(t)+fi(t)]Δt  (104)

where
fi(t+Δt) is given by Equation (111),
fi(t) is given by Equation (112),

fi(t+Δt)=−g(t+Δt)sgn[zi(t+Δt)]  (111)

fi(t)=−g(t)sgn[zi(t)]  (112)

where
g(t+Δt) is given by Equation (113), and g(t) is given by Equation (114),

g(t+Δt)={D−p(t+Δt)}√{square root over (p(t+Δt))}  (113)

g(t)={D−p(t)}√{square root over (p(t))}  (114)

where
sgn(zi(t+Δt)) denotes a sign of zi(t+Δt),
sgn(zi(t)) denotes a sign of zi(t),
zi(t+Δt) is given by Equation (115), and
zi(t) is given by Equation (116),, z
       i
      
      (
      
       t
       +
       
        Δ
        ⁢
        t
       
      
      )
     
     =
     
      
       
        -
        
         h
         i
        
       
       ⁢
       
        α
        ⁡
        (
        
         t
         +
         
          Δ
          ⁢
          t
         
        
        )
       
      
      -
      
       
        ∑
        
         j
         =
         1
        
        N
       
        
       
        
         J
         
          i
          ,
          j
         
        
        ⁢
        
         
          x
          j
         
         (
         
          t
          +
          
           Δ
           ⁢
           t
          
         
         )
        
       
      
     
    
   
   
    
     (
     115
     )
    
   
  
 

 
  
   
    
     
      
       z
       i
      
      (
      t
      )
     
     =
     
      
       
        -
        
         h
         i
        
       
       ⁢
       
        α
        ⁡
        (
        t
        )
       
      
      -
      
       
        ∑
        
         j
         =
         1
        
        N
       
        
       
        
         J
         
          i
          ,
          j
         
        
        ⁢
        
         
          
           x
           j
          
          (
          t
          )
         
         .
        
       
      
     
    
   
   
    
     (
     116
     )
    
   
  
 

where
j is any integer from 1 to N,
hi is an ith local magnetic field coefficient included in a predetermined array including N local magnetic field coefficients,
Ji,j is a coupling coefficient at an ith row and a jth column included in a predetermined matrix including N×N coupling coefficients,
xj(t) is the first variable at the previous time for a jth element corresponding to a jth discrete variable among the N discrete variables,
xj(t+Δt) is the first variable of the jth element at the target time,
p(t) is a predetermined function with t as a variable, in which p(t) increases as t increases, becomes 0 with t at the initial time, and becomes 1 with t at the end time, and
α(t) is a predetermined function with t as a variable.