Summary

In this chapter, we have run through a lot of material to understand how to solve problems on a quantum annealer such as D-Wave. We solved several simple problems to get a flavor of how to think about solving real-world optimization problems. We started with a simple three-node graph problem and then expanded that to a party optimization problem. Finally, we went over some critical steps in solving QUBO problems using a team selection example. We progressed through the example in three steps and utilized a visualization tool for the QUBO energy landscape, and also learned how to add a simple constraint on the number of variables in the solution. Then, we reviewed and compared solutions through the traditional method, the probabilistic sampler, the simulated annealer, and the D-Wave Advantage system.

In the next chapter, we will switch gears and return to gate quantum computing devices. We will start discussing qubits and their properties and show the basics of solving simple...