Skip to main content

heuristic algorithm to find graph minor embeddings

Project description

minorminer is a tool for finding graph minors, developed to embed Ising problems onto quantum annealers (QA). Where it can be used to find minors in arbitrary graphs, it is particularly geared towards the state of the art in QA: problem graphs of a few to a few hundred variables, and hardware graphs of a few thousand qubits.

Project details

Download files

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

Source Distribution

minorminer-0.2.12.tar.gz (512.9 kB view hashes)

Uploaded source

Built Distributions

minorminer-0.2.12-cp311-cp311-win_amd64.whl (960.3 kB view hashes)

Uploaded cp311

minorminer-0.2.12-cp310-cp310-win_amd64.whl (962.0 kB view hashes)

Uploaded cp310

minorminer-0.2.12-cp39-cp39-win_amd64.whl (967.9 kB view hashes)

Uploaded cp39

minorminer-0.2.12-cp38-cp38-win_amd64.whl (968.5 kB view hashes)

Uploaded cp38

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page