Update format for Binder links (#656)

Fixing the Binder links format following the breaking update https://discourse.jupyter.org/t/mybinder-org-using-jupyterlab-by-default/10715.

BasicGates/README.md

@@ -2,7 +2,7 @@
 
 The Basic Gates kata covers the basic operations (a.k.a. "gates") used in quantum computing, as well as the concept of controlled and adjoint versions of gates.
 
-You can [run the Basic Gates kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=BasicGates%2FBasicGates.ipynb)!
+You can [run the Basic Gates kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/BasicGates%2FBasicGates.ipynb)!
 
 #### Theory
 

CHSHGame/README.md

@@ -3,7 +3,7 @@
 This kata covers the CHSH game, one of the most famous examples of a nonlocal
 (entanglement) game. 
 
-You can [run the CHSH Game kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=CHSHGame%2FCHSHGame.ipynb)!
+You can [run the CHSH Game kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/CHSHGame%2FCHSHGame.ipynb)!
 
 In a nonlocal game, several cooperating players play a game against a referee answering the referee's questions. The players are free to share information
 (and even qubits!) before the game starts, but are forbidden from communicating

DeutschJozsaAlgorithm/README.md

@@ -1,6 +1,6 @@
 # Welcome!
 
-You can [run the DeutschJozsaAlgorithm kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=DeutschJozsaAlgorithm%2FDeutschJozsaAlgorithm.ipynb)!
+You can [run the DeutschJozsaAlgorithm kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/DeutschJozsaAlgorithm%2FDeutschJozsaAlgorithm.ipynb)!
 
 This kata covers several well-studied algorithms and concepts. 
 

DistinguishUnitaries/README.md

@@ -2,4 +2,4 @@
 
 The "Distinguish Unitaries" kata offers tasks in which you are given a unitary and have to figure out which of the list it is by designing and performing experiments on it.
 
-You can [run the DistinguishUnitaries kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=DistinguishUnitaries%2FDistinguishUnitaries.ipynb)!
+You can [run the DistinguishUnitaries kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/DistinguishUnitaries%2FDistinguishUnitaries.ipynb)!

GHZGame/README.md

@@ -3,7 +3,7 @@
 This kata covers the Greenberger-Horne-Zeilinger game (often abbreviated as GHZ game), 
 a well-known example of a nonlocal (entanglement) game. 
 
-You can [run the GHZ Game kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=GHZGame%2FGHZGame.ipynb)!
+You can [run the GHZ Game kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/GHZGame%2FGHZGame.ipynb)!
 
 In a nonlocal game, several cooperating players play a game against a referee answering the referee's questions. The players are free to share information
 (and even qubits!) before the game starts, but are forbidden from communicating

GraphColoring/README.md

@@ -4,7 +4,7 @@ This kata continues the exploration of the Grover's search algorithm started in
 It teaches writing oracles for the algorithm which describe the problem instead of the solution, using graph coloring problem as an example. 
 Then it takes the implementation of the Grover's search to the next level, covering solving the problems with unknown number of solutions.
 
-You can [run the Graph Coloring kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=GraphColoring%2FGraphColoring.ipynb)!
+You can [run the Graph Coloring kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/GraphColoring%2FGraphColoring.ipynb)!
 
 * [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.

GroversAlgorithm/README.md

@@ -3,7 +3,7 @@
 The Grover's Algorithm kata covers Grover's search algorithm, which is one of the fundamental quantum computing algorithms.
 It solves the problem of finding an input to a black box (oracle) that produces a particular output.
 
-You can [run the GroversAlgorithm kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=GroversAlgorithm%2FGroversAlgorithm.ipynb)!
+You can [run the GroversAlgorithm kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/GroversAlgorithm%2FGroversAlgorithm.ipynb)!
 
 #### Theory
 * The tasks follow the explanation from *Quantum Computation and Quantum Information* by Nielsen and Chuang.

JointMeasurements/README.md

@@ -2,7 +2,7 @@
 
 The joint measurements kata covers the usage of joint measurements, also known as parity measurements, which are measurements involving multiple qubits.
 
-You can [run the JointMeasurements kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=JointMeasurements%2FJointMeasurements.ipynb)!
+You can [run the JointMeasurements kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/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/azure/quantum/concepts-pauli-measurements).

KeyDistribution_BB84/README.md

@@ -2,7 +2,7 @@
 
 The **Quantum Key Distribution** kata is a series of exercises designed to teach you about a neat quantum technology where you can use qubits to exchange secure cryptographic keys. In particular, you will work through implementing and testing a quantum key distribution protocol called [BB84](https://en.wikipedia.org/wiki/BB84).
 
-You can [run the KeyDistribution_BB84 kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=KeyDistribution_BB84%2FKeyDistribution_BB84.ipynb)!
+You can [run the KeyDistribution_BB84 kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/KeyDistribution_BB84%2FKeyDistribution_BB84.ipynb)!
 
 ### Background
 

MagicSquareGame/README.md

@@ -8,7 +8,7 @@ but are forbidden from communicating with each other afterwards.
 Nonlocal games show that quantum entanglement can be used to increase the players' chance of winning 
 beyond what would be possible with a purely classical strategy.
 
-You can [run the MagicSquareGame kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=MagicSquareGame%2FMagicSquareGame.ipynb)!
+You can [run the MagicSquareGame kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/MagicSquareGame%2FMagicSquareGame.ipynb)!
 
 #### Theory
 

Measurements/README.md

@@ -4,7 +4,7 @@ The measurements kata covers the following topics:
 - single-qubit measurements
 - quantum state discrimination for both orthogonal and non-orthogonal states
 
-You can [run the Measurements kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=Measurements%2FMeasurements.ipynb)!
+You can [run the Measurements kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/Measurements%2FMeasurements.ipynb)!
 
 Variations of quantum state discrimination tasks are covered in the paper ["Quantum State Discrimination"](https://arxiv.org/pdf/quant-ph/0010114.pdf).
 * Task 2.1 is an example of hypothesis testing for two pure states.

PhaseEstimation/README.md

@@ -4,7 +4,7 @@ This kata covers phase estimation algorithms, which are some of the most fundame
 
 Phase estimation is the task of estimating the eigenvalue of an eigenvector of a unitary operator. Since the absolute value of the eigenvalue is always 1, the eigenvalue can be represented as exp(2iπφ), and phase estimation algorithms are usually formulated in terms of estimating the phase φ.
 
-You can [run the Phase Estimation kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=PhaseEstimation%2FPhaseEstimation.ipynb)!
+You can [run the Phase Estimation kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/PhaseEstimation%2FPhaseEstimation.ipynb)!
 
 #### Theory
 

QEC_BitFlipCode/README.md

@@ -4,7 +4,7 @@ This kata covers the simplest of the quantum error-correction (QEC) codes - the
 
 This code is a quantum equivalent of the classical [repetition code](https://en.wikipedia.org/wiki/Repetition_code), adjusted to take into account the impossibility of simply cloning the quantum state.
 
-You can [run the QEC_BitFlipCode kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=QEC_BitFlipCode%2FQEC_BitFlipCode.ipynb)!
+You can [run the QEC_BitFlipCode kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/QEC_BitFlipCode%2FQEC_BitFlipCode.ipynb)!
 
 * This code is described in [the error correction article](https://docs.microsoft.com/azure/quantum/user-guide/libraries/standard/error-correction) in the Q# documentation.
 * Another description can be found in [the Wikipedia article](https://en.wikipedia.org/wiki/Quantum_error_correction#The_bit_flip_code).

QFT/README.md

@@ -5,7 +5,7 @@ It covers the following topics:
 - implementing the quantum Fourier transform
 - using the QFT to solve simple tasks
 
-You can [run the QFT kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=QFT%2FQFT.ipynb)!
+You can [run the QFT kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/QFT%2FQFT.ipynb)!
 
 #### Theory
 

README.md

@@ -135,7 +135,7 @@ Here is the learning path we suggest you to follow if you are starting to learn
 
 ## Run the katas and tutorials online <a name="run-online" /> ##
 
-The Quantum Katas are now available as Jupyter Notebooks online! See [index.ipynb](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=index.ipynb) for the list of all katas and tutorials, and instructions for running them online.
+The Quantum Katas are now available as Jupyter Notebooks online! See [index.ipynb](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/index.ipynb) for the list of all katas and tutorials, and instructions for running them online.
 
 > While running the Katas online is the easiest option to get started, if you want to save your progress and enjoy better performance, we recommend you to choose the local option. 
 

RippleCarryAdder/README.md

@@ -10,7 +10,7 @@ to reduce the number of ancillary qubits needed.
 * Part IV covers building an in-place quantum subtractor.
 * Part V covers addition and subtraction modulo 2ᴺ.
 
-You can [run the RippleCarryAdder kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=RippleCarryAdder%2FRippleCarryAdder.ipynb)!
+You can [run the RippleCarryAdder kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/RippleCarryAdder%2FRippleCarryAdder.ipynb)!
 
 #### Theory
 

SolveSATWithGrover/README.md

@@ -2,7 +2,7 @@
 
 This kata continues the exploration of the Grover's search algorithm started in the [Grover's Algorithm kata](./../GroversAlgorithm/). It teaches writing oracles for the algorithm which describe the problem instead of the solution, using SAT problem as an example. Then it takes the implementation of the Grover's search to the next level, covering the problems with unknown number of solutions.
 
-You can [run the SolveSATWithGrover kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=SolveSATWithGrover%2FSolveSATWithGrover.ipynb)!
+You can [run the SolveSATWithGrover kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/SolveSATWithGrover%2FSolveSATWithGrover.ipynb)!
 
 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.
 

SuperdenseCoding/README.md

@@ -2,7 +2,7 @@
 
 This kata covers superdense coding, a protocol which allows the transmission of two bits of classical information by sending just one qubit that uses previously shared quantum entanglement. This protocol can be thought of as the dual to the teleportation protocol, which allows to transfer the state of a qubit by sending two classical bits.
 
-You can [run the SuperdenseCoding kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=SuperdenseCoding%2FSuperdenseCoding.ipynb)!
+You can [run the SuperdenseCoding kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/SuperdenseCoding%2FSuperdenseCoding.ipynb)!
 
  - A good description can be found in [the Wikipedia article](https://en.wikipedia.org/wiki/Superdense_coding).
  - A great interactive demonstration can be found [on the Wolfram Demonstrations Project](http://demonstrations.wolfram.com/SuperdenseCoding/).

Superposition/README.md

@@ -5,7 +5,7 @@ The superposition kata covers the following topics:
  - superposition,
  - flow control and recursion in Q#.
 
- You can [run the Superposition kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=Superposition%2FSuperposition.ipynb)!
+ You can [run the Superposition kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/Superposition%2FSuperposition.ipynb)!
 
 It is recommended to complete the [BasicGates kata](./../BasicGates/) before this one to get familiar with the basic gates used in quantum computing. 
 The list of basic gates available in Q# can be found at [Microsoft.Quantum.Intrinsic](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.intrinsic).

Teleportation/README.md

@@ -3,7 +3,7 @@
 The teleportation kata covers quantum teleportation - a protocol which allows to communicate a quantum state
 using only classical communication and previously shared quantum entanglement.
 
-You can [run the Teleportation kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=Teleportation%2FTeleportation.ipynb)!
+You can [run the Teleportation kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/Teleportation%2FTeleportation.ipynb)!
 
  - Another description can be found in [the Wikipedia article](https://en.wikipedia.org/wiki/Quantum_teleportation).
  - An interactive demonstration can be found [on the Wolfram Demonstrations Project](http://demonstrations.wolfram.com/QuantumTeleportation/).

UnitaryPatterns/README.md

@@ -3,7 +3,7 @@
 The "Unitary Patterns" kata offers tasks on creating unitary transformations which can be represented 
 with matrices of certain shapes (with certain pattern of zero and non-zero values).
 
-You can [run the Unitary Patterns kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=UnitaryPatterns%2FUnitaryPatterns.ipynb)!
+You can [run the Unitary Patterns kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/UnitaryPatterns%2FUnitaryPatterns.ipynb)!
 
 A lot of tasks of this kata have been featured in the Microsoft Q# Coding Contest - Winter 2019. 
 You can find the descriptions of their solutions in the editorials for the 

index.ipynb

@@ -6,7 +6,7 @@
    "source": [
     "# Quantum Katas and Tutorials as Jupyter Notebooks\n",
     "\n",
-    "To run the katas and tutorials online, make sure you're viewing this file on Binder (if not, use [this link](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=index.ipynb)).\n",
+    "To run the katas and tutorials online, make sure you're viewing this file on Binder (if not, use [this link](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/index.ipynb)).\n",
     "\n",
     "To run the katas and tutorials locally, follow [these installation instructions](https://github.com/microsoft/QuantumKatas/blob/main/README.md#kata-locally).\n",
     "\n",
@@ -134,7 +134,7 @@
     "\n",
     "Notebook tutorials are designed with Notebook format in mind - in addition to programming exercises they include a lot of theoretical explanations and code samples for you to learn from.\n",
     "\n",
-    "Make sure you're viewing this file when running Jupyter notebooks on your machine or on Binder (for running on Binder, use [this link](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=index.ipynb)). From here you can navigate to the individual kata or tutorial notebooks using the links above.\n",
+    "Make sure you're viewing this file when running Jupyter notebooks on your machine or on Binder (for running on Binder, use [this link](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/index.ipynb)). From here you can navigate to the individual kata or tutorial notebooks using the links above.\n",
     "\n",
     "* Each tutorial or kata notebook contains a sequence of tasks on the topic, progressing from trivial to challenging.\n",
     "* Each task is defined in a separate code cell, preceded by the description of the task in a Markdown cell.\n",

tutorials/ComplexArithmetic/README.md

@@ -3,7 +3,7 @@
 This folder contains a tutorial on complex arithmetic that explains some of the mathematical background required to work with quantum computing.
 Complex arithmetic deals with imaginary and complex numbers, which arise from an attempt to take the square root of negative numbers.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/ComplexArithmetic/ComplexArithmetic.ipynb).
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/ComplexArithmetic/ComplexArithmetic.ipynb).
 Alternatively, you can install [Jupyter](https://jupyter.readthedocs.io/en/latest/install.html) on your machine (this tutorial does not require Q#), and run the tutorial locally by navigating to this folder and starting the notebook from the command line using the following command:
 
     jupyter notebook ComplexArithmetic.ipynb

tutorials/ExploringDeutschJozsaAlgorithm/README.md

@@ -2,7 +2,7 @@
 
 This folder contains a Notebook tutorial on the Deutsch-Jozsa algorithm - a quantum computing algorithm that has no practical use, but is famous for being one of the first examples of a quantum algorithm that is exponentially faster than any deterministic classical algorithm.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/ExploringDeutschJozsaAlgorithm%2FDeutschJozsaAlgorithmTutorial.ipynb). Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from command line using the following command: 
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/ExploringDeutschJozsaAlgorithm%2FDeutschJozsaAlgorithmTutorial.ipynb). Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from command line using the following command: 
 
     jupyter notebook DeutschJozsaAlgorithmTutorial.ipynb
 

tutorials/ExploringGroversAlgorithm/README.md

@@ -2,7 +2,7 @@
 
 This folder contains a tutorial on the Grover's search algorithm - one of the most famous algorithms in quantum computing. It focuses on exploring the high-level behavior of the algorithm.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/ExploringGroversAlgorithm%2FExploringGroversAlgorithmTutorial.ipynb). 
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/ExploringGroversAlgorithm%2FExploringGroversAlgorithmTutorial.ipynb). 
 Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from command line using the following command: 
 
     jupyter notebook ExploringGroversAlgorithmTutorial.ipynb

tutorials/LinearAlgebra/README.md

@@ -3,7 +3,7 @@
 This folder contains a tutorial on linear algebra that explains some of the mathematical background required to work with quantum computing.
 Linear algebra describes the properties of matrices and vectors, which are used to represent quantum states and operations on those states.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/LinearAlgebra/LinearAlgebra.ipynb).
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/LinearAlgebra/LinearAlgebra.ipynb).
 Alternatively, you can install [Jupyter](https://jupyter.readthedocs.io/en/latest/install.html) on your machine (this tutorial does not require Q#), and run the tutorial locally by navigating to this folder and starting the notebook from the command line using the following command:
 
     jupyter notebook LinearAlgebra.ipynb

tutorials/MultiQubitGates/README.md

@@ -2,7 +2,7 @@
 
 This tutorial discusses applying quantum gates to multi-qubit systems.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/MultiQubitGates/MultiQubitGates.ipynb).
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/MultiQubitGates/MultiQubitGates.ipynb).
 Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from the command line using the following command:
 
     jupyter notebook MultiQubitGates.ipynb

tutorials/MultiQubitSystems/README.md

@@ -2,7 +2,7 @@
 
 This tutorial discusses the representation and properties of multi-qubit systems.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/MultiQubitSystems/MultiQubitSystems.ipynb).
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/MultiQubitSystems/MultiQubitSystems.ipynb).
 Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from the command line using the following command:
 
     jupyter notebook MultiQubitSystems.ipynb

tutorials/Oracles/README.md

@@ -2,7 +2,7 @@
 
 This folder contains a Notebook tutorial on quantum oracles - a fundamental concept for many quantum algorithms.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/Oracles/Oracles.ipynb).  Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from the command line using the following command:
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/Oracles/Oracles.ipynb).  Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from the command line using the following command:
 
     jupyter notebook Oracles.ipynb
 

