Skip to main content

Faculty Development Program in Quantum Computing

I-HUB_Quantum_Technology_Foundation
Enrollment in this course is by invitation only

1: The Qubit and Complex Vector Spaces

  • 1.1: The Transition from Classical Bits to Quantum States (The Probability Circle)
  • 1.2: Complex Vector Spaces and Basis Vectors (Moving to 3D and Matrix representations)
  • 1.3: Dirac Notation, Inner Products, and Orthogonality (Bras, Kets, and Overlap)
  • 1.4: Normalization and Measurement Probabilities (The Born Rule and finding constants)
  • 1.5: Python Implementation: Building the Qubit Class with NumPy

2: Quantum Gates and Unitary Evolution

  • 2.1: Quantum Gates as Linear Operators (Introducing the Pauli matrices and the Hadamard gate)
  • 2.2: Visualizing Rotations with the Bloch Sphere (Mapping state vectors to 3D space)
  • 2.3: Unitary Matrices and Reversible Computation (Preserving the 100% probability total)
  • 2.4: Continuous Time Evolution (Connecting discrete matrices to physical microwave pulses)
  • 2.5: Python Implementation: Upgrading the Qubit Class with Matrix Multiplication

3: Entanglement and Information Transfer

  • 3.1: The Tensor Product (Expanding the math from 2D to 4D and beyond)
  • 3.2: Conditional Logic and the CNOT Gate (The quantum "IF" statement)
  • 3.3: Entanglement and Bell States (Creating non-separable states and "spooky action")
  • 3.4: Superdense Coding (Transmitting two classical bits using a single physical qubit)
  • 3.5: Python Implementation: Building the QuantumRegister and handling 

4: Quantum Oracles and Deutsch's Algorithm

  • 4.1: Phase Kickback (How target qubits alter control qubits via relative phase)
  • 4.2: Quantum Oracles (Encoding classical black-box functions into Unitary matrices)
  • 4.3: Quantum Interference (Using Hadamard layers to convert phase into probability)
  • 4.4: Deutsch's Algorithm (Proving quantum advantage in a single query)
  • 4.5: Python Implementation: Constructing algorithmic Oracle matrices in code

5: Amplitude Amplification and Grover’s Search

  • 5.1: The Unstructured Search Problem (Comparing  brute force to  scaling)
  • 5.2: The Phase Oracle (Tagging the winning state in a massive superposition)
  • 5.3: The Diffuser (The math behind "Inversion About the Mean")
  • 5.4: The Geometry of Grover's Search (Calculating the exact number of iterations to avoid over-rotation)
  • 5.5: Python Implementation: Simulating a 3-qubit unstructured search

6: Physical Realization and Hardware (The Reality Check)

  • 6.1: Anatomy of a Physical Qubit (Comparing Superconducting Transmons and Trapped Ions)
  • 6.2: Microwave Control and Cryogenics (How Dilution Refrigerators actually operate)
  • 6.3: Decoherence ( relaxation time vs.  dephasing time)
  • 6.4: Quantum Readout (Using microwave resonators to collapse and measure the state)
  • 6.5: Python Implementation: Adding thermal noise and decoherence variables to our simulator

7: Cryptography, Communication, and Sensing

  • 7.1: The Quantum Fourier Transform (QFT) (Transitioning from time domain to phase domain)
  • 7.2: Period Finding & Shor's Algorithm (How QFT breaks RSA encryption)
  • 7.3: Quantum Teleportation (Moving quantum information without moving the physical particle)
  • 7.4: Quantum Key Distribution (The BB84 Protocol and detecting eavesdroppers)
  • 7.5: Quantum Sensing (Utilizing squeezed states to bypass classical sensitivity limits)

8: Quantum Machine Learning (QML)

  • 8.1: The Hybrid Quantum-Classical Loop (Using quantum chips as co-processors for classical optimizers)
  • 8.2: Parameterized Quantum Circuits (Building gates with variable rotation angles)
  • 8.3: Variational Quantum Eigensolver (VQE) (Approximating molecular ground states for chemistry)
  • 8.4: Quantum Approximate Optimization Algorithm (QAOA) (Solving graph-partitioning and logistics problems)
  • 8.5: Python Implementation: Coding a simple parameter-update loop using gradient descent

9: The NISQ Era and Error Correction

  • 9.1: The NISQ Reality (Understanding gate fidelity, crosstalk, and maximum circuit depth)
  • 9.2: Error Mitigation vs. Error Correction (Zero-noise extrapolation vs. physical redundancy)
  • 9.3: The No-Cloning Theorem (Why we can't just copy qubits to back them up)
  • 9.4: The 3-Qubit Bit-Flip Code (A conceptual introduction to syndrome measurement)
  • 9.5: Surface Codes (The topological path to achieving fully fault-tolerant hardware)

10: Industry Integration and Capstone Planning

  • 10.1: The Full-Stack Quantum Architecture (Hardware, firmware, compilers, and applications)
  • 10.2: High-Impact Industry Use Cases (Meteorology, energy grid optimization, and drug discovery)
  • 10.3: Decoding the National Quantum Mission (NQM) (Strategic goals and funding avenues)
  • 10.4: Designing Undergraduate Research Projects (Scoping algorithms for senior thesis work)
  • 10.5: Socratic Review and Course Conclusion (Mapping out the long-term faculty mentorship framework)