# TIES5480 Introduction to Quantum Computing and Reversible Computation (3 cr)

Study level:
0-5
Language:
English
Responsible organisation:
Faculty of Information Technology
Curriculum periods:
2022-2023, 2023-2024

## Description

The difference between quantum and traditional computing lies in so called speed and reversibility. Quantum computing is inherently reversible. This course aims to introduce quantum computing and reversible computation. Conventional computing, regardless of its realization technique, has internal power dissipation. Theoretically, using reversible computation the internal power dissipation becomes zero because reversible computation does not lose information. We will discuss the differences between conventional computing and reversible/quantum computing. Then quantum ternary circuits will be explained. We will also consider quantum circuits and algorithms. We will demonstrate how quantum computing will increase our computing power towards infinity.

• Basic Concepts of classical computing (digital logic, classical logic gates, classical circuits, complexity of algorithms)
• Moore’s Law, Landauer Principle, Bennett Principle
• Introduction to reversibility
• Reversible logic gates
• Figures of merit (constant inputs, garbage outputs, quantum cost, etc.)
• Reversible logic circuits
• Basic concepts of Mathematics, linear algebra, Statistics, complex numbers, (Ket – Bra – Quantum States).
• Qubit definition
• Ternary reversible circuits (qutrit)
• Definition of quantum computation
• Single-qubit quantum gates, Two-qubit quantum gates and universal gate sets
• Superposition and interference
• Bell states
• Quantum Entanglement
• Superdense coding
• Quantum Teleportation
• Deutsch and Deutsch-Jozsa, Bernstein-Vazirani, Shor’s factorization algorithm, and Grover’s Search algorithms
• Introduction to Python, Qiskit and Google Colab
• Designing quantum circuits using IBM Q Experience

##### Completion methods

Passing the course requires participation in lectures, receiving more than half of the exercise points and final project.

## Learning outcomes

After completing the course, the student will be able to understand:

- The basic concepts of quantum computing.

- The basic principles of reversible computation.

- The differences between conventional computing and quantum/reversible computing.

- The design of different reversible circuits.

- The concept of Ternary reversible circuits.

## Description of prerequisites

Basic knowledge of mathematics, linear algebra, statistics, complex numbers, algorithm data structure analysis, and logic circuit design will be helpful, but not necessary.

Primary audiences are M.Sc. students in information science, computer science, and electrical engineering.

B.Sc. students in information science, computer science, and electrical engineering may participate if they have a basic understanding of the prerequisites.

## Study materials

• Lecture slides
• sample Python programs
• Journal Papers.

## Literature

• Quantum computing explained, by David McMahon, John Wiley & Sons, 2007.
• Quantum Computing: A Gentle Introduction, by Eleanor Rieffel and Wolfgang Polak, MIT Press, 2011.
• Quantum Computer Science: An Introduction, by N. David Mermin, Cambridge University Press, 2007.
• Quantum computing: From linear algebra to physical realizations, by M. Nakahara and T. Ohmi, CRC Press, 2008.
• Nielsen &Chuang, Quantum Computing and Quantum Information, Cambridge University Press, 10th Anniversary Edition, 2010.

## Completion methods

### Method 1

Description:
Passing the course requires participation in lectures, receiving more than half of the exercise points and final project.
Select all marked parts
Parts of the completion methods
x

### Participation in teaching (3 cr)

Type:
Participation in teaching