Using the QPU#
Guidance and best practices for QPU usage.
Example#
The following code solves the known “minimum vertex cover” graph problem using an annealing quantum computer.
>>> import networkx as nx
>>> import dwave_networkx as dnx
>>> from dwave.system import DWaveSampler, EmbeddingComposite
...
>>> s5 = nx.star_graph(4)
>>> sampler = EmbeddingComposite(DWaveSampler())
>>> min_cover = dnx.min_vertex_cover(s5, sampler)