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 DWaveCliqueSampler clique_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.
Comments
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:
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.
Here are some additional helpful resources:
I hope this helps! Please let me know if you have any other questions.
Please sign in to leave a comment.