
Explore how certain vectors stay oriented under a transformation, becoming eigenvectors with corresponding eigenvalues as the vector is stretched; illustrated by a matrix acting on [0,3] producing [0,6].
Convert arbitrary qubit state alpha beta into Dirac notation by turning the matrix into a sum and factoring alpha and beta, yielding a linear combination of |0> and |1> kets.
Examine the Hadamard gate on the Bloch sphere, its effect on zero, one, plus, minus, i, and -i states, and how phase differences make the gate powerful for quantum algorithms.
Explore how the S gate adds a relative phase of pi on two radians and the T gate adds pi on four radians, and how their daggers invert these gates.
Illustrate a quantum circuit to apply gates to specific qubits, such as an X on the second qubit and a later Hadamard, followed by measurements.
Explore superdense coding, a quantum protocol that sends two classical bits with one qubit via entanglement between Alice and Bob. See how gates encode and Bob decodes information through measurement.
Explore how the Deutsch-Jozsa algorithm generalizes to n-bit inputs, distinguishing constant from balanced functions with a single quantum query using Hadamard gates and the oracle.
Explore the quantum phase estimation algorithm to determine eigenvalues of a unitary matrix, using the two-register circuit, phase kickback, and the inverse quantum Fourier transform, with applications to Shor's algorithm.
When people first start researching quantum computers, they are usually bombarded with pop-science analogies that just end up confusing them further. Like "quantum computers use qubits that can be both 0 and 1 at the same time". Most people upon hearing this think that quantum computers are too complex and give up on their search in understanding them.
Quantum computing is actually very straight forward if you dive into the mathematics behind it. The analogies will only get you so far, if you want to truly understand how a quantum computer actually works you must understand the maths. And don't worry this isn't boring, repetitive maths like you did in high school, the maths you need in order to understand most of the popular quantum algorithms (like Shor's Algorithm) is pretty simple.
This course aims to give you a solid foundation in Quantum Computing, taking you from nothing to understanding how the popular quantum algorithms work. This will highlight why quantum computers are so powerful. All the maths you need for the course is in the first section, then after that we dive straight into understanding Quantum Computers.
Thank you for choosing us to be your first introduction to the world of Quantum Computing,
Quantum Soar