Improve several readme files (#48)

* Add link to teleport demo
* Remove en-us from links to Q# documentation

BasicGates/README.md

@@ -10,5 +10,5 @@ The basic gates kata covers the basic operations (a.k.a. "gates") used in quantu
 #### Q# materials
 
 * Basic gates provided in Q# belong to the `Microsoft.Quantum.Primitive` namespace and are listed [here](https://docs.microsoft.com/qsharp/api/prelude/microsoft.quantum.primitive).
-* Using controlled and adjoint versions of gates is covered in the Q# documentation on [operation types](https://docs.microsoft.com/en-us/quantum/language/type-model#operation-and-function-types).
-* Defining controlled and adjoint versions of gates is covered in the Q# documentation on [operation definitions](https://docs.microsoft.com/en-us/quantum/language/file-structure#operation-definitions).
+* Using controlled and adjoint versions of gates is covered in the Q# documentation on [operation types](https://docs.microsoft.com/quantum/language/type-model#operation-and-function-types).
+* Defining controlled and adjoint versions of gates is covered in the Q# documentation on [operation definitions](https://docs.microsoft.com/quantum/language/file-structure#operation-definitions).

DeutschJozsaAlgorithm/README.md

@@ -4,7 +4,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/en-us/quantum/concepts/oracles).
+A good introduction to quantum oracles can be found in [the Q# documentation](https://docs.microsoft.com/quantum/concepts/oracles).
 
 #### Deutsch-Jozsa algorithm
 

JointMeasurements/README.md

@@ -3,7 +3,7 @@
 The joint measurements kata covers the usage of joint measurements, also known as parity measurements, - 
 measurements involving multiple qubits.
 
-In Q# they are implemented as the [Measure](https://docs.microsoft.com/en-us/qsharp/api/prelude/microsoft.quantum.primitive.measure) operation.
+In Q# they are implemented as the [Measure](https://docs.microsoft.com/qsharp/api/prelude/microsoft.quantum.primitive.measure) operation.
 
-* You can read more about measurements of multi-qubit Pauli operators in the [Q# documentation](https://docs.microsoft.com/en-us/quantum/concepts/pauli-measurements).
+* You can read more about measurements of multi-qubit Pauli operators in the [Q# documentation](https://docs.microsoft.com/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).

QEC_BitFlipCode/README.md

@@ -4,6 +4,6 @@ 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.
 
-* This code is described in [the error correction article](https://docs.microsoft.com/en-us/quantum/libraries/error-correction) in the Q# documentation.
+* This code is described in [the error correction article](https://docs.microsoft.com/quantum/libraries/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).
 * An introduction to QEC can be found in ["Quantum Error Correction for Beginners"](https://arxiv.org/pdf/0905.2794.pdf), see section IV for more information on the 3-qubit code.

Superposition/README.md

@@ -1,12 +1,12 @@
 # Welcome!
 
 The superposition kata covers the following topics:
- - basic single-qubit and multi-qubit gates
- - superposition
- - flow control and recursion in Q#
+ - basic single-qubit and multi-qubit gates,
+ - superposition,
+ - flow control and recursion in Q#.
 
-It is recommended to complete the basic gates kata 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.Primitive](https://docs.microsoft.com/en-us/qsharp/api/prelude/microsoft.quantum.primitive).
+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.Primitive](https://docs.microsoft.com/qsharp/api/prelude/microsoft.quantum.primitive).
 
 You can find detailed coverage of Bell states and their creation [here](https://blogs.msdn.microsoft.com/uk_faculty_connection/2018/02/06/a-beginners-guide-to-quantum-computing-and-q/).
 
-For the syntax of flow control statements in Q#, see [the Q# documentation](https://docs.microsoft.com/en-us/quantum/language/statements#control-flow).
+For the syntax of flow control statements in Q#, see [the Q# documentation](https://docs.microsoft.com/quantum/language/statements#control-flow).

Teleportation/README.md

@@ -3,7 +3,8 @@
 The teleportation kata covers quantum teleportation - a protocol which allows to communicate a quantum state
 using only classical communication and previously shared quantum entanglement.
 
- - Teleportation is described as an example in [the Q# documentation](https://docs.microsoft.com/en-us/quantum/techniques/putting-it-all-together).
+ - Teleportation is described as an example in [the Q# documentation](https://docs.microsoft.com/quantum/techniques/putting-it-all-together).
  - 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/).
 
 The principle of deferred measurement, applied to teleportation protocol, is described in Nielsen & Chuang, section 4.4 (pp. 185-187).