EVENT Fundamentals of Quantum Computing

Discover EVENT

Menu

Do you want to learn how calculations are performed on quantum computers, with practical examples on simulators and real hardware?

In this course, we will talk about some of the most famous quantum algorithms, along with practical tutorials on how to use them. We will aim to enhance your understanding of the common challenges where a quantum algorithm can give an alternative to the classical method, as well as making you more familiar with existing implementations of quantum algorithms, which you can then make use of in your own work.

We will discuss two of the most famous quantum algorithms; Shor’s algorithm and Grover’s algorithm. Shor’s algorithm is famously known for its potential to break public-key cryptography schemes, such as RSA, developed in 1994 by the American mathematician Peter Shor. It runs almost exponentially faster than the best-known classical algorithm for finding the prime factors of an integer. Grover’s algorithm, devised by Lov Grover in 1996, solves the problem of searching through unstructured data. It is another interesting algorithm for both its quantum speed-up, and the generality of its application.

Pre-requisites: None