| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 5851 |
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
|
| 5852 |
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
|
| 5853 |
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
|
| 5854 |
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
|
| 5855 |
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
|
| 5856 |
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
|
| 5857 |
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
|
| 5858 |
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
|
| 5859 |
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
|
| 5860 |
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
|
| 5861 |
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
|
| 5862 |
Some NP complete problems: 3SAT TSP and IP
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5863 |
The toric code – stabilizers in terms of F2 algebra
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5864 |
Models of computing – circuits I
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5865 |
Teleportation with basis change – circuit construction
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5866 |
Models of computing – circuits II
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5867 |
Thoughts on fault-tolerant quantum computation with cluster states
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5868 |
Teleportation with basis change – one-qubit Z teleportation circuit
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5869 |
Models of computing – non-determinism
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5870 |
Threshold for quantum computation – fault-tolerant quantum procedures
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5871 |
The circuit size of fault-tolerant procedures
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5872 |
Thresholds for reliable classical computation
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5873 |
The modern argument of quantum supremacy
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5874 |
The P=NP problem – hardness statements and runtime lower bounds
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
| 5875 |
Transversal measurements involved in the T gate construction
|
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
|
MIT
|
Prof. Isaac Chuang, Dr. Aram Harrow
|
Basic and Health Sciences
|
