The course will be held ONLY IN PRESENCE (no STREAMING AVAILABLE) at Cineca Site in Casalecchio di Reno, BO, Italy.
SUBSCRIPTIONS WILL OPEN ABOUT 3 MONTHS IN ADVANCE OF THE FIRST DAY OF LESSON.
Description
The "Introduction to Quantum Computing" school aims to provide students with the necessary skills to effectively use the emerging quantum machines that have become available in recent years. These machines are constantly evolving and require specialized knowledge to operate. Although their technology is not yet fully mature, it is strategically important for students to learn how to use them early on, as they are fundamentally different from traditional computers. The school covers the basics of quantum mechanics and linear algebra, and then delves into practical and theoretical aspects of popular quantum concepts and algorithms using various available quantum machines. Additionally, there will be hands-on sections using emulators installed on our High Performance Computing (HPC) machines to provide practical experience.
Topics
Introduction to different Quantum Hardwares and Quantum Softwares. Linear algebra Recap (Dirac notation, Hermitian Matrices, tensor product, Schmidt decomposition). Postulates of quantum mechanics (Qubit states , unitary evolution, measurement). Quantum gates. Entanglement. Quantum Parallelism. Quantum Error Correction. Introduction to General Purpose Quantum Algorithms with examples. Introduction to NISQ Quantum Algorithms with examples. Adiabatic quantum computing (AQC) and Quantum Annealing (QA). Hands-on sessions.
Target Audience
The course is aimed at scientific university students, as well as PhD students and researchers. In principle, anyone who meets the required prerequisites can send a request to participate.
Prerequisites
Knowledge of mathematics, in particular linear algebra. Knowledge of python programming. Knowledge of Unix environments. Knowledge of quantum mechanics is not a fundamental prerequisite, even if it represents a considerable help for understanding the topics covered.