
Discover how quantum computing differs from classical models through qubits in superposition and entanglement, and gate-based programming beyond von Neumann architecture.
Explore how photon polarization encodes qubits, using vertical and horizontal polarization and polarizing filters to illustrate 0 and 1 states and probabilistic transmission at angles.
Observe how a calcite crystal splits incoming photons into two streams: one aligned with the crystal and one anti-aligned at 90 degrees. Contrast this with polarizing filters, where only the aligned path emerges, and when input is neither aligned nor anti-aligned, exit paths follow probabilistic rules with probabilities between 0 and 1.
Explore how loss of information arises in quantum measurements by demonstrating the angle of polarization using a polarizing filter and a calcite crystal, showing aligned versus anti-aligned paths.
Map boolean true to 1 and on; map false to 0 and off. Use gates to produce on or off outputs, including and, or, not operations.
Demonstrate the two-input and gate with inputs A and B, whose output is on only when both inputs are on, and show its connection to the next or gate.
See how the or gate outputs on when inputs are on, and off when inputs are off, with an and-gate feeding one input and C the other.
Explore the nand gate as a universal gate, deriving and implementing and, or, and not gates from nand through truth tables.
Explore how the nand gate operates, its truth table, and how nand alone can implement not, and, or gates as a universal gate.
Explore the exclusive-or gate, its xor truth table and circuit symbol, and why in quantum architectures we apply b onto a atomically, sacrificing a's original data.
Demonstrate element-wise XOR of bit sequences, showing how each corresponding pair yields an output bit according to the XOR truth table, with step-by-step examples.
Encrypt and decrypt with a shared secret, a bit sequence known to the sender and the receiver. XORing the message with this secret, then XORing again, restores the original message.
Learn how probability theory models uncertain future events using likelihoods and probability distributions. See how quantum physics relies on probabilistic outcomes and data-driven estimates to predict often unpredictable results.
Identify independent events as unrelated outcomes whose occurrences do not influence each other; two dice throws and two coin tosses are classic examples.
Explore independent events and how A and B do not influence one another. Calculate P(A and B) = P(A) × P(B); with P(A)=0.3 and P(B)=0.4, P(A and B)=0.12.
Compute P(A) from P(A and B) and P(A and not B) using boolean algebra and the algebra of probabilities for composite events, illustrated by Alice's red and blue car example.
Explore probability with a Venn diagram by identifying A, B, and their union P(A or B) as the red region.
Explore translating probability expressions into diagram areas with Venn diagrams, compute P(A AND B), and relate AND, OR, NOT to intersection, union, and complement.
Explore how statistics analyzes probabilities of boolean and real-valued random functions, from true or false events to weather variables like maximum temperature and wind speed.
Explore random variables as uncertain outcomes mapped to numbers, using dice and coin tosses. Analyze aggregate behavior and compute the average value, revealing a zero mean over many trials.
Show how the mean alone fails to capture a random variable's behavior by comparing coin and die mappings, highlighting spread and magnitude of outcomes.
Explore how combining random variables forms a new variable and how its mean equals the sum of individual means, illustrated by coin toss and dice examples.
Examine correlation by analyzing independent, dependent, and mutually exclusive events, showing when P(A and B) equals or differs from P(A) times P(B) and related outcomes.
Multiply a real number by a complex number and apply scalar multiplication to a+bi as ka + kbi, with i treated like an unknown and examples like 3(2+3i) and (-4)(2-3i).
Learn to multiply complex numbers by treating i as an unknown, use i^2 = -1, and express results in standard form a + bi, as shown with (3+4i)(5+6i) = -9+38i.
Learn to divide complex numbers by multiplying numerator and denominator by the complex conjugate, turning the denominator into a real number (its squared magnitude), then simplify the complex numerator.
Practice solving complex division problems using the complex conjugate method, yielding real denominators and simplified results like -11/85 - (58/85)i and -2 + 5i.
Use polar form to find roots of complex numbers and compute the square root of i as 1/root(2) + i/root(2) via Euler's formula.
Understand matrices as tables of numbers and learn that a matrix’s dimension is the number of rows by columns. Remember: rows first, followed by columns, written as rows by columns.
Learn to add matrices by ensuring same dimensions, add corresponding elements, and work through real and complex number examples in 2x2 matrices.
Explore matrix subtraction by performing per-element operations on equal-sized matrices, illustrated with a 2x2 example and verifications, including subtraction with complex numbers.
Work through a complex numbers example to compute a matrix element as the product of a yellow row and orange column, yielding 9+i, 16+2i, 14, and 10.
Explore multiplying non-square matrices, such as a 3 by 2 example, and follow along with the animation to see how the matrix product is computed.
Explore the outer product by multiplying a column matrix with a row matrix to form a table of all possible products, illustrated with an animation.
Explore the concept of inverses in real numbers and matrices, including the notation x^-1 and A^-1, and how A times A^-1 equals the identity matrix.
Learn how the transpose transforms a matrix by interchanging rows and columns, represented by T, and visualized as mirroring about the diagonal.
Explore the transpose operation through additional examples in quantum physics, and practice by mirroring and interchanging rows and columns.
Explore the adjoint as the transpose of the complex conjugate, denoted by dagger, and its role in quantum physics, with guided practice through examples.
Explore how unitary matrices model reversible and irreversible quantum state transformations, and why the adjoint equals the inverse, since their product yields the identity.
Explore Hermitian matrices, the self-adjoint operators for irreversible quantum state transformations, compare them with unitary matrices, and verify the adjoint equals itself (A† = A).
Explain why hermitian and unitary matrices matter in quantum computing, highlighting initialization as an irreversible hermitian process, a reversible unitary core, and measurement as an irreversible hermitian final step.
Explore how matrix transformations rotate points in 2d, using anti-clockwise rotations of (1,0) by 30 and 90 degrees to illustrate matrix multiplications as linear transformations on a coordinate space.
Explore how a transformation matrix yields eigenvectors and eigenvalues that define invariant directions, like the lines y=x and y=-x, using unit vectors, and connect to quantum state transformations.
Explore how sequential polarizing filters affect photons, showing that polarization acts as a quantum measurement that alters light and can yield unexpected transmission through intermediate angles.
Encode data as polarized photons with vertical or horizontal polarization in the BB84 protocol, and understand how eavesdropping compromises security and the shared secret.
Explore how quantum mechanics uses complex numbers to model subtractive probabilities, illustrated by the double-slit interference pattern where probabilities add or cancel, and where square roots of probabilities become complex.
Explore how a quantum state is represented as a column matrix, or vector, with two elements for a qubit, whose complex numbers' square magnitudes yield spin-down and spin-up probabilities.
Analyze how a quantum bit's state is represented as a two-element column vector and how measurement transforms this state, yielding deterministic outcomes after the first probabilistic result.
Explore how measurements alter a quantum system using a black box analogy: drawing an apple or an orange collapses the state, changing future probabilities.
Explore Dirac bra-ket notation to express qubit vectors algebraically, with |0> and |1> representing off and on states, and the equal superposition 1/√2(|0>+|1>) illustrating a superposed qubit.
Debunks the myth that quantum states are random by showing well-defined electron spin and apparatus states, with randomness arising only during measurements in misaligned directions, as with photon polarization.
Explore how a not gate acts as a reversible transformation, swapping qubit states via matrix multiplication. Note the pattern: irreversible initialization, reversible gates, and irreversible measurement.
Welcome to the bestselling quantum computing course on Udemy!
Quantum Computing is the next wave of the software industry. Quantum computers are exponentially faster than classical computers of today. Problems that were considered too difficult for computers to solve, such as simulation of protein folding in biological systems, and cracking RSA encryption, are now possible through quantum computers.
How fast are Quantum Computers? A 64-bit quantum computer can process 36 billion billion bytes of information in each step of computation. Compare that to the 8 bytes that your home computer can process in each step of computation!
Companies like Google, Intel, IBM, and Microsoft are investing billions in their quest to build quantum computers. If you master quantum computing now, you will be ready to profit from this technology revolution.
This course teaches quantum computing from the ground up. The only background you need is 12th grade level high-school Math and Physics.
IMPORTANT: You must enjoy Physics and Math to get the most out of this course. This course is primarily about analyzing the behavior of quantum circuits using Math and Quantum Physics. While everything you need to know beyond 12th grade high school science is explained here, you must be aware that Quantum Physics is an extremely difficult subject. You might frequently need to stop the video and replay the lesson to understand it.
QUANTUM MACHINE LEARNING
It appears that the killer-app for quantum computing will be machine learning and artificial intelligence.
Quantum machine learning algorithms provide a significant speed-up in training. This speed-up can result in more accurate predictions.
While understanding quantum algorithms requires mastery of complex math, using quantum machine learning is relatively simple. Qiskit encapsulates machine learning algorithms inside an API that mimics the popular Scikit-Learn machine-learning toolkit. So you can use quantum machine learning almost as easily as you would traditional ML!
Quantum machine learning can be applied in the back-end to train models, and those trained models can be used in consumer gadgets. This means that quantum machine learning might enhance your everyday life even if quantum computers remain expensive!
COURSE OUTLINE
We begin by learning about basic math. You might have forgotten the math you learned in high-school. I will review linear algebra, probability, Boolean algebra, and complex numbers.
Quantum physics is usually considered unapproachable because it deals with the behavior of extremely tiny particles. But in this course, I will explain quantum physics through the behavior of polarized light. Light is an everyday phenomenon and you will be able to understand it easily.
Next we learn about quantum cryptography. Quantum cryptography is provably unbreakable. I will explain the BB84 quantum protocol for secure key sharing.
Then we will learn about the building-blocks of quantum programs which are quantum gates.
To understand how quantum gates work, we will study quantum superposition and quantum entanglement in depth.
We will apply what we have learned by constructing quantum circuits using Microsoft Q# (QSharp) and IBM Qiskit. For those of you who don't know the Python programming language, I will provide a crisp introduction of what you need to know.
We will begin with simple circuits and then progress to a full implementation of the BB84 quantum cryptography protocol in Qiskit.
The killer-app for quantum computing is quantum machine learning.
To understand quantum machine learning, we must first learn how classical machine learning works. I provide a crisp introduction to classical machine learning and neural networks (deep learning).
Finally, we will train a Quantum Support Vector Machine on real-world data and use it to make predictions.
For a better learning experience, open the transcript panel.
You will see a small "transcript" button at the bottom-right of the video player on Udemy's website. If you click this button, the transcript of the narration will be displayed. The transcripts for all the videos have been hand-edited for accuracy. Opening the transcript panel will help you understand the concepts better.
If you missed an important concept, then you can click on text in the transcript panel to return directly to the part you want to repeat. Conversely, if you already understand the concept being presented, you can click on text in the transcript panel to skip ahead in the video.
Pacing : This course is designed to be slow with a lot of repetition.
Quantum physics is easier for beginners to understand when concepts are repeated. If you want to learn at a faster pace, then open the transcripts panel (as explained in the previous paragraph above) and click the transcript-text to skip ahead to the next concept.
Enroll today and join the quantum revolution!