| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 5826 |
Complexity classes – deterministic time
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5827 |
The threshold theorem – proof sketch – recursing
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5828 |
Principles of fault tolerance
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5829 |
Fault-tolerant quantum computation – theorem idea
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5830 |
The threshold theorem – statement
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5831 |
Fault-tolerant quantum computation – theorem 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
|
| 5832 |
Promise problems – sampling problems – and relations
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5833 |
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5834 |
The toric code – boundary map
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5835 |
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
|
| 5836 |
Fault-tolerant quantum gates on 5-qubit and 7-qubit codes
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5837 |
Quantum gate compiling – significance of the Solovay-Kitaev theorem for BQP
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5838 |
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
|
| 5839 |
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
|
| 5840 |
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
|
| 5841 |
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
|
| 5842 |
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
|
| 5843 |
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
|
| 5844 |
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
|
| 5845 |
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
|
| 5846 |
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
|
| 5847 |
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5848 |
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
|
| 5849 |
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
|
| 5850 |
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
|
