SpoonQ is a SAT problem solver using anneling machine.

Screenshots

Slides

SpoonQ is a domain-specific language to describe COP (Constraint Optimization Problem) and software toolkit to solve COP problems using (Quantum) Annealing.

Annealing is a new approach introduced by Hidetoshi Nishimori in 1998, to solve optimize problems in Ising machine1.

There are many researches to solve CSP or COP problems by annealing, but it is hard for end users because of following complex procedures:

1. Formulate the problems to solve.
2. Convert the formulated problem to optimization form.
3. Convert the optimization formulation to Ising problem.
4. Decide the paramaters for constraints and generate QUBO.
5. Solve the QUBO using annealing machine.
6. Check the outputs of annealing machine if all the constraints is satisfied.
7. If not satisfied, re-configure paramaters and re-run annealing.

The SpoonQ project enable the first-look users solving their problems using annealing machine.

Screenshots

Slides

Publications

• 小津泰生, アニーリングマシン向けプログラミング言語, QIT41, 2019
• 小津泰生, アニーリングマシン向けプログラミング言語, 第82回情報処理学会, 2019