Salta al contenuto principale della pagina

## ELEMENTS OF QUANTUM COMPUTING

CODE 98389 2020/2021 6 credits during the 3nd year of 8759 Computer Science (L-31) GENOVA 6 credits during the 2nd year of 9011 Mathematics (LM-40) GENOVA FIS/02 Italian GENOVA (Computer Science) 1° Semester AULAWEB

## OVERVIEW

The course is an introduction to quantum information and computation.

## AIMS AND CONTENT

### PREREQUISITES

There are no particular prerequisites for the mathematics and physics.
The mathematical tools needed will be introduced during the course.

### TEACHING METHODS

Theoretical lectures supported by more applicative ones focused on the quantum computers languages (Qiskit by IBM and CIRQ by Google)

### SYLLABUS/CONTENT

1.    Physics of computation
1.1 Basic concepts in Informatics: logical gates, universal and reversible logical gates
1.2 Billiard ball and DNA computers
2   Mathematical tools
2.1 Complex numbers, vector space and operations
2.2 Tensor product
2.3 Hermitian operators, eigenvectors and eigenvalues and matrix representation of an operator
3    Introduction to quantum phenomena
3.1 Double slit and light polarization experiments
3.2 Quantum state, quantum superposition and quantum bit (qubit)
3.3 Quantum measurement
3.4 Composite quantum systems and entanglement
3.5 Unitary transformations, logical gates with one and two qubits
3.6 Pauli operators and Bloch sphere representation
4    Introduction to quantum information
4.1 Quantum parallelism, no-cloning theorem, super-dense coding and quantum teleportation
4.2 Quantum algorithm: Deutch, Deutch-Joza, Bernstein-Vazirani and Simon
5    Quantum cryptography
5.1 Fundamental concepts in classical cryptography: public and private key cryptography
5.2 Quantum cryptography protocols: BB84 and Ekert91
6    Quantum algorithm for the search in a database: (Grover’s algorithm)
6.1 Fundamental concepts in database search algorithms
6.2 Grover’s algorithm
7    Quantum Fourier transform and quantum phase estimation algorithm
7.1 Mathematical tools
7.2 Quantum Fourier transform and quantum phase estimation algorithm
7.3 Applications: quantum counting algorithm
8 HHL algorithm (for linear algebra) and Shor’s algorithm (for integer factorization)
9   Introduction to error correcting codes
9.1 Fundamental concepts in the classical case and differences with the quantum case
9.2 Composite observables and their eigenvalues
9.3 Quantum error correcting codes
10 Algorithm and quantum protocols implementation with the IBM quantum experience

P. Solinas – Notes: “Introduzione all’Informatica quantistica”

M. A. Nielsen e I. L. Chuang "Quantum Computation and Quantum Information", Cambridge University Press (2011)

N. S. Yanofsky e M. A. Mannucci  "Quantum Computing for Computer Scientists", Cambridge University Press (2008)

E. G. Rieffel and W. H. Polak "Quantum Computing: A Gentle Introduction (Scientific and Engineering Computation)"
The MIT Press (2011)

## TEACHERS AND EXAM BOARD

### Exam Board

PAOLO SOLINAS (President)

PIERANTONIO ZANGHI'

ALESSANDRO VERRI (President Substitute)

## LESSONS

### TEACHING METHODS

Theoretical lectures supported by more applicative ones focused on the quantum computers languages (Qiskit by IBM and CIRQ by Google)

### LESSONS START

The lectures will start according to the academic calendar

### Class schedule

All class schedules are posted on the EasyAcademy portal.

## EXAMS

### EXAM DESCRIPTION

The exam is composed by an oral examination and a home assignment.
In home assignment the student will be asked to solve a simple problem by writing a code for a quantum computer and he/she will be asked to write a short report.

### Exam schedule

Date Time Location Type Notes
15/01/2021 09:00 GENOVA Orale
01/02/2021 09:00 GENOVA Orale
11/06/2021 09:00 GENOVA Orale
06/07/2021 09:00 GENOVA Orale
16/09/2021 09:00 GENOVA Orale