Quantum Computing from Beginner to Expert

Explore how complex numbers extend real numbers through the complex plane, visualize with polar coordinates and Euler's formula, and interpret multiplication as rotation and scaling.

Relate complex numbers to two-dimensional vectors by mapping real and imaginary parts to vector components and show that complex multiplication equals matrix multiplication, yielding equivalent vector and matrix representations.

Convert complex state vectors in Hilbert space into real vector representations using two-dimensional real blocks to illustrate quantum state evolution, gates, Pauli matrices, and Bloch matrices.

Explore the relationships among common matrix types used in quantum computing, including real symmetric, orthogonal, Hermitian, unitary, invertible, and Pauli matrices, and their real vector space and Hilbert space correspondence.

Explore the properties of real symmetric matrices, including real eigenvalues, real eigenvectors, and orthogonality of eigenvectors for different eigenvalues, and note Hermitian matrices share features though eigenvectors may be complex.

Explore orthogonal matrices where A^T A = I and A^T = A^{-1}, with orthonormal rows and columns, rotation-only transformations, and determinants of absolute value one.

Dirac notation uses bra and ket to represent vectors and their interactions. It defines inner and outer products, the dagger as conjugate transpose, and roles of complex matrix elements.

Explore the single qubit in superposition, represented as a linear combination of ket zero and ket one with complex amplitudes alpha and beta whose absolute values squared sum to one.

Explain how multi-qubit systems use entanglement and superposition to enable complex quantum computations. Show that two qubits form four bases and a linear combination with 2^n amplitudes.

Explore the Bloch sphere, developed by Felix Bloch, as a unit-sphere visualization of a qubit's quantum state, its zero/one basis, and the superposition, measurement, and probabilistic outcomes in quantum computing.

Explore the global phase as a unit-magnitude factor in a wavefunction, e^{i phi}, with no observable effect. In quantum computing, manipulate phase to influence results, while amplitudes follow trigonometric forms.

Convert a single qubit's complex amplitudes into a real vector using Euler's formula, map theta and phi to x, y, z, and note this is not the Bloch sphere.

Explore how single quantum states map to the Bloch sphere as theta sweeps 0 to pi/2, yielding upper-hemisphere points and revealing the global minus sign equates lower-hemisphere states.

Explore the Bloch sphere for a single quantum state, applying the theta/2 adjustment and deriving x=sin(theta/2) cos phi, y=sin(theta/2) sin phi, z=cos(theta/2) with phi in 0 to 2 pi.

Apply unitary transformations to quantum states by left-multiplying the ket with the matrix U. The conjugate transpose U† equals the inverse, preserving inner products and normalization, ensuring reversibility.

Explore the Hermitian conjugate, or adjoint, of a linear operator by taking the complex conjugate transpose, and apply the common formulas used in quantum mechanics.

Explore how a single qubit gate is a 2×2 unitary matrix acting on ket states, and how it decomposes into x- and y-axis rotations via outer products.

Explore how the Hadamard gate creates superposition, its matrix form, and its geometric interpretation as a reflection on the Bloch sphere, illustrated by unit circle states.

Master the Pauli matrices—sigma one, sigma two, sigma three—as two-by-two hermitian operators with zero trace and eigenvalues ±1, describing spin along x, y, z and their multiplication rules.

Understand the Pauli-X gate, the quantum not gate, which flips qubit states and coefficients, with its unitary matrix and geometric interpretation on the Bloch sphere, including repeated applications.

Explore the Pauli-Y gate, represented by the sigma Y matrix. It maps |0> to i|1> and |1> to -i|0>, a pi rotation about the y axis on the Bloch sphere.

Analyze the Pauli-Z gate, its sigma-z matrix and circuit symbol z, and its effect on ground and arbitrary states, plus its spectral decomposition and single-qubit z-axis rotation by pi.

Explore the matrix exponential defined by the Taylor series, its diagonalizable form via unitary transformation with eigenvalues, and its preservation of matrix multiplication and addition for solving linear differential equations.

Explore unitary transformations generated by Pauli matrices to manipulate qubits while preserving their probability amplitudes, and see how the identity generator yields global phase and builds universal gates.