tutorials/QuantumClassification/README.md

@@ -11,6 +11,6 @@ After this you can run the tutorial locally by navigating to this folder and sta
 
     jupyter notebook ExploringQuantumClassificationLibrary.ipynb
 
-Alternatively, you can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials%2FQuantumClassification%2FExploringQuantumClassificationLibrary.ipynb). Be warned that this tutorial includes some heavy computations, so we recommend to run it locally and to use the online version only for reading.
+Alternatively, you can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials%2FQuantumClassification%2FExploringQuantumClassificationLibrary.ipynb). Be warned that this tutorial includes some heavy computations, so we recommend to run it locally and to use the online version only for reading.
 
 The Q# project in this folder contains the back-end of the tutorial and is not designed for direct use.

tutorials/Qubit/README.md

@@ -2,7 +2,7 @@
 
 This tutorial introduces the concept of a qubit - the most fundamental concept in quantum computing.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/Qubit/Qubit.ipynb).
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/Qubit/Qubit.ipynb).
 Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from the command line using the following command:
 
     jupyter notebook Qubit.ipynb

tutorials/RandomNumberGeneration/README.md

@@ -3,7 +3,7 @@
 This folder contains a Notebook tutorial on quantum random number generation - 
 an application of quantum computing that requires few qubits and offers true random numbers generated using the principles of quantum mechanics.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/RandomNumberGeneration%2FRandomNumberGenerationTutorial.ipynb). Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from command line using the following command: 
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/RandomNumberGeneration%2FRandomNumberGenerationTutorial.ipynb). Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from command line using the following command: 
 
     jupyter notebook RandomNumberGenerationTutorial.ipynb
 

