Merge pull request #804 from mrossinek/minor-fixes-p6

Minor fixes - Part 6 of 8

Author: nonhermitian

qiskit/advanced/terra/2_operators_overview.ipynb

@@ -734,7 +734,7 @@
     "\n",
     "Note that the previous compose requires that the total output dimension of the first operator $A$ is equal to total input dimension of the composed operator $B$ (and similarly, the output dimension of $B$ must be equal to the input dimension of $A$ when composing with `front=True`).\n",
     "\n",
-    "We can also compose a smaller operator with a selection of subsystems on a larger operator using the `qargs` kwarg of `compose`, either with or without `front=True`. In this case, the relevant input and output dimenions of the subsystems being composed must match. *Note that the smaller operator must always be the argument of `compose` method.*\n",
+    "We can also compose a smaller operator with a selection of subsystems on a larger operator using the `qargs` kwarg of `compose`, either with or without `front=True`. In this case, the relevant input and output dimensions of the subsystems being composed must match. *Note that the smaller operator must always be the argument of `compose` method.*\n",
     "\n",
     "For example, to compose a two-qubit gate with a three-qubit Operator:"
    ]

qiskit/advanced/terra/4_transpiler_passes_and_passmanager.ipynb

@@ -27,7 +27,7 @@
    "source": [
     "A central component of Qiskit Terra is the transpiler, which is designed for modularity and extensibility. The goal is to be able to easily write new circuit transformations (known as transpiler **passes**), and combine them with other existing passes.  Which passes are chained together and in which order has a major effect on the final outcome. This pipeline is determined by a **pass manager**, which schedules the passes and also allows passes to communicate with each other by providing a shared space. In this way, the transpiler opens up the door for research into aggressive optimization of quantum circuits.\n",
     "\n",
-    "In this notebook, we look at the built-in passes, howto use the pass manager, and develop a simple custom transpiler pass. In order to do the latter, we first need to introduce the internal representation of quantum circuits in Qiskit, in the form of a Directed Acyclic Graph, or **DAG**. Then, we illustrate a simple swap mapper pass, which transforms an input circuit to be compatible with a limited-connectivity quantum device."
+    "In this notebook, we look at the built-in passes, how to use the pass manager, and develop a simple custom transpiler pass. In order to do the latter, we first need to introduce the internal representation of quantum circuits in Qiskit, in the form of a Directed Acyclic Graph, or **DAG**. Then, we illustrate a simple swap mapper pass, which transforms an input circuit to be compatible with a limited-connectivity quantum device."
    ]
   },
   {
@@ -203,7 +203,7 @@
     "\n",
     "There can be passes that do the same job, but in different ways. For example, the ``TrivialLayout``, ``DenseLayout`` and ``NoiseAdaptiveLayout`` all choose a layout (binding of virtual qubits to physical qubits), but use different algorithms and objectives. Similarly, the ``BasicSwap``, ``LookaheadSwap`` and ``StochasticSwap`` all insert swaps to make the circuit compatible with the coupling map. The modularity of the transpiler allows plug-and-play replacements for each pass.\n",
     "\n",
-    "Below, we show the swapper passes all applied to the same circuit, to transform it to match a linear chain topology. You can see differences in performance, where the StochasticSwap is clearly the best. However, this can vary depending on the input circuit."
+    "Below, we show the swapper passes all applied to the same circuit, to transform it to match a linear chain topology. You can see differences in performance, where the ``StochasticSwap`` is clearly the best. However, this can vary depending on the input circuit."
    ]
   },
   {

qiskit/advanced/terra/5_pulse_schedules.ipynb

@@ -138,7 +138,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "Channels can be checked for equivalency. This check is based on the channel index as every channel corresponds to a unique device channel."
+    "Channels can be checked for equivalence. This check is based on the channel index as every channel corresponds to a unique device channel."
    ]
   },
   {
@@ -231,7 +231,7 @@
     "The fundamental commands for the `PulseChannel` are:\n",
     "- `SamplePulse`: A pulse specified as a complex array of samples to be output out on the corresponding channel. Each pulse sample corresponds to a timestep of unit `dt` on the backend.\n",
     "- `FrameChange`: A persistent framechange of the phase of all future pulses on the corresponding channel. `Framechange`s have zero duration on the backend.\n",
-    "- `PersistentValue`: A pulse that will holds its value until the next pulse on the corresponding channel. `PersistentValue` pulses will have variable duration on the backend as they depend on subsequent commands."
+    "- `PersistentValue`: A pulse that will hold its value until the next pulse on the corresponding channel. `PersistentValue` pulses will have variable duration on the backend as they depend on subsequent commands."
    ]
   },
   {
@@ -419,7 +419,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "Certain instructions such as the `AcquireInstruction` accept multiple channels. In this case `AcquireInstruction` accepts up to three lists of the same size. These are lists of `AcquireChannel`s, `MemorySlot`s and `RegisterSlot`s. This allows the acquisition, kerneling and discrimination of multiple qubit to be combined and the output of a given channel to directed to the desired storage location."
+    "Certain instructions such as the `AcquireInstruction` accept multiple channels. In this case `AcquireInstruction` accepts up to three lists of the same size. These are lists of `AcquireChannel`s, `MemorySlot`s and `RegisterSlot`s. This allows the acquisition, kerneling and discrimination of multiple qubits to be combined and the output of a given channel to be directed to the desired storage location."
    ]
   },
   {
@@ -614,7 +614,7 @@
    "metadata": {},
    "source": [
     "## Schedules\n",
-    "Pulse schedules are made by scheduling `Instruction`s. The `Schedule` may be viewed as a container for `Instruction`s and `Schedule`s shifted in time. In this way a simple `Schedule`s may be treated as a building blocks for more complicated `Schedule`s. "
+    "Pulse schedules are made by scheduling `Instruction`s. The `Schedule` may be viewed as a container for `Instruction`s and `Schedule`s shifted in time. In this way a simple `Schedule` may be treated as a building block for more complicated `Schedule`s. "
    ]
   },
   {
@@ -800,7 +800,7 @@
     "\n",
     "As the `Schedule` for the above methods emulate numeric types this enables a simple way of construction composite pulse schedules.\n",
     "\n",
-    "Below we construct two equivalent schedules one with the syntactic sugar and one without"
+    "Below we construct two equivalent schedules one with the syntactic sugar and one without."
    ]
   },
   {
@@ -875,7 +875,7 @@
     "There are three (integer) measurement pulse levels (`meas_levels`) for pulse outputs which are triggered by `Acquire` commands and stored into the desired `MemorySlots`:\n",
     "- Measurement level 0: Return the sampled measurement output from the `AcquireChannel` after mixing down with the measurement stimulus LO. There will be a large amount of data associated with measurement level.\n",
     "- Measurement level 1: Return the data after the application of a user specified (or default if not specified) kernel.\n",
-    "- Measurement level 2: Return the discriminated counts after the application of a measurement kernel and discriminator. This corresponds to the measurement output of a quantum circuit. See the [circuits notebook](quantum_circuits.ipynb) for more information.\n",
+    "- Measurement level 2: Return the discriminated counts after the application of a measurement kernel and discriminator. This corresponds to the measurement output of a quantum circuit. See the [circuits notebook](../../fundamentals/4_quantum_circuit_properties.ipynb) for more information.\n",
     "\n",
     "For measurement level 0 and 1 there is another supported measurement result post-processing modifier, `meas_return`:\n",
     "- `single`: Return the results for each individual shot.\n",
@@ -932,7 +932,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "For measurement levels 2, results are extracted in the same way as for circuit results. To get individual shot counts,"
+    "For measurement level 2 results are extracted in the same way as for circuit results. To get individual shot counts,"
    ]
   },
   {

qiskit/advanced/terra/6_creating_a_provider.ipynb

@@ -110,7 +110,7 @@
    "source": [
     "# Creating a job class\n",
     "\n",
-    "A job class is a necessary building block when creating a provider. It allows to synchronize different executions of the simulator. Since this is out of the scope of this tutorial, we define a degenerated job, which effectively does nothing. See [The IBM Q Provider](../basics/the_ibmq_provider.ipynb) for relevant information."
+    "A job class is a necessary building block when creating a provider. It allows to synchronize different executions of the simulator. Since this is out of the scope of this tutorial, we define a degenerated job, which effectively does nothing. See [The IBM Q Provider](../../fundamentals/3_the_ibmq_account.ipynb#The-Provider-) for relevant information."
    ]
   },
   {
@@ -318,7 +318,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "Create a provider inherited from ``BaseProvider`` and minimally implement the ``backends`` method for retreiving a list of backends."
+    "Create a provider inherited from ``BaseProvider`` and minimally implement the ``backends`` method for retrieving a list of backends."
    ]
   },
   {