Fix links to Q# docs broken by migration to /azure/ (#607)

This change also removes /en-us/ parts of the URLs for uniformity.

BasicGates/BasicGates.ipynb

@@ -354,7 +354,7 @@
     "\n",
     "### Q# materials\n",
     "\n",
-    "* Using controlled and adjoint versions of gates is covered in the Q# documentation on [operations](https://docs.microsoft.com/en-us/quantum/user-guide/language/expressions/functorapplication)."
+    "* Using controlled and adjoint versions of gates is covered in the Q# documentation on [operations](https://docs.microsoft.com/azure/quantum/user-guide/language/expressions/functorapplication)."
    ]
   },
   {
@@ -504,7 +504,7 @@
    "file_extension": ".qs",
    "mimetype": "text/x-qsharp",
    "name": "qsharp",
-   "version": "0.12"
+   "version": "0.14"
   }
  },
  "nbformat": 4,

BasicGates/README.md

@@ -12,4 +12,4 @@ You can [run the Basic Gates kata as a Jupyter Notebook](https://mybinder.org/v2
 #### Q# materials
 
 * Basic gates provided in Q# belong to the [Microsoft.Quantum.Intrinsic namespace](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.intrinsic).
-* Using and defining controlled and adjoint versions of gates is covered in the [Q# user guide](https://docs.microsoft.com/en-us/quantum/user-guide/language/expressions/functorapplication).
+* Using and defining controlled and adjoint versions of gates is covered in the [Q# user guide]https://docs.microsoft.com/azure/quantum/user-guide/language/expressions/functorapplication).

CHSHGame/CHSHGame.ipynb

@@ -235,7 +235,7 @@
     "<br/>\n",
     "<details>\n",
     "    <summary><b>Need a hint? Click here</b></summary>\n",
-    "  <a href=\"https://docs.microsoft.com/en-us/qsharp/api/qsharp/microsoft.quantum.intrinsic.ry\">Ry gate</a> applies a rotation by a given angle in counterclockwise direction.\n",
+    "  <a href=\"https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.intrinsic.ry\">Ry gate</a> applies a rotation by a given angle in counterclockwise direction.\n",
     "</details>"
    ]
   },

DeutschJozsaAlgorithm/DeutschJozsaAlgorithm.ipynb

@@ -36,7 +36,7 @@
     " - the oracle effect on qubits in superposition is defined following the linearity of quantum operations.\n",
     " - the oracle must act properly on qubits in all possible input states.\n",
     " \n",
-    "You can read more about quantum oracles in [Q# documentation](https://docs.microsoft.com/quantum/concepts/oracles)."
+    "You can read more about quantum oracles in [Q# documentation](https://docs.microsoft.com/azure/quantum/concepts-oracles)."
    ]
   },
   {
@@ -612,7 +612,7 @@
    "file_extension": ".qs",
    "mimetype": "text/x-qsharp",
    "name": "qsharp",
-   "version": "0.12"
+   "version": "0.14"
   }
  },
  "nbformat": 4,

DeutschJozsaAlgorithm/README.md

@@ -6,7 +6,7 @@ This kata covers several well-studied algorithms and concepts.
 
 #### Quantum oracles
 
