Quantum Computing 2020/2021

Table of Contents


1 Welcome

Welcome to the webpage of the course "Quantum Computing 2020/2021".

Arguably quantum computing is coming of age. With the race for quantum rising between major IT players (e.g. IBM, Intel, Google, Microsoft), and the announcement of prototype-machines up to 50 qubits until the end of the current year, it seems that we are in the verge of a real shift. For the first time the viability of quantum computing may be demonstrated in a number of real problems extremely difficult to handle, if possible at all, classically, and its utility discussed across industries. In a sense, Feynman’s dream of letting Nature, suitably engineered, compute for us through its own natural quantum behaviour, seems to be closer, even if the project of a universal quantum computer has still a long way to go. In the somehow emphatic language of the media, a ‘second quantum revolution’ is quickly approaching. It is characterised by the ability to harness the most weird quantum phenomena, namely superposition and entanglement, as computational resources, with practical advantage

In such a context, this course introduces, at a doctoral programme level, the foundations of quantum computing, as well as a number of specialised topics on the forefront of research on quantum software engineering.

2 Learning outcomes

  • To master the principles and main techniques of quantum information and computation;
  • To systematically design and analyse quantum algorithms, as well as implement and run them in the Qiskit open-source software development kit;
  • To understand the essential elements of quantum programming languages, their current implementations, and associated dynamic logics.

3 Dates, syllabus, materials, and contacts

The course is divided in several modules (one per week), as detailed below:

Lecture Nr. - Date - Time Topic Lecturer Room Bibliography
1 - 12/10/20 - 14h30m - 18h00m Quantum Information & Computation RN TBD [1, 2, 3]
2 - 19/10/20 - 14h30m - 18h00m The Circuit Model & Laboratory LSB TBD [1, 2, 3], Qiskit
3 - 26/10/20 - 14h30m - 18h00m Quantum Algorithms & Laboratory LSB TBD [1, 3, 4, 6], Qiskit
4 - 02/11/20 - 14h30m - 18h00m Error-correcting codes RP TBD [12, 13, 14]
5 - 09/11/20 - 14h30m - 18h00m Computability & Complexity JES TBD [7, 8, 5]
6 - 16/11/20 - 14h30m - 18h00m Quantum λ-calculus JES TBD [9, 10,11]
7 - 07/12/20 - 14h30m - 18h00m Logics for quantum programs RN TBD [1, 15, 16]
8 - 14/12/20 - 14h30m - 18h00m Q. Seminar TBD TBD TBD

Coordinator: Renato Neves.

4 Grading

Assessment is based on an individual report on a research topic and a small programming exercise in a quantum programming language (typically Qiskit).

N.b. Further than evaluating the student's knowledge on quantum computing, the goal of this assessment is to hone requisite skills for a successful research career: namely, to understand the main ideas of a scientific work, to form a rigorous, critical analysis of it, and to properly explain ideas/opinions to peers both orally and in written.

5 Bibliography

  • [1] M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information (10th Anniversary Edition). Cambridge University Press, 2010.
  • [2] Mark M. Wilde. Quantum Information Theory. Cambridge University Press, 2017.
  • [3] E. Rieffel and W. Polak. Quantum Computing: A Gentle Introduction. Scientific and Engineering Computation. MIT Press, 1992.
  • [4] N. David Mermin. Quantum Computer Science: An Introduction. Cambridge University Press, 2007.
  • [5] N. S. Yanofsky and M. A. Mannucci. Quantum Computing for Computer Scientists. Cambridge University Press, 2008.
  • [6] Mingsheng Ying. Foundations of Quantum Programming. Morgan Kaufmann, Elsevier, 2016.
  • [7] S. Arora and B. Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009.
  • [8] C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
  • [9] J.R. Hindley and J.P. Seldin. Lambda-calculus and Combinators: an Introduction. Cambridge University Press, 2008.
  • [10] Ugo Dal Lago, Andrea Masini, and Margherita Zorzi. On a measurement-free quantum lambda calculus with classical control. Mathematical Structures in Computer Science, 19(2):297–335, 2009.
  • [11] Peter Selinger and Benoît Valiron. A lambda calculus for quantum computation with classical control. Math. Struct. Comput. Science, 2006.
  • [12] R. Hill. A First Course in Coding Theory. Oxford Applied Linguistics. Clarendon Press, 1986.
  • [13] Frank Gaitan. Quantum Error Correction and Fault Tolerant Quantum Computing. CRC Press, Inc., Boca Raton, FL, USA, 2007.
  • [14] Quantum Error Correction. Cambridge University Press, 2013.
  • [15] A. Baltag and S. Smets. Quantum logic as a dynamic logic. Synthese, 179(2):285–306, 2011.
  • [16] A. Baltag and S. Smets. The dynamic turn in quantum logic. Synthese, 186(3):753–773, 2012.

Author: Renato Neves

Created: 2020-09-18 Fri 08:52

Validate