skip to navigation
skip to content

minorminer 0.1.2.dev1

heuristic algorithm to find graph minor embeddings

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.

File Type Py Version Uploaded on Size
minorminer-0.1.2.dev1.tar.gz (md5) Source 2018-01-13 52KB