-A good introduction to quantum oracles can be found in [the Q# documentation](https://docs.microsoft.com/quantum/concepts/oracles).
+A good introduction to quantum oracles can be found in [the Q# documentation](https://docs.microsoft.com/azure/quantum/concepts-oracles).
 
 #### Deutsch-Jozsa algorithm
 

DistinguishUnitaries/Workbook_DistinguishUnitaries.ipynb

@@ -74,7 +74,7 @@
     "\n",
     "> In Q#, the freshly allocated qubits start in the $|0\\rangle$ state, so you don't need to do anything to prepare the necessary state before applying the unitary to it.\n",
     "> You also have to return the qubits you allocated to the $|0\\rangle$ state before releasing them. \n",
-    "> You can do that by measuring the qubit using the `M` operation and applying the **X** gate if it was measured in the $|1\\rangle$ state, or you can use [`MResetZ`](https://docs.microsoft.com/en-us/qsharp/api/qsharp/microsoft.quantum.measurement.mresetz) operation that wraps this measurement and fixup into one operation."
+    "> You can do that by measuring the qubit using the `M` operation and applying the **X** gate if it was measured in the $|1\\rangle$ state, or you can use [`MResetZ`](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.measurement.mresetz) operation that wraps this measurement and fixup into one operation."
    ]
   },
   {
@@ -133,7 +133,7 @@
     "$$I \\big(\\frac{1}{\\sqrt2}(|0\\rangle + |1\\rangle)\\big) = \\frac{1}{\\sqrt2}(|0\\rangle + |1\\rangle)$$\n",
     "$$Z \\big(\\frac{1}{\\sqrt2}(|0\\rangle + |1\\rangle)\\big) = \\frac{1}{\\sqrt2}(|0\\rangle \\color{blue}{-} |1\\rangle)$$\n",
     "\n",
-    "These two states are orthogonal and can be distinguished by measuring them in the $\\{ |+\\rangle, |-\\rangle\\}$ basis using [`MResetX`](https://docs.microsoft.com/en-us/qsharp/api/qsharp/microsoft.quantum.measurement.mresetx) operation (which is equivalent to applying an **H** gate and measuring in the computational basis).\n",
+    "These two states are orthogonal and can be distinguished by measuring them in the $\\{ |+\\rangle, |-\\rangle\\}$ basis using [`MResetX`](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.measurement.mresetx) operation (which is equivalent to applying an **H** gate and measuring in the computational basis).\n",
     "\n",
     "> The task of distinguishing these two states is covered in more detail in the [Measurements kata](./..//Measurements/Measurements.ipynb#Task-1.3.-$|+\\rangle$-or-$|-\\rangle$?) and the corresponding workbook."
    ]
@@ -317,7 +317,7 @@
     "\n",
     "After this we can measure the first qubit to distinguish $\\frac{1}{\\sqrt2}(|0\\rangle + |1\\rangle)$ from $\\frac{1}{\\sqrt2}(|0\\rangle - |1\\rangle)$, like we did in [task 1.2](#Task-1.2.-Identity-or-Pauli-Z?).\n",
     "\n",
