Small edits

Author: JoelPasvolsky

Diff for: docs/industrial_optimization/index_examples_advanced.rst

@@ -44,22 +44,21 @@ These examples use the |cloud| service's :term:`quadratic model` solvers.
         :link: opt_example_bqm_structuralimbalance
         :link-type: ref
 
-        Solves an unconstrained problem using the |cloud| service's hybrid
-        :term:`BQM` solver.
+        Solves an unconstrained problem using the |cloud| service's hybrid BQM
+        solver.
 
     .. grid-item-card:: :ref:`opt_example_dqm_map`
         :link: opt_example_dqm_map
         :link-type: ref
 
-        Solves a discrete quadratic model (:term:`DQM`) using the Leap service's
-        hybrid DQM solver.
+        Solves a discrete quadratic model (DQM) using the Leap service's hybrid
+        DQM solver.
 
     .. grid-item-card:: :ref:`opt_example_kerberos_map`
         :link: opt_example_kerberos_map
         :link-type: ref
 
-        Demonstrates using a :ref:`dwave-hybrid <index_hybrid>` out-of-the-box
-        hybrid solver.
+        Demonstrates using a *dwave-hybrid* out-of-the-box hybrid solver.
 
     .. grid-item-card:: :ref:`opt_example_dwavehybrid_workflow`
         :link: opt_example_dwavehybrid_workflow

Diff for: docs/industrial_optimization/index_examples_beginner.rst

@@ -48,7 +48,7 @@ These examples use the |cloud| service's :term:`quadratic model` solvers.
         :link-type: ref
 
         Solves a constrained problem with binary variables using the
-        |cloud| service's :term:`CQM` solver.
+        |cloud| service's CQM solver.
 
     .. grid-item-card:: :ref:`opt_example_cqm_stockselling`
         :link: opt_example_cqm_stockselling
@@ -61,8 +61,7 @@ These examples use the |cloud| service's :term:`quadratic model` solvers.
         :link: opt_example_cqm_diet
         :link-type: ref
 
-        Solves a mixed-integer linear-programming
-        (`MILP <https://en.wikipedia.org/wiki/Integer_programming>`_) problem
+        Solves a mixed-integer linear-programming (MILP) problem
         using the Leap service's CQM solver.
 
 Additional Examples

Diff for: docs/industrial_optimization/index_get_started.rst

@@ -30,13 +30,13 @@ Learn to solve hard optimization problems using quantum-classical :term:`hybrid`
         :link: opt_model_construction_qm
         :link-type: ref
 
-        Constructing :term:`quadratic models <quadratic model>`.
+        Constructing quadratic models.
 
     .. grid-item-card:: :ref:`opt_model_construction_nl`
         :link: opt_model_construction_nl
         :link-type: ref
 
-        Constructing :term:`nonlinear models <nonlinear model>`.
+        Constructing nonlinear models.
 
     .. grid-item-card:: :ref:`opt_index_hybrid`
         :link: opt_index_hybrid

Diff for: docs/leap_sapi/index_release_notes.rst

@@ -36,6 +36,4 @@ Leap Service Release Notes
             :link: leap_known_issues
             :link-type: ref
 
-            Problems that are currently known to be open.
-
-
+            Problems that are currently known to be open.

Diff for: docs/ocean/dwave_cli.rst

@@ -9,7 +9,7 @@ As part of the installation of the :ref:`dwave-ocean-sdk <ocean_source_code>` a
 might be installed as ``<virtual_environment>\\Scripts\\dwave.exe``. Running
 this file from your system's console opens an interactive command line interface
 (CLI) that can help you set up and configure your development environment,
