.. _qpu_index_examples_beginner: ================== Basic QPU Examples ================== .. toctree:: :maxdepth: 1 :hidden: example_sat_unconstrained example_sat_constrained example_min_vertex example_not example_and example_multigate example_scheduling example_mapcoloring .. grid:: 3 :gutter: 2 .. grid-item-card:: :ref:`qpu_example_sat_unconstrained` :link: qpu_example_sat_unconstrained :link-type: ref Describes the mathematical formulation of an objective function for a simple, *unconstrained* problem. .. grid-item-card:: :ref:`qpu_example_sat_constrained` :link: qpu_example_sat_constrained :link-type: ref Describes the end-to-end process of solving a simple, constrained problem on a quantum computer. .. grid-item-card:: :ref:`qpu_example_min_vertex` :link: qpu_example_min_vertex :link-type: ref Submits to a quantum computer a common graph problem formulated with Ocean software. .. grid-item-card:: :ref:`qpu_example_not` :link: qpu_example_not :link-type: ref Mathematically formulates a simple QUBO. .. grid-item-card:: :ref:`qpu_example_and` :link: qpu_example_and :link-type: ref Explains and demonstrates minor embedding on the QPU using chains. .. grid-item-card:: :ref:`qpu_example_multigate` :link: qpu_example_multigate :link-type: ref Looks at various minor-embedding techniques and results. .. grid-item-card:: :ref:`qpu_example_scheduling` :link: qpu_example_scheduling :link-type: ref Solves a small constraint satisfaction problem formulated with penalties. .. grid-item-card:: :ref:`qpu_example_mapcoloring` :link: qpu_example_mapcoloring :link-type: ref Solves a more complex constraint satisfaction problem by formulating penalties. Additional Examples =================== For additional and more advanced examples, see the :ref:`qpu_index_examples_advanced` section.