tutorials/SingleQubitGates/README.md

@@ -2,7 +2,7 @@
 
 This tutorial introduces the concept of a quantum gate and walks you through a list of the most common single-qubit gates.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/SingleQubitGates/SingleQubitGates.ipynb).
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/SingleQubitGates/SingleQubitGates.ipynb).
 Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from the command line using the following command:
 
     jupyter notebook SingleQubitGates.ipynb

tutorials/SingleQubitSystemMeasurements/README.md

@@ -2,7 +2,7 @@
 
 This tutorial introduces the basics of quantum measurements for single qubit systems.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/SingleQubitSystemMeasurements/SingleQubitSystemMeasurements.ipynb).
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/SingleQubitSystemMeasurements/SingleQubitSystemMeasurements.ipynb).
 Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from the command line using the following command:
 
     jupyter notebook SingleQubitSystemMeasurements.ipynb

tutorials/VisualizationTools/README.md

@@ -2,7 +2,7 @@
 
 This tutorial discusses the tools offered by the QDK to visualize the state of the quantum programs and the programs themselves.
 
-You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/VisualizationTools/VisualizationTools.ipynb).
+You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?urlpath=/notebooks/tutorials/VisualizationTools/VisualizationTools.ipynb).
 Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/azure/quantum/install-jupyter-qdk), and run the tutorial locally by navigating to this folder and starting the notebook from the command line using the following command:
 
     jupyter notebook VisualizationTools.ipynb