Introduction to Quantum Computing |
|
Conclusion and test
In this lesson, you will review and demonstrate your knowledge of quantum computing.
IBM |
1. Review
Here is a list of the topics presented in this introduction to Quantum Computing. You can look back at each lesson, and remind yourself of what you have learned.
Lesson |
Topic |
Main ideas |
1 |
Why quantum: How big is a bit? |
Digital computers use binary digits The volume of a binary digit has been shrinking The time when a binary digit will be as small as an atom may be in the next 10-20 years. |
2 |
What is a qubit? |
What atoms are made of Representing quantum particles like atoms with the Bloch sphere. How a qubit is constructed
|
3 |
Writing my first quantum score |
Creating an account on the IBM Q Experience Using Composer Measuring qubit quantum states and their probabilities |
4 |
Quantum gates |
The Pauli X, Y and Z gates Combinations of gates on a single qubit |
5 |
Superposition |
The Hadamard gate Probability of output states Superposition for multiple qubits The simple Lisiecki program |
6 |
Entanglement |
The CNOT gate Grover’s selection algorithm |
7 |
Project |
Implementing your own quantum program Documenting the quantum score, output and programming intention |
2. Test
Here is a short test to help you confirm what you know about quantum computing. Click on the arrow to take the test
3. Fun
If you have finished the test, why not relax with a game of quantum battleships?