LEJ Knowledge Hub

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
51
  • Models of computing - random and quantum
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
  • Models of computing - Turing machines 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
53
  • Models of computing - Turing machines 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
54
  • Models of quantum computation - 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
55
  • Post-BPP is contained in Approximate 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
56
  • Post-selection
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
  • PostBQP is equal to Exact Counting in complexity
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
  • 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
59
  • 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
60
  • 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
61
  • 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
62
  • 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
63
  • Quantum post-selection
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
  • 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
65
  • 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
66
  • 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
67
  • 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
68
  • 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
69
  • 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
70
  • 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
71
  • 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
72
  • 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
73
  • The quest towards complex quantum capabilities
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 relationship of BQP and BPP: a taste 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
75
  • The relationship of BQP and BPP: quantum vs classical complexity
Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity MIT Prof. Isaac Chuang, Dr. Aram Harrow Basic and Health Sciences

Basic and Health Sciences

Applied Sciences

Social Sciences