# Quantum computation

## Summary

The course introduces teh paradigm of quantum computation in an axiomatic way. We introduce the notion of quantum bit, gates, circuits and we treat the most important quantum algorithms. We also touch upon error correcting codes. This course is independent of COM-309.

## Content

**Introduction to quantum computation**

- Classical circuit model, reversible computation

- Quantum bits, Hilbert space of N qubits, Unitary transformations, measurement postulate.

- Quantum circuit model, universal sets of gates.

- Deutsch and Josza problem.**Basic algorithms**

- Hidden sub-group problem and Simon's algorithm

- Mathematical parenthesis: factoring integers and period of arithmetic functions. Notions on continued fraction expansions.

- Quantum Fourier transform and the period fincding algorithm

- Shor's factoring algorithm.

- Grover serach algorithm.

**Error correcting codes**

- Models of noise and errors.

- Shor and Steane error correcting codes.

- Stabilizer codes.

- Calderbank-Shor-Steane construction.

## Keywords

Quantum computation, quantum circuits, universal gates, quantum Fourier transform, Simon algorithm, Shor algorithm, Grover algorithm, entanglement, quantum error correction.

## Learning Prerequisites

## Required courses

Linear algebra course, basic probability course.

## Important concepts to start the course

Matrices, unitary matrices, eigenvectors, eigenvalues, inner product, algebra of complex numbers

## Learning Outcomes

By the end of the course, the student must be able to:

- Explain teh concept of quantum algorithm on the circuit model
- Describe universal gates
- Describe basic quantum algorithms
- Compute the evolution of a state through a circuit
- Apply the measurement postulate
- Manipulate algebraic expressions involving the Dirac notation
- Carry out implementaions on public NISQ devices
- Give an example of an error correcting code

## Teaching methods

Ex-Cathedra. Exercises. Use of IBM Q NISQ devices.

## Expected student activities

Participation in class, exercise sessions, use of IBM Q NISQ devices

## Assessment methods

mini project on IBM Q experience, graded homeworks, written final exam

## Supervision

Office hours | No |

Assistants | Yes |

Forum | Yes |

Others | Assistants answer questions during exercise sessions |

## Resources

## Bibliography

**N. David Mermin**: Quantum Computer Science, an introduction. Cambridge University Press**Nielsen and Chuang**: Quantum Computation and Information. Cambridge University Press

## Ressources en bibliothèque

## Notes/Handbook

yes

## Websites

## In the programs

**Semester:**Spring**Exam form:**Written (summer session)**Subject examined:**Quantum computation**Lecture:**3 Hour(s) per week x 14 weeks**Exercises:**1 Hour(s) per week x 14 weeks

**Semester:**Spring**Exam form:**Written (summer session)**Subject examined:**Quantum computation**Lecture:**3 Hour(s) per week x 14 weeks**Exercises:**1 Hour(s) per week x 14 weeks

**Semester:**Spring**Exam form:**Written (summer session)**Subject examined:**Quantum computation**Lecture:**3 Hour(s) per week x 14 weeks**Exercises:**1 Hour(s) per week x 14 weeks

**Semester:**Spring**Exam form:**Written (summer session)**Subject examined:**Quantum computation**Lecture:**3 Hour(s) per week x 14 weeks**Exercises:**1 Hour(s) per week x 14 weeks

## Reference week

Mo | Tu | We | Th | Fr | |

8-9 | |||||

9-10 | |||||

10-11 | |||||

11-12 | |||||

12-13 | |||||

13-14 | |||||

14-15 | |||||

15-16 | |||||

16-17 | |||||

17-18 | |||||

18-19 | |||||

19-20 | |||||

20-21 | |||||

21-22 |