Explore density operators in quantum computing, describing mixed states, coherence, and measurement probabilities, with positive semidefinite matrices of trace one and unitary evolution.

Show how unitary evolution of density matrix yields a z-rotation by theta, expanded via Pauli matrices to cosine theta times x plus sine theta times y on the Bloch sphere.

Apply the ry gate to rotate a qubit around the y axis by theta, creating superposition and phase changes in |0⟩ and |1⟩.

Explore the Rz(θ) gate: rotate a qubit around the z axis by θ over two using the Pauli z generator, with a global phase often ignored in practice.

The tensor product merges multiple qubits into a larger quantum system, enabling superposition and multi-qubit computation. It preserves properties like associativity, distributivity, and scalar factoring, and underpins quantum circuits.

Learn how to construct the two-qubit unitary matrix by listing basis transformations, applying the general unitary formula, and combining dual and transformed states to form the gate.

Explore how the cnot gate flips the target qubit when the control qubit is one, using the two-qubit unitary matrix and circuit diagrams. Compare high-bit and low-bit control cases.

Exchange the states of two qubits in superposition with the swap gate, a key two-qubit unitary, and reveal its matrix form and equivalence to three consecutive CNOT gates.

derive the unitary transformation matrix for a three-qubit system by listing all state possibilities and applying elementary gates such as Pauli, Hadamard, and CNOT to transform the state.

Toffoli gate uses two control qubits and one target qubit; it flips the target when both controls are one and is implementable with three CNOT gates and five single-qubit gates.

Explore the Fredkin gate, a three-qubit controlled swap that swaps the second and third qubits when the control is 1 and leaves them unchanged when the control is 0.

Explore linear evolution under Schrödinger equation and collapse upon measurement to eigenstates with projective measurements, yielding classical bits with probabilities equal to the squares of alpha and beta.

Master the Hermitian adjoint operator, also known as the Hermitian conjugate or adjoint, denoted by a dagger, and learn its common formulas for complex linear operators on a Hilbert space.

Derive the completeness equation from an orthonormal basis by summing outer products to obtain the identity, showing any vector spans the space.

Explore projection operators as linear maps that project vectors onto subspaces using outer products and unit vectors. Summarize their properties, orthogonality, completeness, and spectral decomposition with eigenvectors.

Explore projection measurements that project a quantum state onto eigenstates of an observable, yielding outcomes with eigenvalues and probabilities via the state's collapse.

Explore how a quantum circuit uses measurement operators m0 and m1 to project a single qubit onto |0> or |1>, with probabilities derived from its state.

The lecture demonstrates measuring a two-qubit circuit from initial state |00> through a controlled-not gate and joint measurements using M00, M01, M10, M11, yielding |01> or |11> with equal probability.

Explore quantum circuits—the universal quantum computing model—where qubits evolve in time under the Hamiltonian and are manipulated by unitary gates, with Quantum Weaver tested online on GitHub.

Explore Pauli X, Y, Z gates and Hadamard gate, showing X and Y flip |0> to |1>, Z preserves it, and H creates a superposition on the Bloch sphere.

Learn rx(θ), ry(θ), and rz(θ) gates that rotate qubits around x, y, and z axes by θ, with pi over two rotations producing superposition on Bloch sphere for quantum algorithms.

Explore CNOT, swap, and Toffoli gates as foundational two-qubit operations, illustrating control and target qubits, Bloch sphere visualizations, and matrix representations for consistent results.

Explore how initial state preparation builds target superpositions from the ground state using gates, distinguish pure and mixed states, and harness entanglement for quantum computing.

Use the hadamard test to estimate the real part of a quantum state's amplitude relative to a reference, via a controlled unitary and a final hadamard measurement.

Use Hadamard test to reveal imaginary part with a controlled U gate, Hadamard gate, and S gates; measure the control qubit to infer the real part of the amplitude.

Compare quantum states with the swap test, using an ancilla, hadamard and controlled-swap gates, and a final measurement to estimate fidelity, enabling quantum machine learning and data analysis.