Add links to new tutorials to the older ones (#637)

Also fixes a typo in VisualizationTools tutorial.

Author: vivanwin

GroversAlgorithm/GroversAlgorithm.ipynb

@@ -17,6 +17,7 @@
     "\n",
     "*Reading material:*\n",
     "\n",
+    "* [The Oracles tutorial](../Oracles/Oracles.ipynb) is an introduction into quantum oracles.\n",
     "* [This Microsoft Learn module](https://docs.microsoft.com/learn/modules/solve-graph-coloring-problems-grovers-search/) offers a different, visual explanation of Grover's algorithm.\n",
     "* The tasks follow the explanation from *Quantum Computation and Quantum Information* by Nielsen and Chuang.\n",
     "  In the 10th anniversary edition, this is section 6.1.2 on pages 248-251.\n",

Measurements/Measurements.ipynb

@@ -12,6 +12,8 @@
     "* single-qubit measurements,\n",
     "* discriminating orthogonal and nonorthogonal states.\n",
     "\n",
+    "A detailed introduction into single-qubit measurements work can be found in [this tutorial](../tutorials/SingleQubitSystemMeasurements/SingleQubitSystemMeasurements.ipynb).\n",
+    "\n",
     "Each task is wrapped in one operation preceded by the description of the task.\n",
     "Your goal is to fill in the blank (marked with `// ...` comments)\n",
     "with some Q# code that solves the task. To verify your answer, run the cell using Ctrl+Enter (⌘+Enter on macOS).\n",
@@ -719,8 +721,7 @@
     "\n",
     "You are never allowed to give an incorrect answer. Your solution will be called multiple times, with one of the states picked with equal probability every time.\n",
     "\n",
-    "The state of the qubit at the end of the operation does not matter. ",
-    "\n",
+    "The state of the qubit at the end of the operation does not matter. \n",
     "<br/>\n",
     "<details>\n",
     "  <summary><b>Need a hint? Click here</b></summary>\n",
@@ -759,7 +760,7 @@
    "file_extension": ".qs",
    "mimetype": "text/x-qsharp",
    "name": "qsharp",
-   "version": "0.10"
+   "version": "0.14"
   }
  },
  "nbformat": 4,

tutorials/ExploringDeutschJozsaAlgorithm/DeutschJozsaAlgorithmTutorial.ipynb

@@ -10,7 +10,7 @@
     "\n",
     "This tutorial will:\n",
     "* introduce you to the problem solved by the Deutsch–Jozsa algorithm and walk you through the classical solution to it,\n",
-    "* give you a brief introduction to quantum oracles,\n",
+    "* give you a brief introduction to quantum oracles (for a more detailed introduction, see the [Oracles tutorial](../Oracles/Oracles.ipynb)),\n",
     "* describe the idea behind the Deutsch–Jozsa algorithm and walk you through the math for it,\n",
     "* teach you how to implement the algorithm in the Q# programming language,\n",
     "* and finally help you to run your implementation of the algorithm on several quantum oracles to see for yourself how the algorithm works!\n",

tutorials/MultiQubitGates/MultiQubitGates.ipynb

@@ -26,7 +26,9 @@
     "As a reminder, single-qubit gates are represented by $2\\times2$ [unitary matrices](../LinearAlgebra/LinearAlgebra.ipynb#Unitary-Matrices). \n",
     "The effect of a gate applied to a qubit can be calculated by multiplying the corresponding matrix by the state vector of the qubit to get the resulting state vector. \n",
     "\n",
-    "Multi-qubit gates are represented by $2^N\\times2^N$ matrices, where $N$ is the number of qubits the gate operates on. To apply this gate, you multiply the matrix by the state vector of the $N$-qubit quantum system."
+    "Multi-qubit gates are represented by $2^N\\times2^N$ matrices, where $N$ is the number of qubits the gate operates on. To apply this gate, you multiply the matrix by the state vector of the $N$-qubit quantum system.\n",
+    "\n",
+    "> In Q# you can use the `DumpOperation` command to see the matrix that an operation implements. You can find more info and a demo in [this tutorial](../VisualizationTools/VisualizationTools.ipynb#Display-the-matrix-implemented-by-the-operation)."
    ]
   },
   {

tutorials/MultiQubitSystems/MultiQubitSystems.ipynb

@@ -265,7 +265,8 @@
     "\n",
     "These demos use the function `DumpMachine` to print the state of the quantum simulator. \n",
     "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."
+    "When printing the state of multi-qubit systems, this function outputs the same information for each multi-qubit basis state.\n",
+    "[This tutorial](../VisualizationTools/VisualizationTools.ipynb#Demo:-DumpMachine-for-multi-qubit-systems) explains how `DumpMachine` works for multiple qubits in more detail. "
    ]
   },
   {

tutorials/VisualizationTools/VisualizationTools.ipynb

@@ -173,7 +173,7 @@
     "    Message(\"Uneven superposition state:\");\n",
     "    DumpMachine();\n",
     "\n",
-    "    // This line returns the qubit to state |0⟩ before releasing it.\n",
+    "    // This line returns the qubits to state |0⟩ before releasing them.\n",
     "    ResetAll(qs);\n",
     "}"
    ]