Abstract: The inconsistency determination device 1 includes inconsistency determination means 9. The inconsistency determination means 9 determines whether or not there is inconsistency in an expression, which is to be converted into an energy function of a model representing states of individual spins by a first value or a second value, representing energy in a combinatorial optimization problem.

Abstract: The feature information derivation means 72 derives feature information that represents a feature of a model used to solve a combinatorial optimization problem, when the model is given. The solution method selection means 73 selects a solution method for the combinatorial optimization problem from among predetermined multiple types of solution methods based on the feature information. The solution request means 74 send a solution request that includes information that can specify the model used to solve the combinatorial optimization problem to a solution device that solves the combinatorial optimization problem using the selected solution method.

Abstract: An information processing device that compares a data amount of a QUBO model to be processed by an annealing engine and a data amount of a program representing the QUBO model, and that transmits whichever has a lower data amount to the annealing engine.

Abstract: The conversion means 72 generates a program for deriving a QUBO matrix that is a matrix that defines an energy function of QUBO, by converting a description of a natural language representing a combinatorial optimization problem into a description of the program for deriving the QUBO matrix. It is possible to generate a program for deriving a QUBO matrix based on a description of a natural language representing a combinatorial optimization problem.

Abstract: An optimization device includes a determination unit which determines weights for a plurality of constraint conditions imposed on a combinatorial optimization problem, respectively, and a generation unit which generates an energy function for the combinatorial optimization problem using a constant that is a sum of a constant used in formulation of an energy to be optimized in the combinatorial optimization problem and a sum over the plurality of constraint conditions of a constant used in formulation of an energy of one constraint condition multiplied by a weight determined for the one constraint condition.

Abstract: The difference matrix calculation means 72 calculates a difference matrix which is a difference between a first matrix representing a combinatorial optimization problem for which a solution was found last time and a second matrix representing the latest combinatorial optimization problem. The difference matrix compression means 73 compresses the difference matrix. The transmission means 74 transmits the difference matrix after compression to a combinatorial optimization problem solution device that finds a solution to the combinatorial optimization problem.

Abstract: A state output system includes a solving unit which executes a solving process for solving a combinatorial optimization problem by a simulated annealing method, an acquiring unit which acquires data indicating states of the solving process in execution from the solving unit, and an outputting unit which outputs the acquired data during the execution of the solving process.

Abstract: A solution accuracy guaranteeing annealing calculation device includes a first solving unit which solves a combinatorial optimization problem by an annealing method, and a second solving unit which solves a relaxation problem, which is a problem generated by relaxing constraints imposed on the combinatorial optimization problem, wherein the second solving unit calculates, if the combinatorial optimization problem is a minimization problem, a lower bound of a minimization target in the minimization problem by solving the relaxation problem generated from the combinatorial optimization problem, and calculates, if the combinatorial optimization problem is a maximization problem, an upper bound of a maximization target in the maximization problem by solving the relaxation problem generated from the combinatorial optimization problem.

Abstract: The term generation means 73 generates a term, when a solution to a combinatorial optimization problem, an energy function, which is used to obtain the solution, of a model representing states of individual spins by a first value or a second value, and a pair of identification information of spin and degree of wish to change which indicates degree to which an user wishes to change state of spin corresponding to the identification information in the solution are given, wherein the term is generated for each pair of the identification information and the degree of wish to change, based on the state of spin corresponding to the identification information in the solution and the degree of wish to change. The energy function derivation means 74 deriving a new energy function by adding terms generated by the term generation means 73 for each pair to the energy function.