-    "> In Q# we can express controlled version of a gate using [Controlled functor](https://docs.microsoft.com/en-us/quantum/user-guide/language/expressions/functorapplication#controlled-functor): the first argument of the resulting gate will be an array of control qubits, and the second one - the arguments of the original gate (in this case just the target qubit)."
+    "> In Q# we can express controlled version of a gate using [Controlled functor](https://docs.microsoft.com/azure/quantum/user-guide/language/expressions/functorapplication#controlled-functor): the first argument of the resulting gate will be an array of control qubits, and the second one - the arguments of the original gate (in this case just the target qubit)."
    ]
   },
   {

GraphColoring/GraphColoring.ipynb

@@ -10,7 +10,7 @@
     "to teach you the basics of using Grover search to solve constraint\n",
     "satisfaction problems, using graph coloring problem as an example.\n",
     "\n",
-    "* [This Microsoft Learn module](https://docs.microsoft.com/en-us/learn/modules/solve-graph-coloring-problems-grovers-search/) walks you through solving graph coloring problems using Grover's search.\n",
+    "* [This Microsoft Learn module](https://docs.microsoft.com/learn/modules/solve-graph-coloring-problems-grovers-search/) walks you through solving graph coloring problems using Grover's search.\n",
     "* You can read more about graph coloring problems [here](https://en.wikipedia.org/wiki/Graph_coloring).\n",
     "* It is strongly recommended to complete the [Grover's Algorithm kata](./../GroversAlgorithm/GroversAlgorithm.ipynb) before proceeding to this one. You can also refer to its [README.md](./../GroversAlgorithm/README.md) for the list of resources on Grover's algorithm.\n",
     "* [SolveSATWithGrover](./../SolveSATWithGrover/SolveSATWithGrover.ipynb) is another kata covering oracle implementation for solving constraint satisfaction problems.\n",

GraphColoring/README.md

@@ -6,7 +6,7 @@ Then it takes the implementation of the Grover's search to the next level, cover
 
 You can [run the Graph Coloring kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=GraphColoring%2FGraphColoring.ipynb)!
 
-* [This Microsoft Learn module](https://docs.microsoft.com/en-us/learn/modules/solve-graph-coloring-problems-grovers-search/) walks you through solving graph coloring problems using Grover's search.
+* [This Microsoft Learn module](https://docs.microsoft.com/learn/modules/solve-graph-coloring-problems-grovers-search/) walks you through solving graph coloring problems using Grover's search.
 * You can read more about [graph coloring problems](https://en.wikipedia.org/wiki/Graph_coloring) on Wikipedia.
 * It is strongly recommended to complete the [Grover's Algorithm kata](./../GroversAlgorithm/) before proceeding to this one. You can also refer to its [README.md](./../GroversAlgorithm/README.md) for the list of resources on Grover's algorithm.
 * [SolveSATWithGrover](./../SolveSATWithGrover/) is another kata covering oracle implementation for solving constraint satisfaction problems.

GraphColoring/Workbook_GraphColoring.ipynb

@@ -81,7 +81,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "Alternatively, we can use a helpful library operation [ApplyPauliFromBitString](https://docs.microsoft.com/en-us/qsharp/api/qsharp/microsoft.quantum.canon.applypaulifrombitstring). \n",
+    "Alternatively, we can use a helpful library operation [ApplyPauliFromBitString](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.canon.applypaulifrombitstring). \n",
     "It takes as input a Pauli operator $P \\in \\{I,X,Y,Z\\}$, a boolean value, a boolean array and a qubit register and applies the Pauli operator to the register using the boolean array as a bit mask: the operator is applied to the qubits that correspond to array elements equal to the given boolean value.\n",
     "\n",
     "We can think of `ApplyPauliFromBitString` as the following unitary transformation:\n",
@@ -487,9 +487,9 @@
     "\n",
     "Also, do not forget to uncompute to leave the qubits clean.\n",
     "\n",
-    "> In Q#, a sub-array of array elements between indices $a$ and $b$, inclusive, is written as `array[a..b]` (see [array slicing documentation](https://docs.microsoft.com/quantum/user-guide/language/expressions#array-slices)).\n",
+    "> In Q#, a sub-array of array elements between indices $a$ and $b$, inclusive, is written as `array[a..b]` (see [array slicing documentation](https://docs.microsoft.com/azure/quantum/user-guide/language/expressions/itemaccessexpressions)).\n",
     ">\n",
-    "> The uncomputing of the temporarily allocated qubits can be done using the `within ... apply ...` structure (see [conjugations documentation](https://docs.microsoft.com/quantum/user-guide/using-qsharp/control-flow#conjugations))."
+    "> The uncomputing of the temporarily allocated qubits can be done using the `within ... apply ...` structure (see [conjugations documentation](https://docs.microsoft.com/azure/quantum/user-guide/language/statements/conjugations))."
    ]
   },
   {
@@ -615,7 +615,7 @@
     "To do this, we'll need to take some extra steps to use the generic implementation. Here is the flow:\n",
     "- Allocate an array of qubits to store graph coloring with 2 qubits per vertex and one more qubit to use when we verify that the solution we found is indeed correct.\n",
     "- Try running the algorithm with different numbers of Grover's iterations, starting with 1 iteration and increasing the number each time we don't find a solution. \n",
-    "We will use two mutable variables for this, `iterations` to store iteration count and `correct` to indicate whether we found a correct solution, and the [repeat-until-success loop](https://docs.microsoft.com/quantum/user-guide/using-qsharp/control-flow#repeat-until-success-loop).\n",
+    "We will use two mutable variables for this, `iterations` to store iteration count and `correct` to indicate whether we found a correct solution, and the [repeat-until-success loop](https://docs.microsoft.com/azure/quantum/user-guide/language/statements/conditionalloops#repeat-statement).\n",
     "- In the body of the loop we'll do the following steps:\n",
     "    - Use Grover's algorithm loop implemented in a previous code cell with the current number of iterations.\n",
     "    - Measure the qubit array to the result of Grover's algorithm. We can do that using the [`MultiM` operation](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.measurement.multim).\n",
@@ -686,7 +686,7 @@
    "file_extension": ".qs",
    "mimetype": "text/x-qsharp",
    "name": "qsharp",
-   "version": "0.12"
+   "version": "0.14"
   }
  },
  "nbformat": 4,

GroversAlgorithm/GroversAlgorithm.ipynb

@@ -17,7 +17,7 @@
     "\n",
     "*Reading material:*\n",
     "\n",
-    "* [This Microsoft Learn module](https://docs.microsoft.com/en-us/learn/modules/solve-graph-coloring-problems-grovers-search/) offers a different, visual explanation of Grover's algorithm.\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",
     "* A different explanation of Grover's algorithm can be found in \n",

GroversAlgorithm/README.md

@@ -8,7 +8,7 @@ You can [run the GroversAlgorithm kata as a Jupyter Notebook](https://mybinder.o
 #### Theory
 * The tasks follow the explanation from *Quantum Computation and Quantum Information* by Nielsen and Chuang.
   In the 10th anniversary edition, this is section 6.1.2 on pages 248-251.
-* [This Microsoft Learn module](https://docs.microsoft.com/en-us/learn/modules/solve-graph-coloring-problems-grovers-search/) offers a different, visual explanation of Grover's algorithm.
+* [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.
 * A different explanation of Grover's algorithm can be found in 
   [this Wikipedia article](https://en.wikipedia.org/wiki/Grover%27s_algorithm).
 * [An Introduction to Quantum Algorithms](https://people.cs.umass.edu/~strubell/doc/quantum_tutorial.pdf) by Emma Strubell, pages 20-24.

JointMeasurements/JointMeasurements.ipynb

@@ -9,7 +9,7 @@
     "**Joint Measurements** quantum kata is a series of exercises designed to get you familiar with programming in Q#. It covers the joint parity measurements and using them for distinguishing quantum states or for performing multi-qubit gates.\n",
     "\n",
     "* In Q# joint measurements are implemented as the [Measure](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.intrinsic.measure) operation.\n",
-    "* You can read more about measurements of multi-qubit Pauli operators in the [Q# documentation](https://docs.microsoft.com/quantum/concepts/pauli-measurements).\n",
+    "* You can read more about measurements of multi-qubit Pauli operators in the [Q# documentation](https://docs.microsoft.com/azure/quantum/concepts-pauli-measurements).\n",
     "\n",
     "Each task is wrapped in one operation preceded by the description of the task.  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",
@@ -269,7 +269,7 @@
    "file_extension": ".qs",
    "mimetype": "text/x-qsharp",
    "name": "qsharp",
-   "version": "0.10"
+   "version": "0.14"
   }
  },
  "nbformat": 4,

JointMeasurements/README.md

@@ -5,5 +5,5 @@ The joint measurements kata covers the usage of joint measurements, also known a
 You can [run the JointMeasurements kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=JointMeasurements%2FJointMeasurements.ipynb)!
 
 * In Q#, joint measurements are implemented as the [Measure](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.intrinsic.measure) operation.
-* You can read more about measurements of multi-qubit Pauli operators in the [Q# documentation](https://docs.microsoft.com/quantum/concepts/pauli-measurements).
+* You can read more about measurements of multi-qubit Pauli operators in the [Q# documentation](https://docs.microsoft.com/azure/quantum/concepts-pauli-measurements).
 * A general-case implementation of CNOT gate via joint measurements is described in [this paper](https://arxiv.org/pdf/1201.5734.pdf).