Home

Welcome to the sqaod wiki!

Beta2 has been released (Jul 1th, 2018).

For beta2 updates, please visit the 'Release history' page.

Algorithm

Currently 2 algorithms have been implemented.

• Brute-force searcher
  Carrying out brute-force search for every combination of bits to get a strict solution for a given QUBO.
• Simulated quantum annealing.
  Carrying out simulated quantum annealing to get a solution of a given QUBO.

Graph structure

Solvers are provided for 2 graph types. Graph-specific optimizations are applied to each solver.

• Dense graph
  
• Bipartite graph
  

Python

All solvers are callable from python 2.7 and python 3.3 or later.

Implementation

Implementations are available for language/devices shown in the table below:

language	python package	description
python	sqaod.py	Provided to show agorithm.
CPU	sqaod.cpu	CPU-based solvers, parallelized and accelerated by OpenMP.
CUDA	sqaod.cuda	GPU solvers, parallelized and accelerated by CUDA.

Examples

Please visit example directory. The 4 examples are provided.

File name	graph	algorithm
dense_graph_annealer.py	dense graph	simulated quantum annealing
bipartite_graph_annealer.py	bipartite graph	simulated quantum annealing
dense_graph_bf_searcher.py	dense graph	brute-force searcher
bipartite_graph_bf_searcher.py	bipartite graph	brute-force searcher