| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 51 |
Complexity classes – polynomial exponential and PSPACE
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 52 |
The toric code – definition
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 53 |
Complexity of counting – review
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 54 |
Fault-tolerant quantum measurement of error syndromes
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 55 |
Quantum gate compiling – Solovay-Kitaev theorem
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 56 |
The toric code – F2 linear algebra representation of plaquettes and vertices
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 57 |
Fault-tolerant recovery from error – DiVincenzo-Shor method
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 58 |
The toric code – geometric representation of logical X operators
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 59 |
Complexity theory – definition of problems and languages
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 60 |
Quantum gate compiling – the problem
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 61 |
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 62 |
Complexity theory – lecture overview
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 63 |
Fault-tolerant recovery from error – non-demolition measurement
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 64 |
The toric code – geometric representation of logical Z operators
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 65 |
Quantum supremacy overview
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 66 |
Complexity theory lectures – introduction
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 67 |
Fault-tolerant recovery from error – Steane method
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 68 |
The toric code – logical operators – the normalizer subgroup
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 69 |
Computational capacity – communication over noisy wires
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 70 |
Quantum supremacy overview – discussion
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 71 |
Magic state distillation – briefly
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 72 |
The toric code – number of logical qubits encoded
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 73 |
Reductions – example NP complete problem: Circuit SAT
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 74 |
The toric code – perspective
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 75 |
Model equivalence theorems
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
