 # The Introduction to Quantum Computing

• Intro
• In this module we will discuss the nature of computations. How would you define a computation? How computations evolved? We will take a look at the computer generations and what they mean to us if we want to predict what comes next on this way. Aside of computer generations we'll talk about the computational complexity theory and its problems. And all these will lead us to the conclusion, that quantum computing is our future.
• Mathematical Model of Quantum Computing
• Quantum computing is based on quantum mechanics, Captain Obvious already told us that. But learning quantum mechanics might take some time (for those who didn't do that yet), so if we want to start learning quantum computing now, we are going to need some workaround. The mathematical model of quantum computing is just what we need. We skip all underlying physics and provide the model of a computational process that satisfies it. Just that simple.
• Quantum Computer and Quantum Algorithms
• Now, when we learned the mathematical model, we are ready for the real stuff - the algorithms. In this module we will design, discuss and analyse the real quantum algorithms and even build the real quantum computer for one of them!
• Shor's Algorithm
• The algorithms from the previous module were simple, cute and apparently useless. Let's take a look at what the real useful quantum algorithm looks like. In this module we'll learn the most famous quantum algorithm in the world - Shor's algorithm for period finding (and number factoring of course).
• Grover's Algorithm. A Quantum Computer Application Boundaries
• Shor's algorithm is really impressing, isn't it? It makes us feel that we found the source of infinite computing power! But is that so? What tasks can we solve this much faster? All of them? In this module we are going to curb our optimisme and to learn one of the most notorious and elegant quantum algorithms - the Grover's algorithm for the unsorted database search.

### Plataforma 