SpoonQ is a language to describe problems and solve them on quantum annealer. Japanese

• Commands
• Operators

The following examples are of old version of SpoonQ.

• Number Partitioning
• Graph Partitioning
• Cliques - pending
• Binary Integer Linear Programming - pending
• Exact Cover - pending
• Set Packing
• Vertex Cover
• Minimal Maximal Matching
• Set Cover - pending
• Knapsack with Integer Weights - pending
• Graph Coloring
• Clique Cover - pending
• Job Sequencing - pending
• Hamilton Cycles and Paths
• Travelling Salesman

These problems can be found on Lucas A (2014) Ising formulations of many NP problems. Front. Physics 2:5. doi: 10.3389/fphy.2014.00005

This project is supported by Mitou-Target program of INFORMATION-TECHNOLOGY PROMOTION AGENCY, JAPAN