Add %config and %trace where it makes sense

BasicGates/BasicGates.ipynb

@@ -30,6 +30,22 @@
     "In all tasks you need to implement the transformation exactly, without introducing any global phase. You can read more about the global phase of quantum states [here](../tutorials/Qubit/Qubit.ipynb#Relative-and-Global-Phase)."
    ]
   },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "> Executing the below cell will change the way qubits are displayed in the tasks results, this is consistent with the notation which we use throughout the Katas."
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "%config dump.basisStateLabelingConvention=\"Bitstring\""
+   ]
+  },
   {
    "cell_type": "markdown",
    "metadata": {},

tutorials/MultiQubitSystems/MultiQubitSystems.ipynb

@@ -267,7 +267,7 @@
     "If you aren't familiar with the output of this function for single qubits, you should revisit the tutorial on [the concept of a qubit](../Qubit/Qubit.ipynb#Demo:-Examining-Qubit-States-in-Q#). \n",
     "When printing the state of multi-qubit systems, this function outputs the same information for each multi-qubit basis state.\n",
     "\n",
-    "> `DumpMachine` prints system states in little-endian format: for three qubits, $|0\\rangle$ is $|000\\rangle$, $|1\\rangle$ is $|100\\rangle$, $|2\\rangle$ is $|010\\rangle$, $|3\\rangle$ is $|110\\rangle$, and so on."
+    "> `%config dump.basisStateLabelingConvention=\"Bitstring\"` changes the `DumpMachine` format from little-endian to bitstring. For example this LittleEndian display $|3\\rangle$ this would be $|110\\rangle$ in bitstring format something we are more used to. "
    ]
   },
   {
@@ -345,6 +345,7 @@
    },
    "outputs": [],
    "source": [
+    "%config dump.basisStateLabelingConvention=\"Bitstring\"\n",
     "%simulate MultiQubitSystems_Demo"
    ]
   },

tutorials/SingleQubitGates/SingleQubitGates.ipynb

@@ -342,7 +342,7 @@
    "source": [
     "### <span style=\"color:blue\">Demo: Pauli Gates</span>\n",
     "\n",
-    "The following cell contains code demonstrating how to apply gates in Q#, using the Pauli $X$ gate as an example. It sets up a series of quantum states, and then shows the result of applying the $X$ gate to each one. To run the demo, run the next cell using `Ctrl+Enter` (`⌘+Enter` on a Mac), then run the cell after it to see the output.\n",
+    "The following cell contains code demonstrating how to apply gates in Q#, using the Pauli $X$ gate as an example. It sets up a series of quantum states, and then shows the result of applying the $X$ gate to each one. To run the demo, run the next cell using `Ctrl+Enter` (`⌘+Enter` on a Mac).\n",
     "\n",
     "In the previous tutorial we discussed that the qubit state in Q# cannot be directly assigned or accessed. The same logic is extended to the quantum gates: applying a gate to a qubit modifies the internal state of that qubit but doesn't return the resulting state of the qubit. This is why we never assign the output of these gates to any variables in this demo - they don't produce any output.\n",
     "\n",
@@ -404,6 +404,13 @@
     "}"
    ]
   },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "Exectuting the cell below with the `%trace` command will execute the `PauliGates_Demo` function defined above, and will print all the gates nicely at the botom of the output have a look."
+   ]
+  },
   {
    "cell_type": "code",
    "execution_count": null,
@@ -412,7 +419,7 @@
    },
    "outputs": [],
    "source": [
-    "%simulate PauliGates_Demo"
+    "%trace PauliGates_Demo"
    ]
   },
   {