5 ECHas material

Introduction to Quantum Computer Science

An algorithm-centric, computer-science-first introduction to quantum computation — state vectors, gates, and the seminal algorithms, not quantum physics.

Download course · 42 MB

Lectures: 8
Exams: 1
Solutions: 5
Notes: 0
Textbooks: 1
Total: 22 · 42 MB

Was CSE3130, a Year-3 elective. Remains an elective.

What it covers

State vector formalism: single-qubit states, superposition, the Bloch sphere, measurement via Born's rule
Single-qubit gates: Pauli gates (X, Y, Z), Hadamard, gates as rotations
Multi-qubit systems: tensor products, entanglement, CNOT, universal gate sets
Core algorithms: Deutsch-Jozsa, Bernstein-Vazirani, Simon's algorithm
Quantum Fourier Transform and Quantum Phase Estimation, building up to Shor's algorithm

Assessment

Grade is entirely the final written exam — weekly programming and theory assignments (Qiskit, Python) are formative/non-graded but expected preparation, mirrored directly in exam question style. Exam mixes mathematical formalism (state vectors, gate matrices, tensor products, measurement probabilities), circuit analysis, algorithmic explanation (oracles, QFT role), and conceptual questions on superposition/entanglement/parallelism.

Worth knowing

Only prerequisites are linear algebra and complex numbers — no quantum physics background assumed or needed.
Since the grade is exam-only, the weekly (ungraded) assignments are your only real formative feedback — don't skip them because they're not scored.
No past exams are archived here (TU Delft doesn't circulate them for this course) — the practice questions and exercise solutions are the closest available proxy for exam style.
The Qiskit version used is deliberately an older (v0) API — don't study from current Qiskit docs assuming syntax parity.

AI tutors

Zip

IQCS5 knowledge filesSystem prompt

Lectures · 8

Zip

Lecture 1 - Introduction to Qubits4 MB

Lecture 2 - Single Qubit Gates and Measurements2 MB

Lecture 3 - Multiple Qubits and Entanglement6 MB

Lecture 4 - Universal Gatesets and Classical Computation3 MB

Lecture 6 - First Quantum Algorithms3 MB

Lecture 7 - Quantum Fourier Transform3 MB

Lecture 8 - Quantum Phase Estimation2 MB

Lecture 9 - Shor's Algorithm2 MB

Exams · 1

Zip

Exam Practice Questions1 MB

Solutions · 5

Zip

Exercise Week 1 SolutionsExercise Solutions169 KB

Exercise Week 2 SolutionsExercise Solutions357 KB

Exercise Week 3 SolutionsExercise Solutions220 KB

Exercise Week 4 SolutionsExercise Solutions249 KB

Exercise Week 7 SolutionsExercise Solutions256 KB

Textbooks · 1

Zip

Quantum Computing in Practice with Qiskit13 MB

What it covers

State vector formalism: single-qubit states, superposition, the Bloch sphere, measurement via Born's rule

Single-qubit gates: Pauli gates (X, Y, Z), Hadamard, gates as rotations

Multi-qubit systems: tensor products, entanglement, CNOT, universal gate sets

Core algorithms: Deutsch-Jozsa, Bernstein-Vazirani, Simon's algorithm

Quantum Fourier Transform and Quantum Phase Estimation, building up to Shor's algorithm

Assessment

Worth knowing

Only prerequisites are linear algebra and complex numbers — no quantum physics background assumed or needed.

Since the grade is exam-only, the weekly (ungraded) assignments are your only real formative feedback — don't skip them because they're not scored.

No past exams are archived here (TU Delft doesn't circulate them for this course) — the practice questions and exercise solutions are the closest available proxy for exam style.

The Qiskit version used is deliberately an older (v0) API — don't study from current Qiskit docs assuming syntax parity.