About This Course
Who this course is for:
- Beginners who want to start with Practical Quantum Computing Concepts
What you’ll learn:
- Learn and understand about General Quantum Computing based on IBM Qiskit Documentation
- Basic computer knowledge and enthusiasm about Quantum Computing are the only prerequisites
Hello and welcome to my new course The Dummies guide to Practical Quantum Computing with IBM Qiskit. Our current classical computing technology is based on bits or binary digits 1 and 0 . 1 for ON and 0 OFF. Even though it has two states, a bit can exist in only one state at a time. Just like a coin having two faces head and tail.
NOTE: In classical computers a programmer can simply WRITE HIGH LEVEL CODE AND RUN it. But for Quantum Computers we have to DESIGN CIRCUITS for performing specific tasks.
Quantum computing concept is entirely different from classical one. It uses the quantum mechanical property of tiny sub-atomic particles like electrons to perform computation. Instead of 1 and 0, a qubit or quantum bit uses the spin position ‘up’ and ‘down’ of electrons.
But unlike bits, qubits can exist in both states simultaneously. Like a coin keeps on spinning, we could say it is having equal probability for both head and tail. Or it is both head and tail at the same time.
As the number of qubits increases, this speed increases exponentially compared to classical computers. Computations like data analytics, artificial intelligence which require large parallel processing ability, can be calculated in a matter of milli-seconds, where currently, it takes ages to complete.
Even though it’s not going to replace our laptops or mobile phones, Quantum computers will be able to solve these roadblocks of traditional computers in data processing.
Overall, this will be a nice course for beginners who are fascinated about quantum computing and want to learn more about quantum computing. Actual quantum computing is all about complex boring mathematics and formulas which I have tried my maximum to avoid, I converted it in a very simple way to make it understandable to a beginner.
In this course we are strictly following the IBM Qiskit documentation and text book. Almost all of the illustrations and examples used in this course are from the IBM Qiskit Documentation website which you may refer for further learning from this point.
Quantum computers could help the development of new breakthroughs in science, medications, machine learning, material science, finance – which helps mankind to become the best civilization in the whole universe. In fact, quantum computers are so powerful that no one knows how to use their true potential and till now no quantum algorithm is perfect. The hardware and code are still in its development stage providing great opportunities in future for quantum computing professionals.
So that’s all for now, see you soon inside the course. Happy learning and have a great time.
Our Promise to You
By the end of this course, you will have learned Quantum Computing concepts.
30 Day Money Back Guarantee. If you are unsatisfied for any reason, simply contact us and we’ll give you a full refund. No questions asked.
Get started today and learn more about quantum computing.
|Section 1 - Course Introduction And Table Of Contents|
|Course Introduction And Table Of Contents||00:00:00|
|Section 2 - Introduction To Quantum Mechanics|
|Introduction To Quantum Mechanics – Part 1||00:00:00|
|Introduction To Quantum Mechanics – Part 2||00:00:00|
|Section 3 - Classical Bit vs Quantum Qubit|
|Classical Bit vs Quantum Qubit – Part 1||00:00:00|
|Classical Bit vs Quantum Qubit – Part 2||00:00:00|
|Classical Bit vs Quantum Qubit – Part 3||00:00:00|
|Classical Bit vs Quantum Qubit – Part 4||00:00:00|
|Section 4 - Creating, Retaining And Reading Out Qubits|
|Creating, Retaining And Reading Out Qubits – Part 1||00:00:00|
|Creating, Retaining And Reading Out Qubits – Part 2||00:00:00|
|Section 5 - Vector And Matrix Quantum States|
|Vector And Matrix Quantum States||00:00:00|
|Section 6 - Classic Logic Gates Overview|
|Classic Logic Gates Overview||00:00:00|
|Section 7 - Popular Quantum Frameworks|
|Popular Quantum Frameworks||00:00:00|
|Section 8 - Installing Anaconda Python Distribution|
|Installing Anaconda Python Distribution||00:00:00|
|Section 9 - Installing And Testing Qiskit|
|Installing And Testing Qiskit||00:00:00|
|Section 10 - Pauli X-gate In Qiskit|
|Pauli X-gate In Qiskit – Part 1||00:00:00|
|Pauli X-gate In Qiskit – Part 2||00:00:00|
|Pauli X-gate Input And Output Customizations||00:00:00|
|Pauli X-gate In Real IBM Quantum Computer||00:00:00|
|Pauli Matrices As State Vectors||00:00:00|
|Section 11 - Pauli Y-gate Operations|
|Pauli Y-gate – Part 1||00:00:00|
|Pauli Y-gate – Part 2||00:00:00|
|Pauli Y-gate – Part 3 – In Real Quantum Computer||00:00:00|
|Seciton 12 - Pauli Z-gate|
|Section 13 - Eigen Vectors Of XYZ gates|
|Eigen Vectors Of XYZ gates||00:00:00|
|Section 14 - Hadamard Gate|
|Hadamard Gate Introduction||00:00:00|
|Hadamard Gate In Qiskit||00:00:00|
|Hadamard Gate Exercises – Part 1||00:00:00|
|Hadamard Gate Exercises – Part 2 – X With H And Z||00:00:00|
|Hadamard Gate Exercises – Part 3 – Superposition Collapse||00:00:00|
|Section 15 - H gate In Real Quantum Computer|
|H gate in Real Quantum Computer||00:00:00|
|Section 16 - R phi Gate|
|R phi Gate||00:00:00|
|Section 17 - S And T Gates|
|S And T Gates||00:00:00|
|Section 18 - U And I Gates|
|U And I Gates||00:00:00|
|Section 19 - Multi Qubit States|
|Multi Qubit States Introduction||00:00:00|
|Representing Multi Qubit States||00:00:00|
|Multi Qubit Circuit Using Single Qubit Gates – Sample Circuit 1||00:00:00|
|Multi Qubit Circuit Using Single Qubit Gates – Sample Circuit 2||00:00:00|
|Section 20 - CNOT Gate|
|CNOT Gate With Classical Qubits||00:00:00|
|CNOT Gate With Control Qubit Superposition||00:00:00|
|CNOT Gate With Control Qubit Superposition – In Real Quantum Computer||00:00:00|
|CNOT Gate With Both Qubit Superposition||00:00:00|
|CNOT Gate With Both Qubit Superposition Target X||00:00:00|
|CNOT Circuit Identities – Part 1||00:00:00|
|CNOT Circuit Identities – Part 2||00:00:00|
|Section 21 - CZ Circuit Identity|
|CZ Circuit Identity – Part 1||00:00:00|
|CZ Circuit Identity – Part 2||00:00:00|
|Section 22 - CY Circuit Identity|
|CY Circuit Identity||00:00:00|
|Section 23 - SWAP Circuit Identity|
|SWAP Circuit Identity||00:00:00|
|Section 24 - Toffoli Gate|
|Toffoli Circuit Identity||00:00:00|
|Section 25 - DJ Algorithm|
|DJ Problem Overview||00:00:00|
|DJ Algorithm Design||00:00:00|
|DJ Algorithm Implementation – Part 1||00:00:00|
|DJ Algorithm Implementation – Part 2||00:00:00|
|DJ Algorithm Implementation – Part 3||00:00:00|
|Section 26 - Quantum Cryptography : Quantum Key Distribution|
|Quantum Key Distribution – RSA Concepts||00:00:00|
|Quantum Key Distribution – Concepts||00:00:00|
|Section 27 - Quantum Teleportation Theory|
|Quantum Teleportation Theory||00:00:00|
|Section 28 - Further Learning And Resources|
|Further Learning And Resources||00:00:00|
|Source Code And Files||00:00:00|