IA066 Introduction to Quantum Computing

Faculty of Informatics
Autumn 2024
Extent and Intensity
2/1/0. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Taught in person.
RNDr. Vít Musil, Ph.D. (lecturer)
Guaranteed by
RNDr. Vít Musil, Ph.D.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Linear algebra in a complex field; No knowledge of quantum physics is assumed.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 38 fields of study the course is directly associated with, display
Course objectives
The course introduces students to the core principles of quantum mechanics as applied to computing. Initially, we confront our classical expectations with quantum surprises through experiments to discover fundamental phenomena such as superposition, interference and measurement. We then establish a mathematical framework to underpin these concepts. Students will learn about basic concepts and methods used in quantum computing as well as famous key algorithms that offer advantages over classical computing. The course aims to provide theoretical knowledge and skills, preparing students for advanced studies or careers in quantum technologies. In contrast to popularization lectures, the focus is on understanding the mathematical rigour.
Learning outcomes
After completing the course, students will be able to understand:
- the mathematical foundations of quantum computing
- basic principles of quantum algorithm design
- basic quantum circuit design
- basic elements of quantum cryptography
- Grover's search and Shor's period-finding algorithms
  • Introduction: What is quantum computing, and why look at it.
  • Classical expectations & quantum surprises: Demonstration of experiments with spinning neutrons in a magnetic field; Building a formal model, discussion of measurement, unavoidable complexity.
  • Superposition: Introducing 'signed' probabilities; Constructive and destructive interference.
  • Postulates of quantum mechanics: State space; Qbit and its measurement (Born rule); The evolution of a quantum system.
  • Operations on a Qbit: Properties of unitary transforms; Quantum gates and circuits; I, H, X, Z gates.
  • Protocols using on Qbit: Quantum key distribution (BB84); Bit commitment.
  • Composite systems: Tensor product and entanglement; Measurement revisited, Generalized Born rule.
  • Operations on Qbits: Unitary transforms, Product and entanglement gates, CNOT; Postulates revisited; No cloning theorem;
  • Dense coding & Teleportation: Bell basis and duality;
  • Reversible computation of a Boolean function: Unitary implementation of any function; Quantum parallelism; Phase query;
  • Protocols using a few Qbits: Deutsch's problem'; Bernstein-Vazirani problem; Simon's problem.
  • Grover's Search algorithm
  • Shor's factoring algorithm: Discrete Fourier transform; Period finding.
    recommended literature
  • MERMIN, N. David. Quantum computer science : an introduction. 1st pub. New York, N.Y.: Cambridge University Press, 2007, xiii, 220. ISBN 9780521876582. info
    not specified
  • GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
Teaching methods
Lectures and tutorials
Assessment methods
Written test, oral exam.
Language of instruction
Further Comments
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Autumn 2002, Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Autumn 2021, Autumn 2022, Autumn 2023.
  • Enrolment Statistics (Autumn 2024, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2024/IA066