You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1-24Lines changed: 1 addition & 24 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -15,33 +15,10 @@ Other recommended lecture notes: [John Watrous](https://cs.uwaterloo.ca/~watrous
15
15
16
16
17
17
18
-
# Course Schedule
19
-
We will majorly focus on quantum algorithms in this version of the course.
20
-
21
18
22
19
23
20
24
21
25
22
26
-
| Lecture Number | Title | Medium Article |
27
-
| --- | --- | --- |
28
-
| 1 | Introduction to Quantum Computing|[](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-24-swap-nodes-in-pairs-51aa79e974e4)|
29
-
| 2 | Density Operators|[](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-24-swap-nodes-in-pairs-51aa79e974e4)|
| 6 | bell inequalities, CHSH Game|[]()|
34
-
| 7 | Bell Polytype and its dual, quantum vs classical model|[]()|
35
-
| 8 | Superdense Coding and quantum teleportation|[]()|
36
-
| 9 | Circuit Complexity , P vs NP, NP-completeness|[]()|
37
-
| 10 | BPP and MA, Reversible Computing, BQP and QMA|[]()|
0 commit comments