Credits: 4EC
Prerequisites: Linear Algebra, Probability & Statistics
Motivation: Quantum information is the future of computing and communication. Quantum computers offer exponential speedup over any classical computer. Similarly, quantum communication offers many advantages, including the ability to create secure encryption keys where security rests only on the laws of nature.
Synopsis: This class will teach you the fundamental principles of quantum information. You will learn what are quantum bits, quantum operations, and essential concepts that distinguish quantum from classical. You will learn basic techniques used in quantum algorithms, and examine basic examples of such algorithms. You will also take the first step in understanding how a quantum bit can be implemented.
Aim: To learn the fundamental concepts underlying quantum computation and communication systems
Learning outcomes: The student will acquire:
- A good understanding quantum bits and quantum gates
- Insight into the differences between classical and quantum devices
- A basic understanding of quantum algorithms
- Skill set required to follow the remainder of the quantum curriculum (Q201 – Quantum communication and cryptography, Q301 – Quantum hardware and Q401 – Quantum electronics)
Lecturers: dr Leo DiCarlo (QuTech, TNW)
Examination: 60% Homework assignments, 10% in class quiz, 30% final exam
Contents: quantum states, measurements; bell test, entanglement; unitary operations, no cloning; quantum gates, universal gate sets, entangling gates; bipartite states, mixed states, partial trace, purification; teleportation, superdense coding, remote state preparation, quantum repeater; basic algorithm and quantum algorithmic tecniques; simple physical implementation of 1 qubit
Core text: Nielsen and Chuang “Quantum computation and information”, Cambridge University Press.