Update links to John Watrous's lecture notes (#585)
This commit is contained in:
Vincent van Wingerden
GitHub
Родитель
dfd43cd5dd
Коммит
19f9d1f191
|
|
@ -18,7 +18,7 @@
|
|||
"> * ∧ is the standard bitwise AND operator.\n",
|
||||
"> * ⊕ is the exclusive or, or XOR operator, so (P ⊕ Q) is true if exactly one of P and Q is true.\n",
|
||||
"\n",
|
||||
"* You can read more about CHSH game in the [lecture notes](https://cs.uwaterloo.ca/~watrous/CPSC519/LectureNotes/20.pdf) by\n",
|
||||
"* You can read more about CHSH game in the [lecture notes](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.20.pdf) by\n",
|
||||
" John Watrous. \n",
|
||||
"* Q# Samples repository has [an implementation of the CHSH\n",
|
||||
" game](https://github.com/microsoft/Quantum/tree/main/samples/algorithms/chsh-game)\n",
|
||||
|
|
|
|||
|
|
@ -13,7 +13,7 @@ purely classical strategy.
|
|||
|
||||
#### Theory
|
||||
|
||||
* [Lecture 20](https://cs.uwaterloo.ca/~watrous/CPSC519/LectureNotes/20.pdf) by
|
||||
* [Lecture 20](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.20.pdf) by
|
||||
John Watrous.
|
||||
|
||||
#### Q# Materials
|
||||
|
|
|
|||
|
|
@ -335,7 +335,7 @@
|
|||
" \n",
|
||||
"* You can read more about the Deutsch-Jozsa algorithms and explore its finer points in the [ExploringDeutschJozsaAlgorithm tutorial](../tutorials/ExploringDeutschJozsaAlgorithm/DeutschJozsaAlgorithmTutorial.ipynb).\n",
|
||||
"* You can read more about the Deutsch-Jozsa algorithm in [Wikipedia](https://en.wikipedia.org/wiki/Deutsch%E2%80%93Jozsa_algorithm).\n",
|
||||
"* [Lecture 5: A simple searching algorithm; the Deutsch-Jozsa algorithm](https://cs.uwaterloo.ca/~watrous/CPSC519/LectureNotes/05.pdf)."
|
||||
"* [Lecture 5: A simple searching algorithm; the Deutsch-Jozsa algorithm](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.05.pdf)."
|
||||
]
|
||||
},
|
||||
{
|
||||
|
|
|
|||
|
|
@ -14,7 +14,7 @@ This algorithm has no practical use, but it is famous for being one of the first
|
|||
|
||||
* A good place to start is [Wikipedia](https://en.wikipedia.org/wiki/Deutsch%E2%80%93Jozsa_algorithm).
|
||||
* Nielsen, M. A. & Chuang, I. L. (2010). Quantum Computation and Quantum Information. pp. 34-36
|
||||
* [Lecture 5: A simple searching algorithm; the Deutsch-Jozsa algorithm](https://cs.uwaterloo.ca/~watrous/CPSC519/LectureNotes/05.pdf)
|
||||
* [Lecture 5: A simple searching algorithm; the Deutsch-Jozsa algorithm](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.05.pdf)
|
||||
|
||||
#### Bernstein-Vazirani algorithm
|
||||
|
||||
|
|
|
|||
|
|
@ -21,7 +21,7 @@
|
|||
"* ⊕ is the exclusive or, or XOR operator, so (P ⊕ Q) is true if exactly one of P and Q is true.\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"* You can read more about the GHZ game in the [lecture notes](https://cs.uwaterloo.ca/~watrous/CPSC519/LectureNotes/20.pdf) by John Watrous. \n",
|
||||
"* You can read more about the GHZ game in the [lecture notes](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.20.pdf) by John Watrous. \n",
|
||||
"* Another description can be found in the [lecture notes](https://staff.fnwi.uva.nl/m.walter/physics491/lecture1.pdf) by Michael Walter.\n",
|
||||
"\n",
|
||||
"Each task is wrapped in one operation preceded by the description of the task.\n",
|
||||
|
|
|
|||
|
|
@ -14,4 +14,4 @@ purely classical strategy.
|
|||
#### Theory
|
||||
|
||||
* [Lecture 1](https://staff.fnwi.uva.nl/m.walter/physics491/lecture1.pdf) by Michael Walter.
|
||||
* [Lecture 20](https://cs.uwaterloo.ca/~watrous/CPSC519/LectureNotes/20.pdf) by John Watrous.
|
||||
* [Lecture 20](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.20.pdf) by John Watrous.
|
||||
|
|
|
|||
|
|
@ -24,7 +24,7 @@
|
|||
" [this Wikipedia article](https://en.wikipedia.org/wiki/Grover%27s_algorithm).\n",
|
||||
"* [An Introduction to Quantum Algorithms](https://people.cs.umass.edu/~strubell/doc/quantum_tutorial.pdf) by Emma Strubell, pages 20-24.\n",
|
||||
"* [Lecture 4: Grover's Algorithm](https://www.cs.cmu.edu/~odonnell/quantum15/lecture04.pdf) by John Wright.\n",
|
||||
"* Lectures [12](https://cs.uwaterloo.ca/~watrous/LectureNotes/CPSC519.Winter2006/12.pdf) and [13](https://cs.uwaterloo.ca/~watrous/LectureNotes/CPSC519.Winter2006/13.pdf) by John Watrous.\n",
|
||||
"* Lectures [12](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.12.pdf) and [13](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.13.pdf) by John Watrous.\n",
|
||||
"* [This page](http://davidbkemp.github.io/animated-qubits/grover.html) has an animated demonstration of Grover's algorithm for a simple case.\n",
|
||||
"\n",
|
||||
"Each task is wrapped in one operation preceded by the description of the task.\n",
|
||||
|
|
|
|||
|
|
@ -13,7 +13,7 @@ You can [run the GroversAlgorithm kata as a Jupyter Notebook](https://mybinder.o
|
|||
[this Wikipedia article](https://en.wikipedia.org/wiki/Grover%27s_algorithm).
|
||||
* [An Introduction to Quantum Algorithms](https://people.cs.umass.edu/~strubell/doc/quantum_tutorial.pdf) by Emma Strubell, pages 20-24.
|
||||
* [Lecture 4: Grover's Algorithm](https://www.cs.cmu.edu/~odonnell/quantum15/lecture04.pdf) by John Wright.
|
||||
* Lectures [12](https://cs.uwaterloo.ca/~watrous/LectureNotes/CPSC519.Winter2006/12.pdf) and [13](https://cs.uwaterloo.ca/~watrous/LectureNotes/CPSC519.Winter2006/13.pdf) by John Watrous.
|
||||
* Lectures [12](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.12.pdf) and [13](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.13.pdf) by John Watrous.
|
||||
* Here is an [animated demonstration of Grover's algorithm](http://davidbkemp.github.io/animated-qubits/grover.html) for a simple case.
|
||||
|
||||
#### Q# materials
|
||||
|
|
|
|||
|
|
@ -15,7 +15,7 @@ Eigenvalues and eigenvectors:
|
|||
Quantum phase estimation:
|
||||
|
||||
* Wikipedia article on [quantum phase estimation](https://en.wikipedia.org/wiki/Quantum_phase_estimation_algorithm).
|
||||
* Lectures [8](https://cs.uwaterloo.ca/~watrous/LectureNotes/CPSC519.Winter2006/08.pdf) and [9](https://cs.uwaterloo.ca/~watrous/LectureNotes/CPSC519.Winter2006/09.pdf) by John Watrous.
|
||||
* Lectures [8](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.08.pdf) and [9](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.09.pdf) by John Watrous.
|
||||
* [Quantum Phase Estimation](https://docs.microsoft.com/quantum/libraries/standard/algorithms) in Q# documentation.
|
||||
|
||||
Iterative phase estimation:
|
||||
|
|
|
|||
|
|
@ -11,4 +11,4 @@ You can [run the QFT kata as a Jupyter Notebook](https://mybinder.org/v2/gh/Micr
|
|||
|
||||
- We follow the standard algorithm described in
|
||||
Nielsen, M. A. & Chuang, I. L. (2010). Quantum Computation and Quantum Information. pp.217-221
|
||||
- [Lecture 9 "Phase estimation (continued); the quantum Fourier transform"](https://cs.uwaterloo.ca/~watrous/LectureNotes/CPSC519.Winter2006/09.pdf) by John Watrous
|
||||
- [Lecture 9 "Phase estimation (continued); the quantum Fourier transform"](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.09.pdf) by John Watrous
|
||||
|
|
@ -6,4 +6,4 @@ Simon's algorithm consists of two parts - a quantum circuit and a classical post
|
|||
|
||||
#### Simon’s algorithm
|
||||
* A good place to start is [the Wikipedia article](https://en.wikipedia.org/wiki/Simon%27s_problem).
|
||||
* [Lecture 6: Simon’s algorithm](https://cs.uwaterloo.ca/~watrous/CPSC519/LectureNotes/06.pdf) has a somewhat clearer description of the measurement part of the quantum circuit.
|
||||
* [Lecture 6: Simon’s algorithm](https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.06.pdf) has a somewhat clearer description of the measurement part of the quantum circuit.
|
||||
|
|
|
|||
Загрузка…
Ссылка в новой задаче