Contents

• Lecture content based on presentation created by Dr. Krysta Svore General Manager Microsoft Quantum
• Additional lecture material and clarification provided by Dr. Julian Rrushi, faculty of the department of Computer Science and Engineering at Oakland University

Lecture #1:

• Complex Numbers, Polar Form, Unit Information, Multiple Qubits, Dirac Notation, Orthonormality, Entanglement, Orthogonal Measurement

Lecture #2:

• Classical Boolean Logic, Controlled Not Gate, Circuit Diagrams, No-Cloning Theorem, Quantum Logic Gates, Preparing a State in Superposition, Changing the Phase, The Bloch Sphere, General Single Qubit Unitary Gates, Rotation Gates, Tensor Products of Quantum Gates

Lecture #3

• Bell States, Quantum Teleportation, Introductory Q#

Lecture #4

• Oracle, Phase Oracle, Deutsch's Algorithm, Deutsch-Jozsa Algorithm

Lecture #5

• Fourier Series, Continuous Fourier Transforms, Discrete Fourier Transform, Quantum Fourier Transform

Lecture #6

• Eigenvalues and Eigenvectors (states), Phase Estimation Problem, Phase Estimation Procedure

Lecture #7

• Brute-Force Search, Grover's Algorithm

References:

• Arfken, G. B., Harris, F. E., & Weber, H.-J. (2012). Mathematical Methods for Physicists: A Comprehensive Guide. Elsevier.
• Nielsen, M. A., & Chuang, I. L. (2011). Quantum Computation and Quantum Information. Cambridge University Press.
• Svore, K. (2019). Quantum Computing and  Q# Programming. Microsoft Quantum.
• Watrous, J. (n.d.). Basics of quantum information. IBM Quantum Learning. https://learning.quantum.ibm.com/course/basics-of-quantum-information
• Wojcieszyn, F. (2023). Introduction to quantum computing with Q# . Strathweb. https://www.strathweb.com/2021/02/introduction-to-quantum-computing-with-q
• Wong, T. G. (2022). Introduction to Classical and Quantum Computing. Rooted Grove.