Quantum Computing for Computer Scientists

CMPUT 604 B1

Winter 2019

Instructor: Pierre Boulanger 
Email: pierreb@ualberta.ca

Office hours: after class or by appointment 
Course web site: http://cs.ualberta.ca/~pierreb/QC-2019

Course will be every Friday in CSC 2-49 from 16h15 to 18h15


Prerequisites: Students should be comfortable with linear algebra concepts such as unitary and Hermitian matrices. They should also have basic knowledge of probability theory.  Prior knowledge of quantum mechanics is helpful but not required.


Course Description: This course is an introduction to theory and applications of quantum information and quantum computation, from the perspective of computer science. The course will cover classical information theory, compression of quantum information, quantum entanglement, efficient quantum algorithms, quantum error-correcting codes, fault-tolerant quantum computation, and quantum machine learning. The course will also cover physical implementations of quantum computation into real quantum computers and their programming languages using real-world examples utilizing a state-of-the-art quantum technology through the IBM Q Experience, Microsoft Quantum Development Kit, and D-Wave Leap.


Topics to be covered will likely include:


o  Introduction, bra-ket notation, unitary operations, orthogonal measurements, n-qubit states, entanglement, single-qubit and controlled operations

Super dense coding, incomplete measurements, quantum teleportation

Quantum Computing Computer Architectures

Quantum Computing Languages

The quantum circuit model of computation

o  Quantum error-correcting codes and fault-tolerance

o  Basic quantum algorithms like Deutsch-Josza, Simon, and Grover

o  Shor's factoring algorithm

o  Computational complexity theory

o  Quantum entanglement, teleportation, and Bell inequalities

o  Quantum Fourier transforms and the hidden subgroup problem

o  Quantum query complexity, span programs, and the adversary method

o  Density matrices, state discrimination, tomography

o  Von Neumann entropy and Holevo's bound

o  Quantum machine learning



o  The course evaluation will consist of 4 assignments (10% each) on basic quantum theory and algorithmic. Some assignments will also involve programming real quantum computers using web enabled IBM Q and D-Wave access.

o  Most of the marks will be on a final project (50%) that must include basic quantum computing applications and its implementation on a real quantum computer or a simulator.

 Lecture Notes

Lecture Date


Slides and Texts


Jan. 11




Jan. 18

Origin of Quantum Mechanics and History of Quantum Computing



Jan. 25

Intro. To Complex Linear Algebra and Hilbert Space


Special case for Classical Bits (CBit) and Quantum Bit (Qbit)


More on Dirac Notation and Hilbert Space


Postulate of Quantum Mechanics Using Dirac Notation


Feb. 1

Classical Bit and Quantum Bit Manipulations




Basic Quantum Bit Operations

First Classical Bits

CBit and Qbit Manipulations 




Assignment 1: Solve the following mat problems QC Math1

In addition, please follow the tutorials and document the results.

o  IBM-Q Introduction Tutorial

o  Basic Circuits

Due date Feb. 8

Homework 1 Solution

Feb. 8

Circuit model of quantum computation





Time Reversal Using Quantum Computer???

Time Reversal.pptx


Feb. 15

o  The Deutsch-Jozsa algorithm

o  Simonís algorithm

o  Quantum Fourier transform and periodicities

o  Quantum algorithms for search problems

o  Shor quantum factoring algorithm

o  IBM Programming Environment





Shor Algorithm

Quantum Fourier Transform


Introduction to IBM qiskit

Assignment 2: Read the following and run the Quantum circuits. Explain how it works and document the results.

Due date Feb. 22

Feb. 22

No class Reading Week


Project Description Due Mar. 1

Mar. 1

o  Universal Set Gates

o  Groverís quantum search algorithm

o  Microsoft Q# Language




Introduction to Microsoft Q#

Quantum Computing at Microsoft

Tutorial on Q#


Assignment 2 Extra: Homework2

Solution of Homework2

Assignment 3: Read the following and run the provided quantum circuits. Explain how it works and document the results.

Due date Mar. 8

Mar. 8

o  Adiabatic Quantum Algorithm

o  Adiabatic Quantum Hardware








o  D-Wave Programming Environment

Quantum Annealing

How The Quantum Annealing Process Works.mp4

Measuring Quantum Physics in a Quantum Annealer.mp4

Physics of Quantum Annealing - Hamiltonian and Eigenspectrum.mp4


D-Wave 2000Q System


D-Wave Leap

Solving Problems Using QUBO

QUBO Tutorial

Assignment 4: The main goal of this assignment is to learn how to use the D-Wave programming environment

o  Register to D-Wave Leap

o  Install SDK

o  Factoring with the D-Wave System

o  Anneal Schedule

Factorisation Using Annealing

Report the results with an analysis

Due date Mar. 22


Time Reversal is it for Real?



Mar. 15

o  Quantum Computer Hardware

o  How to Design a Qbit

o  Fault-tolerant quantum error correction

Fault-tolerant quantum gates, Eastin-Knill theorem


Microsoft QC Hardware


Quantum Computer Hardware Overview


IBM-Q Hardware

Qbit with Light


Quantum Error Correction


Topological Quantum Computer

Mar. 22

Quantum Cryptography

  Quantum Cryptography

 Quantum Cryptography Explained

Mar. 29

Quantum Machine Learning


More on Quantum Machine Learning

Quantum Information Theory

 QML NASA Presentation

Book by Wittek on QML

Apr. 5

Project Presentations




Background Reading


Other Lecture Notes

Quantum Computing Devices/Simulators


o  Performance Models for Split-execution Computing Systems by Travis S. Humble, Alexander J. McCaskey, Jonathan Schrock, Hadayat Seddiqi, Keith A. Britt, Neena Imam, arXiv:1607.01084

o  A quantum macro assembler by Scott Pakin, High Performance Extreme Computing Conference (HPEC), 2016, QMASM github code

o  QX: A high-performance quantum computer simulation platform by Khammassi et al., DATE'17

o  Quantum Error Correction for Beginners by Simon J. Devitt, Kae Nemoto, William J. Munro, arXiv:0905.2794

o  Quantum Computing over Finite Fields: Reversible Relational Programming with Exclusive Disjunctions by Roshan P. James, Gerardo Ortiz, Amr Sabry, arXiv:1101.3764

o  Quantum Supremacy through the Quantum Approximate Optimization Algorithm, Edward Farhi, Aram W Harrow, arXiv:1602.07674 (Submitted on 24 Feb 2016)

o  Error mitigation for short-depth quantum circuits, Kristan Temme, Sergey Bravyi, Jay M. Gambetta (Submitted on 6 Dec 2016 (v1), arXiv:1612.02058, last revised 6 Nov 2017 (this version, v3))

o  Physics: Hybrid Quantum-Classical Approach to Correlated Materials, Bela Bauer, Dave Wecker, Andrew J. Millis, Matthew B. Hastings, and Matthias Troyer, Phys. Rev. X 6, 031045, 21 September 2016

o  Chemistry: A variational eigenvalue solver on a photonic quantum processor, A. Peruzzo et al., Nature Comms 5, 4213 (2014)

o  Quantum supremacy: Quantum advantage with shallow circuits by Sergey Bravyi, David Gosset, Robert Koenig in arXiv:1704.00690, Apr 2017, also in Science, 19 Oct 2018: Vol. 362, Issue 6412, pp. 308-311, DOI: 10.1126/science.aar3106, slidesvideo