Lecture

Right Arrow

SEARCH COURSES / LECTURES

Left Arrow

Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity

(93 Lectures Available)

S# Lecture Course Institute Instructor Discipline
1
  • A BQP-complete problem: quantum circuit evaluation
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
2
  • Amplifying approximate counting accuracy
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
3
  • Approximate Counting is contained in Post-BPP
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
4
  • Beyond Clifford gates - the Gottesman-Chuang hierarchy
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
5
  • Beyond NP: approximate and exact counting
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
6
  • Beyond NP: starting with counting solutions
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
7
  • Classical simulation algorithms for quantum computational supremacy experiments
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
8
  • Cluster quantum computation - controlled-not gate example
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
9
  • Cluster quantum computation - process description
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
10
  • Cluster quantum computation - single qubit gate example 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
11
  • Cluster quantum computation - single qubit gate example 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
12
  • Cluster states and graph states - 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
13
  • Cluster states and graph states - examples 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
14
  • Cluster states and graph states - examples 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
15
  • Complete problems and the generality of complexity class definitions - reductions
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
16
  • Complexity and hardness - lecture 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
17
  • Complexity classes - BPP and 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
18
  • 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
19
  • Complexity classes - NP
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences
20
  • 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
21
  • 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
22
  • 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
23
  • 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
24
  • 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
25
  • 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