search

dwavesystems / qbsolv

Qbsolv,a decomposing solver, finds a minimum value of a large quadratic unconstrained binary optimization (QUBO) problem by splitting it into pieces solved either via a D-Wave system or a classical tabu solver. (Note that qbsolv by default uses its internal classical solver. Access to a D-Wave system must be arranged separately.)
https://docs.ocean.dwavesys.com/projects/qbsolv
Apache License 2.0
911 stars 229 forks source link

Document DWaveSampler use #139

Open randomir opened 5 years ago

randomir commented 5 years ago

Motivated by #138, #134 and #135:

Add an example of QBSolv use with EmbeddingComposite(DWaveSampler()) for subproblems solver. The example could go under the Introduction section and/or the QBSolv.sample() section.

arcondello commented 5 years ago

The EmbeddingComposite should not be used by QBSolv, the FixedEmbeddingComposite is preferred. See https://github.com/dwavesystems/qbsolv/blob/1e38d78aaa8ab5b80abe4e5b64c27620b8b8c0e5/examples/useFixedEmbeddingComposite.py#L1 That example should be updated to use find_clique_embedding in dwave-system and it should be referenced more prominently.

ioannist commented 3 years ago

Trying to wrap my head around this example...You are using a complete graph for the subproblem so that it can represent any problem. Is that realistic or efficient in production? Is this the only way to split the problem?