Using the QPU

Guidance and best practices for QPU usage.

Formulation

Formulating problems for the quantum computer.

Formulation

Decomposing Large Problems

Guidance on large-problem decomposition.

Decomposing Large Problems

Minor-Embedding: Best Practices

Considerations for minor embedding.

Minor-Embedding: Best Practices

QPU Solver Parameters

Parameters of the QPU solver.

QPU Solver Parameters

QPU Configuration: Best Practices

Ways to improve solutions on QPU solvers.

QPU Configuration: Best Practices

Postprocessing

Overview of some postprocessing methods.

Postprocessing

QPU Usage Examples

Errors sources and correction.

QPU Usage Examples

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)