
Identify how boolean values map to signals, with true as 1 and on, false as 0 and off, and how gates such as and, or, and not form computing basis.
Explore the exclusive-or gate and its XOR truth table. Learn how to perform A = A XOR B as an atomic operation, updating A by XORing B in quantum architectures.
Use the xor gate to perform variable assignment in quantum computing by initializing A to 0 and xor B onto A, yielding A = B.
Learn to xor bit sequences to produce a consistent-length output by processing inputs element by element. Review the xor truth table and see how paired bits generate the output sequence.
Explore xor-based encryption by converting the message to bits and using a shared random secret. The sender and receiver apply xor with the secret and transmit the ciphertext.
Define independent events as occurrences with no influence on each other. Illustrate with two dice throws, two coin tosses, and unrelated choices like Alice and Bob's car colors.
Explore the probability of A or B as the union of A and B in a Venn diagram, with the red region representing P(A or B).
Explore random variables as uncertain outcomes mapped to numbers, using dice and coin toss examples. Analyze aggregate behavior and compute the average value, illustrating +1 and -1 mappings.
Position complex numbers as intermediate quantities that simplify quantum state transformations through linear operations, highlighting their algebraic completeness and usefulness in modeling quantum systems.
Divide complex numbers by conjugates to obtain real denominators, multiply numerator and denominator by the conjugate, and simplify to final answers such as -11/85 - (58/85)i and -2 + 5i.
Matrix multiplication, essential for quantum computing, multiplies a row of the first matrix by a column of the second and sums the products to form each result element.
Pause the video to work through exercises, verify your computations against the provided answers, and tackle additional problems to reinforce math prerequisites for QC.
Learn when matrix multiplication is possible: the number of columns of the first matrix must equal the number of rows in the second, as shown by matching dimensions.
Compute the outer product by multiplying a column matrix with a row matrix to form a table of all pairwise products, illustrated by animation.
Define vectors as column matrices and show how a square matrix maps a column vector via x2 = Ax1 + By1, y2 = Cx1 + Dy1, and eigenvectors.
THE CONTENTS OF THIS COURSE HAVE BEEN ADDED TO QC101.
Purchase this course if you want only the math lessons without the rest of QC101.
The contents of this course have been added to the section on Math Foundation in QC101.
-----------
This is a refresher course in Mathematics for students who studied Math and Physics through 12th grade high school, but have now forgotten many of the details. In less than 4 hours I review the Math you will need to understand quantum computing concepts.
The focus is on getting you up to speed as quickly as possible. I cover what you need to know: Probability, Statistics, Boolean Logic, Complex Numbers, and Linear Algebra. You will not waste time on topics you do not need for quantum computing.
To get the most out of this course, you need to have already studied Math at a 12th grade level in high-school. This is merely a review course to help you refresh your memory. If you have not studied these topics in high school, then this 4 hour course cannot substitute for 2 years of high school Math classes.
This course reviews basic high-school Math. It doesn't go into any details about quantum physics or quantum computing. Those topics will be discussed in subsequent courses of this series.