Skip to main content

A collection of solvers for simulated quantum annealing.

Project description

Sqaod is a collection of sovlers for simulated quantum annealing, providing a high-performant and stable implementation to simulate quantum annealing.

This package is intended for researchers and engineers to explore various problems on qunatum computing with conventional workstations and servers. Sqaod is also available for deployment in commercial usecases. Please visit sqaod website and sqaod wiki at github for details.

Features

  • Solving annealing problems with simple mathmatical definitions.

    Sqaod is capable to deal with two graphs of dense graph and bipartite graph. These graphs have simple mathmatical representations, and directly solved without any modifications.

    • Dense graph is the most generic form of QUBO, and utilized for problems such as TSP.
    • Bipartite graph is for problems that have input and output nodes in graph. An example is RBM.
  • Two solver algorithm, brute-force search and monte-carlo-based simulated quantum annealer are implemented.

    • Monte-carlo based simulated quantum annealer is to get approximated solutions for problems with larger number of bits.|br| One can solve problems with thousands of bits for dense graph and bipartite graph with simulated quantum anneaers.
    • Brute-force search is for getting strict solutions for problems with smaller number of bits. With brute-force solvers, strict solutions for 30-bit Problem are able to be obtained within tens of seconds when high-end GPUs are utilized.
  • Acceerated on CPU and GPU.

    Sqaod solvers have C++- and CUDA-based backends for acceleration.

    • Multi-core CPUs with OpenMP are utilized for CPU-based solvers.
    • NVIDIA GPUs by using CUDA are utilized for GPU-based solvers.
  • Able to solve problems with large number of bits.

    Since sqaod is a pure software implementation, solvers are able to deal with problems with a large number of bits.

    Problem sizes are limited by memory amount and/or calculation time. On recent workstations and servers large amount of DRAM are available, and performance of Sqaod is excellent since it’s optimized with modern computing devices.

Development plan

Current version is Beta1, ver 0.2.0b0.

  • Python interfaces are fixed, and most functionalities are tested.
  • Remaining works are optimizations and documentation, which are going to be made by Beta2 planned in the end of June.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for sqaod, version 0.3.0
Filename, size File type Python version Upload date Hashes
Filename, size sqaod-0.3.0-cp27-cp27mu-manylinux1_x86_64.whl (1.0 MB) File type Wheel Python version cp27 Upload date Hashes View hashes
Filename, size sqaod-0.3.0-cp35-cp35m-manylinux1_x86_64.whl (1.0 MB) File type Wheel Python version cp35 Upload date Hashes View hashes

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN SignalFx SignalFx Supporter DigiCert DigiCert EV certificate StatusPage StatusPage Status page