
Build a fast refresher in math prerequisites for quantum computing by revisiting Boolean logic, probability, complex numbers, and linear algebra, with crossover skills for quantum biochemistry applications.
Explore boolean algebra and boolean logic, where true or false statements combine with and, or, and not under mathematical rules, forming groundwork for quantum cryptography and shared secret codes.
Explore truth tables to define boolean functions and operators, including and, or, not, exclusive or, and nand. See how 2^n rows enumerate all input combinations, with 1 as true and 0 as false.
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 a logic circuit and its logical expression, showing how the not operation applies last and how an or gate uses input C and the result of A and B.
Examine the and gate with two inputs and one output, which turns on only when both inputs are on, and its relation to the or gate in the next lesson.
Explore the or gate: the output is on if either input is on, off only when both inputs are off, with the and gate feeding one input and C.
Understand the not gate in logic circuits: a single-input inverter shown as a triangle with a circle, with a truth table 0→1 and 1→0, used after an or gate.
Learn how multi-input gates work by examining a 3-input and gate and a 3-input or gate built from 2-input gates, and how 3-input functions are equivalent to chained 2-input gates.
Realize an and gate using or and not gates, and verify with a truth table that inputs A and B yield output C identical to a standard and gate.
Construct an or gate from an and gate with not gates and derive the boolean expression for a or b. Confirm the result with a truth table.
Discover the NAND gate and its universal status, acting as an AND gate followed by a NOT. Learn to build NOT, AND, and OR gates using NAND configurations.
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.
A xor B xor B equals A, showing that xor-ing B twice cancels its effect. This concept applies to bit sequences and is relevant in quantum cryptography.
Quantum physics enables cryptography with protocols secure against known attacks, while quantum computers break RSA. Explore secure messaging over insecure channels and uses like protecting passwords and financial data.
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.
Encrypt and decrypt messages using a shared secret; the same random bit sequence enables a second xor to recover the original message.
Explore how randomness strengthens cryptography: xor-ing a random bit sequence with a message yields a patternless output, and using a new random sequence for each encryption is essential.
Explore probability theory's role in modeling future uncertainty through likelihoods, distributions, and quantum probabilistic outcomes, illustrated by dice, coins, and data-driven estimates of market behavior.
Explore how probability applies to boolean expressions by treating true and false as events, using the notation P, and evaluating probabilities of A and B or A or B.
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.
Apply the algebra of probabilities to boolean expressions, expressing their probability in terms of individual event probabilities, with examples like probability of (A and B) or C.
Explore mutually exclusive events, where A implies not B and B implies not A, meaning A and B cannot both occur; thus P(A and B) equals zero.
Analyze how independent events multiply to yield joint probability, with P(A and B) = P(A) × P(B). For example, Alice’s red car (0.3) and Bob’s blue car (0.4) give 0.12.
Learn how mutually exclusive events work and apply the addition rule to find P(A or B). When A, B, C, and D form a complete set, their probabilities sum to 1.
Apply the general formula P(A or B) = P(A) + P(B) - P(A and B) to any events, including mutually exclusive or independent cases.
Explore how to compute the probability of A OR B for independent events, using P(A OR B) = P(A) + P(B) − P(A)P(B) with P(A)=0.2 and P(B)=0.3, yielding 0.44.
Use boolean algebra and probability rules to derive P(A) from P(A and B) and P(A and not B); events are mutually exclusive, so P(A) = 0.3 + 0.2 = 0.5.
Analyze how bits take 0 or 1 and derive single-bit probabilities from two-bit outcomes (00, 01, 10, 11) in quantum computing, using P(first bit = 1) = P(11) + P(10).
Explore using Venn diagrams to solve probability problems involving boolean expressions and P() operators, visualizing events, probabilities, and the complete set with a single diagram.
Explore representing composite events on Venn diagrams, focusing on the red region for A and B and its area as P(A and B), with connections to familiar high school diagrams.
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).
Learn to depict P(not A) on a Venn diagram by identifying the complement as the region outside A within the universal rectangle.
Use probability diagrams to solve problems visually by calculating A and not B, not A and B, and A or B from P(A)=0.2, P(B)=0.3, and P(A and B)=0.05.
Explore how diagrams map A OR B and A AND B to areas, using P(A), P(B), and P(A OR B) to compute P(A AND B).
Learn conditional probability formulas P(B|A)=P(A∩B)/P(A) and P(A|B)=P(A∩B)/P(B) through a real-world grocery example with 100 buyers, 10 apples, 20 oranges, and 5 both, yielding a 0.5 probability of orange given apple.
Explore how statistics analyzes probabilities of random real-valued functions, such as maximum temperature and wind speed, beyond true/false events. Learn how uncertain outcomes differ from boolean functions and anticipate lessons.
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.
Map real world events to random variables by assigning a real number to each outcome in a complete, mutually exclusive set. Dice mappings show how different averages arise.
Explore aggregate properties of random variables, including mean, average, estimate, and expected value, and see how a dice example computes the mean as the sum of v_i P(v_i).
Explore how loaded dice favor outcomes, with probabilities summing to 1 for a complete, mutually exclusive set. Compute the mean by summing value times probability, revealing a mean of 4.2.
Compute the mean of a random variable for an unfair coin, mapping -1 to tails and +1 to heads with p(tails)=0.48, p(heads)=0.52, yielding a 0.04 mean that suggests possible bias.
Explore how the mean alone fails to describe a random variable, as coin and dice mappings show the same mean with very different distributions.
Explore how standard deviation measures a random variable’s spread from its mean using a fair dice example, defining variance as the mean squared deviation and taking its square root.
Explore how to compute variance and standard deviation for different random variables, using fair and unfair coins and a loaded die, with mean calculations.
Treat a random variable as a function with uncertain outcomes, and form a new variable by adding X+Y; the mean of X+Y equals the sum of means.
Explore dependent events and how probabilities differ from independence, using examples of related outcomes, mutual exclusivity, and envelope coin probabilities to analyze P(A and B).
Explore how to analyze correlated random variables using the product mean of RVA and RVB. Learn how independence versus correlation affects E[RVA RVB] and how mapping outcomes changes the results.
Position complex numbers as intermediate quantities that simplify quantum state transformations through linear operations, highlighting their algebraic completeness and usefulness in modeling quantum systems.
Define i as the square root of -1 and represent fractional powers as complex numbers in the form a + bi, with real part a and imaginary part b.
Add complex numbers by treating i as an unknown, using i^2 = -1, and separating real and imaginary parts. Practice with examples like (1+2i)+(3+4i)=4+6i and (-6+7i)+(-1-2i)=-7+5i.
Learn to subtract complex numbers by removing parentheses, grouping real and imaginary terms, and compute results such as 2+i and 9-i.
Multiply a real number by a complex number by scaling both parts: k(a+bi)=ka+kbi, as 3(2+3i)=6+9i and (-4)(2-3i)=-8+12i.
Demonstrate dividing a complex number by a real number, yielding results like 4+6i divided by 2 equals 2+3i and (7+2i)/(-3) equals -7/3 - (2/3)i.
Treat i as an unknown and multiply complex numbers by expanding products, using i squared equals -1, and write the result in the real-first a plus bi form.
Multiply complex numbers by expanding with the usual algebra rules, treat i as an unknown, replace i squared with -1, and write the real part first, then the imaginary part.
Explore complex conjugates to simplify dividing complex numbers, by changing the sign of the imaginary part in a + bi to a - bi.
Explore the squared magnitude of complex numbers using a^2 + b^2 and the complex conjugate, with examples like 2+3i and 7-6i.
Apply the complex conjugate method to divide complex numbers, converting the denominator to a real number and simplifying, as shown by 1+2i divided by 3+4i equals 11/25 plus 2/25 i.
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.
Explore how e^ix equals cos x plus i sin x, linking trigonometry with exponentials, and show any unit complex a+bi can be written as cos x plus i sin x.
Express any complex number a + bi as r e^{i x}, with r the magnitude and the unit-magnitude factor e^{i x} or cos x + i sin x.
Convert polar form to standard form and back for complex numbers using e^{i theta} = cos theta + i sin theta, calculating magnitude and angle with pi/4 and pi/3.
Compute powers of complex numbers by converting to polar form r e^(i x), covering integer and fractional powers. Explore cube roots of 1 using e^(i x) and angles 2π/3 and 4π/3.
Show that cubing the complex number yields 1 and identify the three complex cube roots of unity. Express in polar form and use 2π angle shifts to compute fractional powers.
Utilize polar form to find roots of complex numbers and compute the square root of i using Euler's formula, obtaining e^(i pi/4) = (1/√2)(1+i).
Represent complex numbers on a 2d coordinate space as a+bi mapped to (a,b), with real part x and imaginary part y, and relate to r e^(i theta).
Explore how quantum physics uses linear algebra to describe a system's state as a collection of numbers in matrices with real and complex entries and addition, subtraction, and multiplication.
Define a matrix as a table of numbers and its dimensions as rows by columns, with rows first and columns second, such as 2 by 1 and 3 by 3.
Learn matrix addition by adding corresponding elements of matrices with the same dimension, exemplified by 2x2 matrices, with exceptions for unequal dimensions, and including complex-number cases.
Master matrix subtraction by performing element-wise subtraction on matrices with identical dimensions, illustrated with 2x2 examples and animated highlights. Practice verifying results, including subtraction with complex numbers.
Multiply a matrix by a scalar, applying the scalar to each element. Real or complex scalars may be used, with 2x2 examples and verification prompts.
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.
We explore complex numbers by computing the blue element as the product of the yellow row and orange column, yielding 9 + i, 16 + 2i, 14, and 10.
Follow along this animation to multiply a 3 by 3 matrix with another 3 by 3 matrix, then pause to compute each element yourself.
Pause the video to work through exercises, verify your computations against the provided answers, and tackle additional problems to reinforce math prerequisites for QC.
Explore how to multiply non-square matrices, such as a 3 by 2, by applying the multiplication rule. Follow the animation to see how the product is computed.
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.
Assess whether two matrices can be multiplied by comparing inner dimensions; a 2x2 and a 3x2 do not satisfy the rule, so multiplication is not possible.
Matrix multiplication is not commutative; AB may be defined while BA is not, and the order of factors matters, with AB and BA sometimes equal, sometimes not.
Learn that matrix multiplication is associative and distributive, enabling algebraic manipulations like A(BC) = (AB)C and A(B+C) = AB + AC, while AB does not equal BA.
Multiply an m by n matrix by an n by p matrix to produce an m by p matrix, when the red box numbers are equal.
Multiply odd-shaped matrices in quantum physics by aligning inner dimensions, as shown with a 3 by 2 and a 2 by 1 example, producing a 3 by 1 result.
Follow along with animated odd-shaped multiplications and pause to verify you can perform each one on your own.
Compute the outer product by multiplying a column matrix with a row matrix to form a table of all pairwise products, illustrated by animation.
Work through this exercise to practice math prerequisites for QC101, and pause the video to verify your answer before continuing.
Understand how a row matrix times a column matrix yields a 1x1 inner product, contrasting with the outer product, and the general ad + be + cf form.
Practice square matrix times column matrix multiplication in quantum computing, and verify your answers through two in-video exercises. Pause the video to work through the exercise.
Explore the multiplicative inverse in real numbers and matrices, using the notation x^-1 and A^-1, to show that A times A^-1 equals I and A^-1 times A equals I.
Apply the transpose operation by interchanging rows and columns, represented by a superscript t. Verify that diagonal mirroring corresponds to swapping the rows and columns, as shown in the animation.
Explore the transpose operation, common in quantum physics, through examples and hands-on exercises using mirroring and interchanging rows and columns.
Demonstrate that the transpose of a product equals the product of transposes in reverse order for matrices A and B. Verify that (AB)^T = B^T A^T using concrete examples.
Apply complex conjugation to matrices by taking the conjugate of each element, reversing the imaginary parts. Observe that real numbers stay unchanged, while a+bi becomes a-bi.
Combine the complex conjugation and transpose operations to form the adjoint, denoted by a dagger; explore its use in quantum physics with worked examples.
Explore reversible quantum state transformations modeled by unitary matrices where the adjoint equals the inverse, yielding the identity matrix.
Explore hermitian matrices that represent irreversible quantum state transformations. Recognize that they satisfy A adjoint = A, i.e., the matrix is its own adjoint.
Explore matrices that are both Hermitian and unitary by proving that a matrix equals its inverse and its adjoint, and that multiplying by itself yields the identity.
Understand how Hermitian matrices model irreversible steps, such as initializing quantum bits and measuring results. Recognize how unitary matrices govern the reversible sequence of quantum operations in computation.
Define vectors as column matrices and show how a square matrix maps a column vector via x2 = Ax1 + By1, y2 = Cx1 + Dy1, and eigenvectors.
Explore 2d rotation using matrix transformations by rotating a point (1,0) through 30°, then 60°, and 90°, illustrating how matrix multiplication encodes linear transformations.
Explore how a square matrix acts as a linear transformation on coordinate space, swapping coordinates to reflect about y=x and map points along y=-x, revealing eigenvectors.
Learn how a transformation matrix acts on eigen vectors to produce scaled copies by eigen values, using the lines y=x and y=-x and unit vectors as examples.
Understand eigen vectors and eigen values for a 3x3 matrix, including multiplication, normalization, and factoring out eigen values; recognize nonreal results and the role of complex numbers in quantum computing.
Develop the mathematical foundations for quantum physics and quantum computing by exploring complex-number matrices, quantum states and transformations, and the probabilistic behavior of quantum bits through boolean random variable analysis.
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.