Quantum Computing Workshop


When: March 26th from 10 am to 4 pm

Where: Monteith 214

This will be an introductory workshop for the mathematically inclined. Lunch, coffee, and refreshments will be provided.

Key-note speaker: Gamal Mograby

Graphs in Quantum Information Theory
We will introduce an approach for investigating the interplay between quantum systems on graphs, their spectral properties, and the topology of the underlying graph. Depending on time, we will discuss some applications in quantum information science.

Additional Talks

An Introduction to the Notation and Mathematics behind Quantum Computing, Thomas McGrath

In this talk we introduce some of the basic mathematical notions behind quantum computing. We explore its connections to linear algebra and give examples on how such transformations may be implemented through quantum circuit diagrams.

Probability in Quantum Computing, Rachel Bailey

In this talk I will give a brief introduction to the role of probability in quantum computing. I will first review some basic definitions and theorems from probability with a focus on discrete random variables. I will then recall some definitions and notations used in quantum computing and discuss how probability is used to detect entanglement of qubits.

Linear Algebra for Quantum Computing, Anastasiia Minenkova

This talk will cover the linear algebra we need to talk about the QFT. We will go over the classical linear algebra concepts like unitary matrices, discrete Fourier transform and more! They will be then adapted to the quantum computations.

An Introduction to the Quantum Fourier Transform, Erik Wendt

Starting with an introduction to some famous quantum algorithms, we talk about one of their unifying components: the Quantum Fourier Transform (QFT). Through an in-depth discussion of the QFT we highlight the high dimensionality of the phase space is one of the main advantages of quantum computing. Finally, we show some explicit applications of the QFT to the problems of phase estimation and factoring.