B.Tech CSE · Final Year · Elective

Introduction to
Quantum Computing

From qubits and superposition to Grover's algorithm and quantum machine learning — a complete guide to computation beyond classical limits.

5 Units Full Syllabus
45 hrs Lecture Hours
3 cr Credits
100 marks End Exam
Explore

What you'll learn first

Unit I builds the mathematical and conceptual foundation every other unit depends on. Nine lectures across six core topics.

Classical vs Quantum Computing

Why classical bits hit a wall on certain problems, and how the quantum model of computation breaks through it with superposition and parallelism.

Foundation
⚛️

Qubits & the Bloch Sphere

The state |ψ⟩ = α|0⟩ + β|1⟩, what the Born rule means, and how every qubit state maps to a point on a 3D sphere surface.

Core Concept
🔭

Quantum Measurement

How observation collapses superposition, why this is irreversible, what Schrödinger's cat really illustrates, and why algorithms must measure last.

Phenomenon
🧮

Dirac (Bra-Ket) Notation

The universal shorthand of quantum mechanics: kets, bras, inner products, orthonormal bases, and how matrix operations translate into gate operations.

Mathematics
🔗

Quantum Entanglement

Bell states, non-local correlations, the 2022 Nobel Prize, and why entanglement is a computational resource rather than just a curiosity.

Phenomenon
🖥️

Hardware & Qiskit

Superconducting, trapped-ion, photonic and topological qubit technologies, plus hands-on circuit programming with IBM's open-source Qiskit SDK.

Practical

Study resources

A complete study guide and an interactive quiz — everything you need to prepare for Unit I.

📘 Study Guide

Unit I — Complete Study Guide

A fully interactive HTML reference covering every topic in Unit I with explanations, diagrams, comparison tables, Dirac notation tables, a Bloch sphere diagram, and a Qiskit code example.

  • 8 sections, each explained clearly
  • Animated Bloch sphere SVG with labeled states
  • Classical vs Quantum comparison table
  • Full Dirac notation reference
  • Syntax-highlighted Qiskit Bell state code
  • Scroll-reveal animations & progress bar
🧠 Interactive Quiz

Unit I — Knowledge Quiz

Test your understanding with 5 carefully crafted questions. Every wrong answer shows a detailed explanation of the concept so you learn from mistakes, not just avoid them.

  • 5 questions · 20 marks each · 100 total
  • Covers Born Rule, Bloch sphere, measurement
  • Dirac notation & Bell state entanglement
  • Instant feedback with wrong-answer explanations
  • Graded score: A+ to D with personalised message
  • Retry as many times as you like

Course at a glance

Introduction to Quantum Computing prepares you to design quantum algorithms, implement them in Qiskit, and understand their real-world applications in cryptography, optimization, and machine learning.

📅 Sessional: 40 marks 📝 End Exam: 60 marks · 3 hours 🐍 Python / Qiskit 🎓 Pre-req: Linear Algebra, Probability 🔬 Nielsen & Chuang — Textbook

Five-unit roadmap

Each unit builds on the previous. Unit I fundamentals appear in every subsequent topic.

Current
Unit I · 9 Lectures

Fundamentals of Quantum Computing

  • ⚛ Qubits & Bloch Sphere
  • 🔗 Entanglement
  • 🧮 Dirac Notation
  • 🖥️ Qiskit & Hardware
Unit II · 9 Lectures

Quantum Gates & Circuits

  • Pauli, Hadamard, Phase gates
  • CNOT, Toffoli, SWAP
  • Reversible computation
  • Noise & error basics
Unit III · 9 Lectures

Quantum Search Algorithms

  • Grover's algorithm
  • Amplitude amplification
  • Oracle construction
  • Implementation in Qiskit
Unit IV · 9 Lectures

Quantum Image Processing

  • FRQI & NEQR models
  • Edge detection
  • Quantum Fourier Transform
  • Pattern recognition
Unit V · 9 Lectures

Application Algorithms

  • VQE & QAOA
  • Quantum ML classifiers
  • Drug discovery, finance
  • NISQ & future directions

Ready to start Unit I?

Read the study guide first, then test yourself with the quiz. Both open instantly in your browser.

Study Guide Quiz