Lecture 1: The Quantum Hypothesis

Introduction to Quantum Computing

Lecture 1 introduces the necessary components of classical computing and provides some historical overview of the field of quantum computing. Also, how different types of information processes have different power.

What is Classical Computing? (13:51 minutes)

• Classical Computation
• Why and When of Quantum
• Power of Quantum Computers

Brief History of Quantum Computing (12:52 minutes)

• David Deutsch proposed the universal quantum computer
• Deutsch and Richard Jozsa gave the first quantum algorithm providing a provable speed-up
• Shor’s algorithm that can factor large numbers exponentially faster
• Fault-Tolerant Threshold Theorem states that quantum error correction can allow quantum computation to happen indefinitely so long as the rate at which errors happen is below some threshold
  
  

What makes quantum computing so powerful?(17:15 minutes)