2019-04-30 02:35:17 +03:00
{
"cells": [
{
"cell_type": "markdown",
"metadata": {},
"source": [
2019-07-11 20:35:53 +03:00
"# Quantum Katas and Tutorials as Jupyter Notebooks\n",
"\n",
2020-09-11 03:17:19 +03:00
"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",
2019-07-11 20:35:53 +03:00
"\n",
2020-09-11 03:17:19 +03:00
"To run the katas and tutorials locally, follow [these installation instructions](https://github.com/microsoft/QuantumKatas/blob/main/README.md#kata-locally).\n",
2020-04-24 21:15:13 +03:00
"\n",
"> 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."
2020-01-09 20:34:34 +03:00
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
2020-10-12 11:16:24 +03:00
"## Learning path\n",
2019-07-11 20:35:53 +03:00
"\n",
2020-10-12 11:16:24 +03:00
"Here is the learning path we suggest you to follow if you are starting to learn quantum computing and quantum programming. Once you're comfortable with the basics, you're welcome to jump ahead to the topics that pique your interest!\n",
"\n",
"#### Quantum Computing Concepts: Qubits and Gates\n",
"\n",
"* **[Complex arithmetic (tutorial)](./tutorials/ComplexArithmetic/ComplexArithmetic.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Learn about complex numbers and the mathematics required to work with quantum computing.\n",
2020-10-12 11:16:24 +03:00
"* **[Linear algebra (tutorial)](./tutorials/LinearAlgebra/LinearAlgebra.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Learn about vectors and matrices used to represent quantum states and quantum operations.\n",
2020-10-12 11:16:24 +03:00
"* **[The qubit (tutorial)](./tutorials/Qubit/Qubit.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Learn what a qubit is.\n",
2020-10-12 11:16:24 +03:00
"* **[Single-qubit gates (tutorial)](./tutorials/SingleQubitGates/SingleQubitGates.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Learn what a quantum gate is and about the most common single-qubit gates.\n",
2019-04-30 02:35:17 +03:00
"* **[Basic quantum computing gates](./BasicGates/BasicGates.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Learn to apply the most common gates used in quantum computing.\n",
2020-10-12 11:16:24 +03:00
"* **[Multi-qubit systems (tutorial)](./tutorials/MultiQubitSystems/MultiQubitSystems.ipynb)**.\n",
" Learn to represent multi-qubit systems.\n",
"* **[Multi-qubit gates (tutorial)](./tutorials/MultiQubitGates/MultiQubitGates.ipynb)**.\n",
" Learn about the most common multi-qubit gates.\n",
2019-04-30 02:35:17 +03:00
"* **[Superposition](./Superposition/Superposition.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Learn to prepare superposition states.\n",
2020-10-12 11:16:24 +03:00
"\n",
"#### Quantum Computing Concepts: Measurements\n",
"\n",
2020-12-19 05:19:13 +03:00
"* **[Single-qubit measurements (tutorial)](./tutorials/SingleQubitSystemMeasurements/SingleQubitSystemMeasurements.ipynb)**.\n",
" Learn what quantum measurement is and how to use it for single-qubit systems.\n",
2019-04-30 02:35:17 +03:00
"* **[Measurements](./Measurements/Measurements.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Learn to distinguish quantum states using measurements.\n",
2020-10-12 11:16:24 +03:00
"* **[Distinguish unitaries](./DistinguishUnitaries/DistinguishUnitaries.ipynb)**\\*.\n",
2020-08-31 22:10:04 +03:00
" Learn to distinguish unitaries by designing and performing experiments with them.\n",
2020-10-12 11:16:24 +03:00
"* **[Joint measurements](./JointMeasurements/JointMeasurements.ipynb)**\\*.\n",
2019-11-14 07:52:49 +03:00
" Learn about using joint (parity) measurements to distinguish quantum states and to perform state transformations.\n",
2019-06-01 04:42:16 +03:00
"\n",
2020-10-12 11:16:24 +03:00
"#### Simple Algorithms\n",
"\n",
"* **[Random number generation (tutorial)](./tutorials/RandomNumberGeneration/RandomNumberGenerationTutorial.ipynb)**.\n",
" Learn to generate random numbers using the principles of quantum computing.\n",
2019-11-14 07:52:49 +03:00
"* **[Teleportation](./Teleportation/Teleportation.ipynb)**. \n",
" Implement standard teleportation protocol and its variations.\n",
"* **[Superdense coding](./SuperdenseCoding/SuperdenseCoding.ipynb)**. \n",
" Implement the superdense coding protocol.\n",
2020-10-12 11:16:24 +03:00
"\n",
"#### Quantum Oracles and Simple Oracle Algorithms\n",
"\n",
"* **[Exploring Deutsch–Jozsa algorithm (tutorial)](./tutorials/ExploringDeutschJozsaAlgorithm/DeutschJozsaAlgorithmTutorial.ipynb)**.\n",
" Learn to implement classical functions and equivalent quantum oracles, \n",
" and compare the quantum solution to the Deutsch–Jozsa problem to a classical one.\n",
2019-04-30 02:35:17 +03:00
"* **[Deutsch–Jozsa algorithm](./DeutschJozsaAlgorithm/DeutschJozsaAlgorithm.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Learn about quantum oracles which implement classical functions, and implement Bernstein–Vazirani and Deutsch–Jozsa algorithms.\n",
2019-06-01 04:42:16 +03:00
"\n",
2020-10-12 11:16:24 +03:00
"#### Grover's search algorithm\n",
2019-06-19 08:46:50 +03:00
"\n",
2020-10-12 11:16:24 +03:00
"* **[Implementing Grover's algorithm](./GroversAlgorithm/GroversAlgorithm.ipynb)**. \n",
2019-11-14 07:52:49 +03:00
" Learn about Grover's search algorithm and how to write quantum oracles to use with it.\n",
2020-10-12 11:16:24 +03:00
"* **[Exploring Grover's search algorithm (tutorial)](./tutorials/ExploringGroversAlgorithm/ExploringGroversAlgorithmTutorial.ipynb)**.\n",
" Learn more about Grover's search algorithm, picking up where the [Grover's algorithm kata](./GroversAlgorithm/GroversAlgorithm.ipynb) left off.\n",
2019-11-14 07:52:49 +03:00
"* **[Solving SAT problems using Grover's algorithm](./SolveSATWithGrover/SolveSATWithGrover.ipynb)**. \n",
" Explore Grover's search algorithm, using SAT problems as an example. \n",
" Learn to implement quantum oracles based on the problem description instead of a hard-coded answer. \n",
" Use Grover's algorithm to solve problems with an unknown number of solutions.\n",
2019-07-23 03:38:57 +03:00
"* **[Solving graph coloring problems using Grover's algorithm](./GraphColoring/GraphColoring.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Continue the exploration of Grover's search algorithm, using graph coloring problems as an example.\n",
2019-06-19 08:46:50 +03:00
"\n",
2020-06-05 22:17:51 +03:00
"#### Tools and libraries/Building up to Shor's algorithm\n",
"\n",
"* **[Quantum Fourier transform](./QFT/QFT.ipynb)**.\n",
" Learn to implement quantum Fourier transform and to use it to perform simple state transformations.\n",
"* **[Phase estimation](./PhaseEstimation/PhaseEstimation.ipynb)**.\n",
" Learn about phase estimation algorithms.\n",
"\n",
2019-06-01 04:42:16 +03:00
"#### Entanglement games\n",
"\n",
2019-05-24 01:53:02 +03:00
"* **[CHSH game](./CHSHGame/CHSHGame.ipynb)**.\n",
2020-10-12 11:16:24 +03:00
"* **[GHZ game](./GHZGame/GHZGame.ipynb)**.\n",
"* **[Mermin-Peres magic square game](./MagicSquareGame/MagicSquareGame.ipynb)**.\n",
2019-04-30 02:35:17 +03:00
"\n",
2020-02-04 09:04:16 +03:00
"#### Reversible computing\n",
"\n",
"* **[Truth tables](./TruthTables/TruthTables.ipynb)**.\n",
" Learn to represent and manipulate Boolean functions as truth tables and to implement them as quantum operations.\n",
"* **[Ripple-carry adder](./RippleCarryAdder/RippleCarryAdder.ipynb)**.\n",
" Build a ripple-carry adder on a quantum computer.\n",
"\n",
2019-07-02 03:43:01 +03:00
"#### Miscellaneous\n",
"\n",
2019-10-05 22:57:44 +03:00
"* **[BB84 protocol](./KeyDistribution_BB84/KeyDistribution_BB84.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Implement the BB84 key distribution algorithm.\n",
2019-07-02 03:43:01 +03:00
"* **[Bit-flip error correcting code](./QEC_BitFlipCode/QEC_BitFlipCode.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Learn about a 3-qubit error correcting code for protecting against bit-flip errors.\n",
2020-10-12 11:16:24 +03:00
"* **[Unitary patterns](./UnitaryPatterns/UnitaryPatterns.ipynb)**.\n",
2019-11-14 07:52:49 +03:00
" Learn to implement unitaries with matrices that follow certain patterns of zero and non-zero elements.\n",
2020-10-12 11:16:24 +03:00
"* **[Quantum classification (tutorial)](./tutorials/QuantumClassification/ExploringQuantumClassificationLibrary.ipynb)**.\n",
" Learn about circuit-centric classifiers and the quantum machine learning library included in the QDK.\n",
2019-07-02 03:43:01 +03:00
"\n",
2020-10-12 11:16:24 +03:00
"For a full list of Quantum Katas available as Q# projects instead of Jupyter Notebooks, see the [QuantumKatas repository](https://github.com/Microsoft/QuantumKatas#learning-path)."
2020-01-09 20:34:34 +03:00
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
2019-07-11 20:35:53 +03:00
"## Getting Started with Kata Notebooks and Tutorials\n",
2019-04-30 02:35:17 +03:00
"\n",
"Each kata notebook presents the tasks of the respective kata (Q# project) in Jupyter Notebook format. This makes getting started with the katas a lot easier - you don't need to install anything locally to try them out!\n",
"\n",
2019-07-11 20:35:53 +03:00
"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",
2020-10-12 11:16:24 +03:00
"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",
2019-04-30 02:35:17 +03:00
"\n",
2019-07-11 20:35:53 +03:00
"* Each tutorial or kata notebook contains a sequence of tasks on the topic, progressing from trivial to challenging.\n",
2019-04-30 02:35:17 +03:00
"* Each task is defined in a separate code cell, preceded by the description of the task in a Markdown cell.\n",
" Your goal is to fill in the blanks in the code (marked with `// ...` comments) with some Q# code that solves the task. \n",
"* To verify your solution, run the code cell using Ctrl + Enter (or ⌘ + Enter on macOS). This will invoke the test covering the task and let you know whether it passes or fails, and if it fails, what the error is.\n",
2019-07-11 20:35:53 +03:00
"* You can find pointers to reference materials you might need to solve the tasks, both on quantum computing and on Q#, either in the beginning of the tutorial or the kata or next to the task to which they are relevant.\n",
2020-10-12 11:16:24 +03:00
"* You can find reference solutions in `ReferenceImplementation.qs` files of the corresponding katas or tutorials.\n",
"* A lot of katas and tutorials have *workbooks* - detailed explanations of task solutions. Feel free to look them up if you're stuck!"
2019-04-30 02:35:17 +03:00
]
}
],
"metadata": {
"kernelspec": {
"display_name": "Q#",
"language": "qsharp",
"name": "iqsharp"
},
"language_info": {
"file_extension": ".qs",
"mimetype": "text/x-qsharp",
"name": "qsharp",
2020-07-14 11:39:49 +03:00
"version": "0.12"
2019-04-30 02:35:17 +03:00
}
},
"nbformat": 4,
"nbformat_minor": 2
}