Embedding fully connected problem

What is the largest, fully connected problem that can be embedded on the Advantage System?  Where is this documented?

1 comment
• Hi Richard,

You can use the DWaveCliquesSampler's largest_clique_size property (mentioned here) to get the largest clique that can be embedded with even length chains on a given QPU solver.

Here's a code example:

`from dwave.system import DWaveCliqueSamplerclique_sampler = DWaveCliqueSampler(solver=dict(topology__type='pegasus'))print(clique_sampler.largest_clique_size)`

Please note, using the minorminer package, given long enough you might be able to embed larger fully connected problems than the number you receive by the above code example but the chain lengths will be non-uniform.