Global replace of references of master to main (#481)
This commit is contained in:
Andres Paz
GitHub
Родитель
8814751c76
Коммит
701b5a2144
|
|
@ -82,7 +82,7 @@ If the topic you want is not claimed, or is not on the list, go ahead and let us
|
|||
|
||||
The Quantum Development Kit is updated monthly (you can find the latest releases in the [release notes](https://docs.microsoft.com/quantum/resources/relnotes). After each new release the Katas have to be updated to use the newly released QDK version.
|
||||
|
||||
Updating the Katas to a different QDK version can be done using PowerShell script [Update-QDKVersion](https://github.com/microsoft/QuantumKatas/blob/master/scripts/Update-QDKVersion.ps1). It takes one parameter, the version to be used, so the command looks like this:
|
||||
Updating the Katas to a different QDK version can be done using PowerShell script [Update-QDKVersion](https://github.com/microsoft/QuantumKatas/blob/main/scripts/Update-QDKVersion.ps1). It takes one parameter, the version to be used, so the command looks like this:
|
||||
|
||||
```powershell
|
||||
PS> ./scripts/Update-QDKVersion.ps1 0.12.20072031
|
||||
|
|
@ -114,11 +114,11 @@ When you contribute any code to the Katas, you need to validate that everything
|
|||
and to [have PowerShell installed](https://github.com/PowerShell/PowerShell#get-powershell).
|
||||
|
||||
4. If you do a bulk update of the katas, testing each of them individually will take too much time; you can streamline the testing using the scripts used by our continuous integration.
|
||||
It is also a good idea to check a representative kata (we recommend [Measurements](https://github.com/microsoft/QuantumKatas/tree/master/Measurements)) manually to see if there is any issue not covered by automated checks, such as different error format, a dramatic performance degradation etc.
|
||||
It is also a good idea to check a representative kata (we recommend [Measurements](https://github.com/microsoft/QuantumKatas/tree/main/Measurements)) manually to see if there is any issue not covered by automated checks, such as different error format, a dramatic performance degradation etc.
|
||||
|
||||
2. **Running on Binder**
|
||||
The Katas can be run online on [Binder](https://mybinder.org); when you make a potentially breaking change (such as an update to the new QDK version or modifying any package dependencies), you need to make sure that this still works.
|
||||
You can check this by pushing your changes to a branch on GitHub and navigating to the Binder link used for the Katas (https://mybinder.org/v2/gh/Microsoft/QuantumKatas/master?filepath=index.ipynb) and change account name (`microsoft`) and branch (`master`) in the url to your GitHub username and branch name, respectively. After that you can navigate to the kata you want to check using the links from index notebook.
|
||||
You can check this by pushing your changes to a branch on GitHub and navigating to the Binder link used for the Katas (https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=index.ipynb) and change account name (`microsoft`) and branch (`main`) in the url to your GitHub username and branch name, respectively. After that you can navigate to the kata you want to check using the links from index notebook.
|
||||
|
||||
3. **Continuous integration**
|
||||
When you open a pull request or add a commit to it, continuous integration pipeline is executed to validate your changes. You can see the details of jobs executed in the "Checks" section on the pull request page; make sure to monitor the results, and if the run fails, try to figure out the reason and fix it.
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=BasicGates%2FBasicGates.ipynb)!
|
||||
You can [run the Basic Gates kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=BasicGates%2FBasicGates.ipynb)!
|
||||
|
||||
#### Theory
|
||||
|
||||
|
|
|
|||
|
|
@ -18,7 +18,7 @@
|
|||
"* You can read more about CHSH game in the [lecture notes](https://cs.uwaterloo.ca/~watrous/CPSC519/LectureNotes/20.pdf) by\n",
|
||||
" John Watrous. \n",
|
||||
"* Q# Samples repository has [an implementation of the CHSH\n",
|
||||
" game](https://github.com/microsoft/Quantum/tree/master/samples/algorithms/chsh-game)\n",
|
||||
" game](https://github.com/microsoft/Quantum/tree/main/samples/algorithms/chsh-game)\n",
|
||||
" that includes an explanation of the history and theory behind the game.\n",
|
||||
"\n",
|
||||
"Each task is wrapped in one operation preceded by the description of the task.\n",
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=CHSHGame%2FCHSHGame.ipynb)!
|
||||
You can [run the CHSH Game kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=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
|
||||
|
|
@ -19,5 +19,5 @@ purely classical strategy.
|
|||
#### Q# Materials
|
||||
|
||||
* Q# Samples repository has [an implementation of the CHSH
|
||||
game](https://github.com/microsoft/Quantum/tree/master/samples/algorithms/chsh-game)
|
||||
game](https://github.com/microsoft/Quantum/tree/main/samples/algorithms/chsh-game)
|
||||
that includes an explanation of the history and theory behind the game.
|
||||
|
|
@ -1,6 +1,6 @@
|
|||
# Welcome!
|
||||
|
||||
You can [run the DeutschJozsaAlgorithm kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/master?filepath=DeutschJozsaAlgorithm%2FDeutschJozsaAlgorithm.ipynb)!
|
||||
You can [run the DeutschJozsaAlgorithm kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=DeutschJozsaAlgorithm%2FDeutschJozsaAlgorithm.ipynb)!
|
||||
|
||||
This kata covers several well-studied algorithms and concepts.
|
||||
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=DistinguishUnitaries%2FDistinguishUnitaries.ipynb)!
|
||||
You can [run the DistinguishUnitaries kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=DistinguishUnitaries%2FDistinguishUnitaries.ipynb)!
|
||||
|
|
@ -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/master?filepath=GHZGame%2FGHZGame.ipynb)!
|
||||
You can [run the GHZ Game kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=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
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=GraphColoring%2FGraphColoring.ipynb)!
|
||||
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 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.
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=GroversAlgorithm%2FGroversAlgorithm.ipynb)!
|
||||
You can [run the GroversAlgorithm kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=GroversAlgorithm%2FGroversAlgorithm.ipynb)!
|
||||
|
||||
#### Theory
|
||||
|
||||
|
|
@ -18,4 +18,4 @@ You can [run the GroversAlgorithm kata as a Jupyter Notebook](https://mybinder.o
|
|||
|
||||
#### Q# materials
|
||||
|
||||
* Q# Samples repository has an [implementation of Grover's search](https://github.com/microsoft/Quantum/tree/master/samples/algorithms/database-search).
|
||||
* Q# Samples repository has an [implementation of Grover's search](https://github.com/microsoft/Quantum/tree/main/samples/algorithms/database-search).
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=JointMeasurements%2FJointMeasurements.ipynb)!
|
||||
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).
|
||||
|
|
|
|||
|
|
@ -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/master?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?filepath=KeyDistribution_BB84%2FKeyDistribution_BB84.ipynb)!
|
||||
|
||||
### Background
|
||||
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=MagicSquareGame%2FMagicSquareGame.ipynb)!
|
||||
You can [run the MagicSquareGame kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=MagicSquareGame%2FMagicSquareGame.ipynb)!
|
||||
|
||||
#### Theory
|
||||
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=Measurements%2FMeasurements.ipynb)!
|
||||
You can [run the Measurements kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=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.
|
||||
|
|
@ -13,8 +13,8 @@ Variations of quantum state discrimination tasks are covered in the paper ["Quan
|
|||
* Task 2.3 is the so-called Wootters/Peres game. See the following three references for more information and in particular
|
||||
the book [3, p. 287] for a nice description of the optimal POVM.
|
||||
|
||||
[1] A. Holevo, “Information-theoretical aspects of quantum measurement,” Problems of Information Transmission, vol. 9, no. 2, pp. 110–118 (1973)
|
||||
[1] A. Holevo, "Information-theoretical aspects of quantum measurement," Problems of Information Transmission, vol. 9, no. 2, pp. 110-118 (1973)
|
||||
|
||||
[2] A. Peres and W. K. Wootters, “Optimal detection of quantum information,” Phys. Rev. Lett., vol. 66, pp. 1119-1122, Mar. 1991.
|
||||
[2] A. Peres and W. K. Wootters, "Optimal detection of quantum information," Phys. Rev. Lett., vol. 66, pp. 1119-1122, Mar. 1991.
|
||||
|
||||
[3] A. Peres, “Quantum Theory: Concepts and Methods,” Kluwer Academic Publishers, 2002.
|
||||
[3] A. Peres, "Quantum Theory: Concepts and Methods," Kluwer Academic Publishers, 2002.
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=PhaseEstimation%2FPhaseEstimation.ipynb)!
|
||||
You can [run the Phase Estimation kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=PhaseEstimation%2FPhaseEstimation.ipynb)!
|
||||
|
||||
#### Theory
|
||||
|
||||
|
|
@ -25,6 +25,6 @@ Iterative phase estimation:
|
|||
|
||||
#### Q# materials
|
||||
|
||||
* [Quantum phase estimation tests](https://github.com/microsoft/QuantumLibraries/blob/master/Standard/tests/QuantumPhaseEstimationTests.qs).
|
||||
* [Bayesian (iterative) phase estimation sample](https://github.com/microsoft/Quantum/tree/master/samples/characterization/phase-estimation).
|
||||
* [Quantum phase estimation tests](https://github.com/microsoft/QuantumLibraries/blob/main/Standard/tests/QuantumPhaseEstimationTests.qs).
|
||||
* [Bayesian (iterative) phase estimation sample](https://github.com/microsoft/Quantum/tree/main/samples/characterization/phase-estimation).
|
||||
|
||||
|
|
|
|||
|
|
@ -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/master?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?filepath=QEC_BitFlipCode%2FQEC_BitFlipCode.ipynb)!
|
||||
|
||||
* This code is described in [the error correction article](https://docs.microsoft.com/quantum/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).
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=QFT%2FQFT.ipynb)!
|
||||
You can [run the QFT kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=QFT%2FQFT.ipynb)!
|
||||
|
||||
#### Theory
|
||||
|
||||
|
|
|
|||
|
|
@ -130,7 +130,7 @@ Each kata is a separate project that includes:
|
|||
|
||||
## 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/master?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?filepath=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.
|
||||
|
||||
|
|
@ -167,7 +167,7 @@ $ git clone https://github.com/Microsoft/QuantumKatas.git
|
|||
> Both Visual Studio 2019 and Visual Studio Code make it easy to clone repositories from within your development environment.
|
||||
> For details, see the [Visual Studio 2019](https://docs.microsoft.com/en-us/azure/devops/repos/git/clone?view=azure-devops&tabs=visual-studio#clone-from-another-git-provider) and [Visual Studio Code](https://code.visualstudio.com/docs/editor/versioncontrol#_cloning-a-repository) documentation.
|
||||
|
||||
If you don't have Git installed, download the katas from https://github.com/Microsoft/QuantumKatas/archive/master.zip.
|
||||
If you don't have Git installed, download the katas from https://github.com/Microsoft/QuantumKatas/archive/main.zip.
|
||||
|
||||
|
||||
### Run a kata as a Jupyter Notebook <a name="kata-as-notebook" /> ###
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@ using the same basic components and the same algorithm.
|
|||
to reduce the number of ancillary qubits needed.
|
||||
* Finally, part IV covers building an in-place quantum subtractor.
|
||||
|
||||
You can [run the RippleCarryAdder kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/master?filepath=RippleCarryAdder%2FRippleCarryAdder.ipynb)!
|
||||
You can [run the RippleCarryAdder kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=RippleCarryAdder%2FRippleCarryAdder.ipynb)!
|
||||
|
||||
#### Theory
|
||||
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=SolveSATWithGrover%2FSolveSATWithGrover.ipynb)!
|
||||
You can [run the SolveSATWithGrover kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=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.
|
||||
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=SuperdenseCoding%2FSuperdenseCoding.ipynb)!
|
||||
You can [run the SuperdenseCoding kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=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/).
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=Superposition%2FSuperposition.ipynb)!
|
||||
You can [run the Superposition kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=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).
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=Teleportation%2FTeleportation.ipynb)!
|
||||
You can [run the Teleportation kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=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/).
|
||||
|
|
|
|||
Двоичные данные
TruthTables/README.md
Двоичные данные
TruthTables/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/master?filepath=UnitaryPatterns%2FUnitaryPatterns.ipynb)!
|
||||
You can [run the Unitary Patterns kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=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
|
||||
|
|
|
|||
|
|
@ -1,6 +1,6 @@
|
|||
name: $(Build.Major).$(Build.Minor).$(BuildId)
|
||||
trigger:
|
||||
- master
|
||||
- main
|
||||
|
||||
variables:
|
||||
Build.Major: 1
|
||||
|
|
|
|||
|
|
@ -6,9 +6,9 @@
|
|||
"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/master?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?filepath=index.ipynb)).\n",
|
||||
"\n",
|
||||
"To run the katas and tutorials locally, follow [these installation instructions](https://github.com/microsoft/QuantumKatas/blob/master/README.md#kata-locally).\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",
|
||||
"> 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."
|
||||
]
|
||||
|
|
@ -119,7 +119,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 on Binder (if not, use [this link](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/master?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 on Binder (if not, 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",
|
||||
"\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",
|
||||
|
|
|
|||
|
|
@ -18,7 +18,7 @@
|
|||
"* Imaginary exponents\n",
|
||||
"* Polar representation\n",
|
||||
"\n",
|
||||
"If you need to look up some formulas quickly, you can find them in [this cheatsheet](https://github.com/microsoft/QuantumKatas/blob/master/quickref/qsharp-quick-reference.pdf).\n",
|
||||
"If you need to look up some formulas quickly, you can find them in [this cheatsheet](https://github.com/microsoft/QuantumKatas/blob/main/quickref/qsharp-quick-reference.pdf).\n",
|
||||
"\n",
|
||||
"If you are curious to learn more, you can find more information at [Wikipedia](https://en.wikipedia.org/wiki/Complex_number)."
|
||||
]
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=tutorials/ComplexArithmetic/ComplexArithmetic.ipynb).
|
||||
You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=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
|
||||
|
|
|
|||
|
|
@ -498,7 +498,7 @@
|
|||
"\n",
|
||||
"Two examples of the algorithm in action are shown below using a simulation with 8 qubits. \n",
|
||||
"\n",
|
||||
"> We use visualization produced by the [Quantum State Visualizer](https://github.com/microsoft/Quantum/tree/master/samples/runtime/state-visualizer) sample that is part of the QDK. It plots the amplitudes of each basis state as a histogram, and allows to track the changes in the amplitudes throughout the algorithm simulation.\n",
|
||||
"> We use visualization produced by the [Quantum State Visualizer](https://github.com/microsoft/Quantum/tree/main/samples/runtime/state-visualizer) sample that is part of the QDK. It plots the amplitudes of each basis state as a histogram, and allows to track the changes in the amplitudes throughout the algorithm simulation.\n",
|
||||
"\n",
|
||||
"First, consider the `PhaseOracle_One` oracle discussed above, which implements a constant function $f(x) = 1$. Observe how the final step of the algorithm converges on a measurement of 0 for all qubits, as expected for a constant function:\n",
|
||||
"\n",
|
||||
|
|
@ -625,7 +625,7 @@
|
|||
"We hope you've enjoyed this tutorial and learned a lot from it! If you're looking to learn more about quantum computing and Q#, here are some suggestions:\n",
|
||||
"\n",
|
||||
"* The [Quantum Katas](https://github.com/microsoft/QuantumKatas/) are sets of programming exercises on quantum computing that can be solved using Q#. They cover a variety of topics, from the basics like the concepts of superposition and measurements to more interesting algorithms like Grover's search.\n",
|
||||
"* In particular, [DeutschJozsaAlgorithm kata](https://github.com/microsoft/QuantumKatas/tree/master/DeutschJozsaAlgorithm) offers you more exercises on quantum oracles, a different presentation of Deutsch–Jozsa algorithm, and a couple of similar algorithms to explore."
|
||||
"* In particular, [DeutschJozsaAlgorithm kata](https://github.com/microsoft/QuantumKatas/tree/main/DeutschJozsaAlgorithm) offers you more exercises on quantum oracles, a different presentation of Deutsch–Jozsa algorithm, and a couple of similar algorithms to explore."
|
||||
]
|
||||
}
|
||||
],
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=tutorials/ExploringDeutschJozsaAlgorithm%2FDeutschJozsaAlgorithmTutorial.ipynb). Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/quantum/install-guide/jupyter), 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?filepath=tutorials/ExploringDeutschJozsaAlgorithm%2FDeutschJozsaAlgorithmTutorial.ipynb). Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/quantum/install-guide/jupyter), 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
|
||||
|
||||
|
|
|
|||
|
|
@ -18,10 +18,10 @@
|
|||
"\n",
|
||||
"Grover's algorithm is a massive topic that can hardly be covered in a single tutorial. This tutorial **will not**:\n",
|
||||
"* walk you through the Grover's algorithm implementation from scratch (the code you'll write in this tutorial will rely on routines implemented for you) - \n",
|
||||
" if you're looking to learn the low-level implementation details, check out [GroversAlgorithm quantum kata](https://github.com/microsoft/QuantumKatas/tree/master/GroversAlgorithm),\n",
|
||||
" if you're looking to learn the low-level implementation details, check out [GroversAlgorithm quantum kata](https://github.com/microsoft/QuantumKatas/tree/main/GroversAlgorithm),\n",
|
||||
"* teach you to code quantum oracles that implement interesting functions for Grover's algorithm to invert - \n",
|
||||
" if you're looking to learn more about implementing quantum oracles, check out [SolveSATWithGrover](https://github.com/microsoft/QuantumKatas/tree/master/SolveSATWithGrover) \n",
|
||||
" or [GraphColoring](https://github.com/microsoft/QuantumKatas/tree/master/GraphColoring) quantum katas which cover writing oracles for solving SAT problems and graph coloring problems, respectively.\n",
|
||||
" if you're looking to learn more about implementing quantum oracles, check out [SolveSATWithGrover](https://github.com/microsoft/QuantumKatas/tree/main/SolveSATWithGrover) \n",
|
||||
" or [GraphColoring](https://github.com/microsoft/QuantumKatas/tree/main/GraphColoring) quantum katas which cover writing oracles for solving SAT problems and graph coloring problems, respectively.\n",
|
||||
"\n",
|
||||
"Let's go!"
|
||||
]
|
||||
|
|
@ -57,7 +57,7 @@
|
|||
"> * We conclude that the formula can be satisfied using the variables assignment $x = (true, false)$.\n",
|
||||
"\n",
|
||||
"SAT problem is an excellent match for Grover's search algorithm: it maps naturally to the description of the problem solved by the algorithm, and can be implemented relatively easily using quantum gates. \n",
|
||||
"For more details on implementing instances of SAT problem as quantum oracles, see [SolveSATWithGrover quantum kata](https://github.com/Microsoft/QuantumKatas/tree/master/SolveSATWithGrover)."
|
||||
"For more details on implementing instances of SAT problem as quantum oracles, see [SolveSATWithGrover quantum kata](https://github.com/Microsoft/QuantumKatas/tree/main/SolveSATWithGrover)."
|
||||
]
|
||||
},
|
||||
{
|
||||
|
|
@ -565,12 +565,12 @@
|
|||
"\n",
|
||||
"* The [Quantum Katas](https://github.com/microsoft/QuantumKatas/) are sets of programming exercises on quantum computing that can be solved using Q#. \n",
|
||||
" They cover a variety of topics, from the basics like the concepts of superposition and measurements to more interesting algorithms like Grover's search.\n",
|
||||
"* In particular, [GroversAlgorithm kata](https://github.com/microsoft/QuantumKatas/tree/master/GroversAlgorithm) \n",
|
||||
"* In particular, [GroversAlgorithm kata](https://github.com/microsoft/QuantumKatas/tree/main/GroversAlgorithm) \n",
|
||||
" offers you exercises on implementing simple quantum oracles and a step-by-step implementation of Grover search algorithm \n",
|
||||
" (all the internals that were hidden under the hood of `GroversAlgorithm_Loop` operation in this tutorial!).\n",
|
||||
"* [SolveSATWithGrover kata](https://github.com/microsoft/QuantumKatas/tree/master/SolveSATWithGrover) teaches you how to implement quantum oracles for SAT problems, \n",
|
||||
"* [SolveSATWithGrover kata](https://github.com/microsoft/QuantumKatas/tree/main/SolveSATWithGrover) teaches you how to implement quantum oracles for SAT problems, \n",
|
||||
" starting with the simple building blocks like implementing AND and OR operations in a quantum way.\n",
|
||||
"* [GraphColoring kata](https://github.com/microsoft/QuantumKatas/tree/master/GraphColoring) is another interesting kata that teaches you how to implement quantum oracles for graph coloring problems."
|
||||
"* [GraphColoring kata](https://github.com/microsoft/QuantumKatas/tree/main/GraphColoring) is another interesting kata that teaches you how to implement quantum oracles for graph coloring problems."
|
||||
]
|
||||
}
|
||||
],
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=tutorials/ExploringGroversAlgorithm%2FExploringGroversAlgorithmTutorial.ipynb).
|
||||
You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/ExploringGroversAlgorithm%2FExploringGroversAlgorithmTutorial.ipynb).
|
||||
Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/quantum/install-guide#develop-with-jupyter-notebooks), 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
|
||||
|
|
|
|||
|
|
@ -264,9 +264,9 @@
|
|||
"We hope you've enjoyed this tutorial and learned a lot from it! If you're looking to learn more about quantum computing and Q#, here are some suggestions:\n",
|
||||
"\n",
|
||||
"* The [Quantum Katas](https://github.com/microsoft/QuantumKatas/) are sets of programming exercises on quantum computing that can be solved using Q#. They cover a variety of topics, from the basics like the concepts of superposition and measurements to more interesting algorithms like Grover's search.\n",
|
||||
"* In particular, [GroverSearch kata](https://github.com/microsoft/QuantumKatas/tree/master/GroversAlgorithm) offers you exercises on implementing simple quantum oracles and a step-by-step implementation of Grover search algorithm (all the internals that were hidden under the hood of `GroversAlgorithm_Loop` operation in this tutorial!).\n",
|
||||
"* [SolveSATWithGrover kata](https://github.com/microsoft/QuantumKatas/tree/master/SolveSATWithGrover) teaches you how to implement quantum oracles for SAT problems, starting with the simple building blocks like implementing AND and OR operations in a quantum way.\n",
|
||||
"* [GraphColoring kata](https://github.com/microsoft/QuantumKatas/tree/master/GraphColoring) is another interesting kata that teaches you how to implement quantum oracles for graph coloring problems."
|
||||
"* In particular, [GroverSearch kata](https://github.com/microsoft/QuantumKatas/tree/main/GroversAlgorithm) offers you exercises on implementing simple quantum oracles and a step-by-step implementation of Grover search algorithm (all the internals that were hidden under the hood of `GroversAlgorithm_Loop` operation in this tutorial!).\n",
|
||||
"* [SolveSATWithGrover kata](https://github.com/microsoft/QuantumKatas/tree/main/SolveSATWithGrover) teaches you how to implement quantum oracles for SAT problems, starting with the simple building blocks like implementing AND and OR operations in a quantum way.\n",
|
||||
"* [GraphColoring kata](https://github.com/microsoft/QuantumKatas/tree/main/GraphColoring) is another interesting kata that teaches you how to implement quantum oracles for graph coloring problems."
|
||||
]
|
||||
}
|
||||
],
|
||||
|
|
|
|||
|
|
@ -21,7 +21,7 @@
|
|||
"* Tensor product\n",
|
||||
"* Eigenvalues and eigenvectors\n",
|
||||
"\n",
|
||||
"If you need to look up some formulas quickly, you can find them in [this cheatsheet](https://github.com/microsoft/QuantumKatas/blob/master/quickref/qsharp-quick-reference.pdf)."
|
||||
"If you need to look up some formulas quickly, you can find them in [this cheatsheet](https://github.com/microsoft/QuantumKatas/blob/main/quickref/qsharp-quick-reference.pdf)."
|
||||
]
|
||||
},
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=tutorials/LinearAlgebra/LinearAlgebra.ipynb).
|
||||
You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=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
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=tutorials/MultiQubitGates/MultiQubitGates.ipynb).
|
||||
You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/MultiQubitGates/MultiQubitGates.ipynb).
|
||||
Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/quantum/install-guide#develop-with-jupyter-notebooks), 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
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=tutorials/MultiQubitSystems/MultiQubitSystems.ipynb).
|
||||
You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/MultiQubitSystems/MultiQubitSystems.ipynb).
|
||||
Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/quantum/install-guide#develop-with-jupyter-notebooks), 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
|
||||
|
|
|
|||
|
|
@ -305,7 +305,7 @@
|
|||
"This tutorial covered classifying artificial data, taking advantage of its simple structure. Classifying real data will require more complex models - same as in traditional machine learning.\n",
|
||||
"\n",
|
||||
"* Check out [introduction to quantum machine learning](https://docs.microsoft.com/quantum/libraries/machine-learning/) at Microsoft Quantum Development Kit documentation, which features a more interesting example - classifying half-moons dataset.\n",
|
||||
"* [Quantum machine learning samples](https://github.com/microsoft/Quantum/tree/master/samples/machine-learning) offer examples of classifying several more datasets."
|
||||
"* [Quantum machine learning samples](https://github.com/microsoft/Quantum/tree/main/samples/machine-learning) offer examples of classifying several more datasets."
|
||||
]
|
||||
}
|
||||
],
|
||||
|
|
|
|||
|
|
@ -184,7 +184,7 @@
|
|||
"\n",
|
||||
"The first step of the quantum classification process is encoding the raw feature data into the amplitudes of a quantum state. \n",
|
||||
"\n",
|
||||
"> If you need a refresher on quantum state representation, see [Multi-qubit Systems tutorial](https://github.com/microsoft/QuantumKatas/tree/master/tutorials/MultiQubitSystems).\n",
|
||||
"> If you need a refresher on quantum state representation, see [Multi-qubit Systems tutorial](https://github.com/microsoft/QuantumKatas/tree/main/tutorials/MultiQubitSystems).\n",
|
||||
"\n",
|
||||
"An $n$-qubit quantum state can be described by $2^n$ amplitudes. \n",
|
||||
"If the data has $M$ features, it can be encoded in the amplitudes of a state with $n = \\lceil \\log_2 M \\rceil$ qubits. \n",
|
||||
|
|
@ -374,7 +374,7 @@
|
|||
"[$R_x$](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.intrinsic.rx), \n",
|
||||
"[$R_y$](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.intrinsic.ry) and\n",
|
||||
"[$R_z$](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.intrinsic.rz). \n",
|
||||
"(You can read more about these gates in the [single-qubit gates tutorial](https://github.com/microsoft/QuantumKatas/tree/master/tutorials/SingleQubitGates).)\n",
|
||||
"(You can read more about these gates in the [single-qubit gates tutorial](https://github.com/microsoft/QuantumKatas/tree/main/tutorials/SingleQubitGates).)\n",
|
||||
"We will make an educated guess and decide to use a single [$R_y$](https://docs.microsoft.com/qsharp/api/qsharp/microsoft.quantum.intrinsic.ry) gate - we will see why it works for our data later. Here is our model circuit:\n",
|
||||
"\n",
|
||||
"<img src=\"./img/2-classification-circuit.PNG\" width=250 alt=\"Circuit consisting of rotation gate\" />\n",
|
||||
|
|
|
|||
|
|
@ -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/master?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?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.
|
||||
|
||||
The Q# project in this folder contains the back-end of the tutorial and is not designed for direct use.
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=tutorials/Qubit/Qubit.ipynb).
|
||||
You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/Qubit/Qubit.ipynb).
|
||||
Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/quantum/install-guide#develop-with-jupyter-notebooks), 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
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=tutorials/RandomNumberGeneration%2FRandomNumberGenerationTutorial.ipynb). Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/quantum/install-guide/jupyter), 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?filepath=tutorials/RandomNumberGeneration%2FRandomNumberGenerationTutorial.ipynb). Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/quantum/install-guide/jupyter), 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
|
||||
|
||||
|
|
|
|||
|
|
@ -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/master?filepath=tutorials/SingleQubitGates/SingleQubitGates.ipynb).
|
||||
You can run the tutorial online [here](https://mybinder.org/v2/gh/Microsoft/QuantumKatas/main?filepath=tutorials/SingleQubitGates/SingleQubitGates.ipynb).
|
||||
Alternatively, you can install Jupyter and Q# on your machine, as described [here](https://docs.microsoft.com/quantum/install-guide#develop-with-jupyter-notebooks), 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
|
||||
|
|
|
|||
|
|
@ -16,7 +16,7 @@
|
|||
"* Ket-bra representation\n",
|
||||
"* The most important single-qubit gates\n",
|
||||
"\n",
|
||||
"A quick summary of the gates can also be found in [this cheatsheet](https://github.com/microsoft/QuantumKatas/blob/master/quickref/qsharp-quick-reference.pdf)."
|
||||
"A quick summary of the gates can also be found in [this cheatsheet](https://github.com/microsoft/QuantumKatas/blob/main/quickref/qsharp-quick-reference.pdf)."
|
||||
]
|
||||
},
|
||||
{
|
||||
|
|
|
|||
|
|
@ -10,8 +10,8 @@
|
|||
<Description>Microsoft's Quantum Katas support.</Description>
|
||||
<Copyright>© Microsoft Corporation. All rights reserved.</Copyright>
|
||||
<PackageReleaseNotes>See: https://docs.microsoft.com/en-us/quantum/relnotes/</PackageReleaseNotes>
|
||||
<PackageLicenseUrl>https://github.com/Microsoft/QuantumKatas/raw/master/LICENSE</PackageLicenseUrl>
|
||||
<PackageProjectUrl>https://github.com/Microsoft/QuantumKatas/tree/master/Microsoft.Quantum.Katas</PackageProjectUrl>
|
||||
<PackageLicenseUrl>https://github.com/Microsoft/QuantumKatas/raw/main/LICENSE</PackageLicenseUrl>
|
||||
<PackageProjectUrl>https://github.com/Microsoft/QuantumKatas/tree/main/Microsoft.Quantum.Katas</PackageProjectUrl>
|
||||
<PackageIcon>qdk-nuget-icon.png</PackageIcon>
|
||||
<PackageTags>Quantum Q# Qsharp</PackageTags>
|
||||
</PropertyGroup>
|
||||
|
|
|
|||
Загрузка…
Ссылка в новой задаче