Entry requirements

Algebra and Geometry or Linear Algebra I. 5 credits computer programming. Linear Algebra II. 

Learning outcomes

On completion of the course, the student should be able to:

• describe the physics fundamental to quantum computers.
• discuss physical and technological principles that constitute differences between classical and quantum computers.
• describe problems suitabile for quantum computing versus those that perform equally well on classical computer architectures.
• describe the basic building blocks of quantum processing units (QPU). 
• implement quantum algorithms using a quantum programming language. 
• simulate quantum systems on actual quantum hardware. 

Content

• Introduction to quantum computing: quantum mechanics principles;
  • the probability interpretation, expectationvalues, operators and superposition.
  • Tensorprocuct and entanglement.

• Classical vs quantum computing. Qubits, quantum gates, and quantum circuits.
• Introduction to quantum programming languages, basic concepts for programming a QPU such as describing qubits, quantum states, and quantum operations. 
• Writing quantum algorithms: basic quantum algorithms.
• QPU primitives and applications: essential quantum algorithms, real-world applications, including quantum search techniques.
• Simulating quantum systems: hands-on experience with quantum simulators and error correction.
• Running programs on quantum hardware: introduction to quantum hardware providers; understanding how quantum programs run on actual quantum hardware. 

Instruction

Lectures, lessons, seminar, laboratory exercises.

Assessment

Programming assignments, final written exam and project presentations.