-communicate with |cloud_tm|_ service's compute resources, interact with your
+communicate with |cloud|_ service's compute resources, interact with your
 |cloud| service's account, and other useful actions.
 
 Run :code:`dwave --help` for information on all the CLI options.\ [#]_  For

Diff for: docs/ocean/release_notes.rst

@@ -8,8 +8,8 @@ Ocean SDK Release Notes
     so that this page can generate the release notes as html without
     multiple warnings of conflict
 
-For release notes for the |cloud_tm| quantum cloud service, see the
-:ref:`leap_release_notes` section.
+For release notes for the |cloud| quantum cloud service, see the
+:ref:`index_leap_sapi` section.
 
 
 *   `dimod <https://github.com/dwavesystems/dimod/releases>`_

Diff for: docs/quantum_research/classical_intro.rst

@@ -137,5 +137,7 @@ perform less well than alternative formulations.
 Classical Solvers in the Ocean SDK
 ==================================
 
-*   Solvers in the :ref:`dimod <index_dimod>` package: :ref:`dimod_samplers`
-*   Solvers in the :ref:`dwave-samplers <index_samplers>` package: :ref:`samplers_api_ref`
+*   Solvers in the :ref:`dimod <index_dimod>` package:
+    :ref:`test samplers <dimod_samplers>`.
+*   Solvers in the :ref:`dwave-samplers <index_samplers>` package:
+    :ref:`production samplers <samplers_api_ref>`.

Diff for: docs/quantum_research/gate_model_intro.rst

@@ -10,8 +10,9 @@ algorithms with
 to the use of `Boolean gates <https://en.wikipedia.org/wiki/Logic_gate>`_ in
 classical computers.
 
-`Ocean software <index_ocean_sdk>` provides the `dwave-gate <index_gate>`
-package for constructing, modifying and running quantum circuits on a simulator.
+:ref:`Ocean software <index_ocean_sdk>` provides the
+:ref:`dwave-gate <index_gate>` package for constructing, modifying and running
+quantum circuits on a simulator.
 
 Further Information
 ===================

Diff for: docs/quantum_research/index_examples_beginner.rst

@@ -24,55 +24,54 @@ Basic QPU Examples
         :link: qpu_example_sat_unconstrained
         :link-type: ref
 
-        Describes the mathematical formulation of an :term:`objective function`
-        for a simple, *unconstrained* problem.
+        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,
-        :term:`constrained <constraint>` problem on a quantum computer.
+        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
-        :ref:`Ocean <index_ocean_sdk>` software.
+        Ocean software.
 
     .. grid-item-card:: :ref:`qpu_example_not`
         :link: qpu_example_not
         :link-type: ref
 
-        Mathematically formulates a simple :term:`QUBO`.
+        Mathematically formulates a simple QUBO.
 
     .. grid-item-card:: :ref:`qpu_example_and`
         :link: qpu_example_and
         :link-type: ref
 
-        Explains and demonstrates :term:`minor-embedding` on the QPU using
-        :term:`chains <chain>`.
+        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 :term:`minor-embedding` techniques and results.
+        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
-        :term:`penalties <penalty>`.
+        penalties.
 
     .. grid-item-card:: :ref:`qpu_example_mapcoloring`
         :link: qpu_example_mapcoloring
         :link-type: ref
 
         Solves a more complex constraint satisfaction problem by formulating
-        :term:`penalties <penalty>`.
+        penalties.
 
 Additional Examples
 ===================

Diff for: docs/quantum_research/index_formulation.rst

@@ -20,7 +20,7 @@ Advanced guidance on stating and reformulating your problems for quantum compute
         :link: qpu_stating_problems
         :link-type: ref
 
-        Properly stated, a problem can be formulated as an :term:`objective`.
+        Properly stated, a problem can be formulated as an objective.
 
     .. grid-item-card:: :ref:`qpu_reformulating`
         :link: qpu_reformulating

Diff for: docs/quantum_research/index_get_started.rst

@@ -18,8 +18,8 @@ Get Started with Quantum Computing
     basic_config
     index_examples_beginner
 
-Learn to submit problems directly to quantum processing units (QPUs) in
-the |cloud_tm| quantum cloud service.
+Learn to submit problems directly to quantum processing units (:term:`QPU`) in
+the |cloud| quantum cloud service.
 
 .. grid:: 3
     :gutter: 2
@@ -62,7 +62,7 @@ the |cloud_tm| quantum cloud service.
         :link: qpu_embedding_intro
         :link-type: ref
 
-        Mapping arbitrary problems to QPU :term:`topology`.
+        Mapping arbitrary problems to QPU topology.
 
     .. grid-item-card:: :ref:`qpu_basic_config`
 

Diff for: docs/quantum_research/index_using.rst

@@ -37,7 +37,7 @@ Guidance and best practices for QPU usage.
         :link: qpu_embedding_guidance
         :link-type: ref
 
-        Considerations for :term:`minor embedding`.
+        Considerations for minor embedding.
 
     .. grid-item-card:: :ref:`qpu_solver_parameters`
         :link: qpu_solver_parameters

Diff for: docs/shared/examples.rst

@@ -61,7 +61,7 @@ The following code solves a random problem on a quantum computer.
 .. start_qpu2
 
 The following code solves the known "minimum vertex cover"
-graph problem using an annealing quantum computer.
+graph problem using an :term:`annealing` quantum computer.
 
 >>> import networkx as nx
 >>> import dwave_networkx as dnx