Chap 1. Introduction
约 293 字小于 1 分钟
2025-09-23
Course Structure
Core Quantum Computing
- Quantum circuits
- Algorithms (Grover, Shor)
- Error correction
Simulation & Tools
- Qiskit tutorials
- Hardware implementations
- Analogue quantum simulation
Advanced Topics
- Quantum annealing
- Variational algorithms (VQA, QAOA)
- Quantum chemistry (VQE)
Special Topics
- Quantum advantage
- Machine learning
- Error mitigation
Historical & Technical Motivation
Evolution of Classical Computing
- Pre-1940s: Mechanical calculators (Pascal, Babbage)
- 1940s: Vacuum tubes (ENIAC, Colossus)
- 1950s: Transistors → Integrated circuits (Moore's Law)
- 2000s: Clock speed plateau (~3-6 GHz due to heat limits)
Limitations:
- Moore's Law: Impossible to continue forever.
- Fundamental physical limitation (quantum tunneling)
Quantum Advantages
- Exponential Speedup:
- Shor’s algorithm: Factors integers in polynomial time.
- Grover’s search: Quadratically faster unstructured search.
- NISQ Applications:
- Quantum simulation (e.g., molecular dynamics).
- Hybrid classical-quantum algorithms (e.g., QAOA for optimization).
Limitations:
- No proven speedup for NISQ algorithms yet.
- Error rates require mitigation techniques.
Quantum Mechanics Foundations
Key Principles
Superposition:
- Qubit state: ∣ψ⟩=α∣0⟩+β∣1⟩.
- Double-slit experiment: Interference patterns demonstrate wave-particle duality.
Entanglement:
- Bell state: ∣Φ+⟩=2∣00⟩+∣11⟩.
- "Spooky action at a distance" (Einstein) → Verified via Bell tests.
Measurement:
- Projective collapse: ∣ψ⟩→∣i⟩ with probability ∣⟨i∣ψ⟩∣2.
- Heisenberg Uncertainty: Δx⋅Δp≥ℏ/2.
Open Quantum Systems
Decoherence:
- T1: Energy relaxation (e.g., ∣1⟩→∣0⟩).
- T2: Phase damping (loss of superposition).
Schrödinger’s Cat: Macroscopic superposition → Decoherence in large systems.
References & Tools
Textbooks
Software
- Qiskit: Install via
pip install qiskit. - IBM Quantum: Free access to quantum hardware.