Completed
— Toffoli gates
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Quantum Algorithmic Foundations: Understanding Quantum Information and Computation - Lesson 6
Automatically move to the next video in the Classroom when playback concludes
- 1 — Introduction
- 2 — Overview
- 3 — Integer factorization
- 4 — Greatest common divisor
- 5 — Measuring computational cost
- 6 — An abstract view of computation
- 7 — Encodings and input length
- 8 — Elementary operations
- 9 — Circuit size and depth
- 10 — Cost as a function of input length
- 11 — Example: integer addition
- 12 — Asymptotic notation
- 13 — Polynomial versus exponential cost
- 14 — Classical computations on quantum computers
- 15 — Toffoli gates
- 16 — Simulating Boolean gates
- 17 — Simulating Boolean circuits
- 18 — Conclusion
