Workshop on Quantum Algorithms and Cryptography

About the workshop

Quantum computing is an exciting computational resource whose capabilities are not yet fully understood. Shor's algorithm was a breakthrough result, providing a polynomial-time algorithm to the factoring problem using a quantum computer. Just a few years later, Grover showed how to perform searches in an unsorted database much faster than classical computers. Both of these algorithms are pioneering results that have gained significant attention from computer scientists. Over the last three decades, we have seen more exciting developments in these directions.

In this workshop, we will have talks on recent advancements in quantum algorithms and quantum cryptography. The target audience includes senior undergraduate and postgraduate students, as well as early-career researchers. We also plan to cover the basics of quantum computing in the first two sessions before moving on to advanced or recent topics.