1Spooky Action
Entanglement is the key differentiator of quantum computing. It allows us to represent correlations that have no classical analog. When two qubits are entangled, their fates are tied regardless of physical distance.
2The Gate Toolbox
We don't use AND/OR. We use continuous rotations and controlled operations. A surprisingly small set of gates (like H, CNOT, and T) is enough to build any possible quantum computation, a concept known as Universality.
3Step-by-Step Breakdown
Entanglement. Entanglement links qubits together perfectly, so the state of one determines the state of the other.
Hadamard Gate. The H-gate creates a balanced superposition. It's the most common first step in a quantum algorithm.
CNOT Gate. The Controlled-NOT gate flips a target qubit only if a control qubit is 1. It's the primary way to entangle qubits.
Creating Bell States. Applying a Hadamard followed by a CNOT creates a maximally entangled state known as a Bell State.
Pauli Gates. X, Y, and Z gates perform specific rotations (pi radians) around the axes of the Bloch sphere.
Logic Check. Which gate combination is required to entangle two qubits starting from |00>?
- →Pauli-X then Z
- →Hadamard then CNOT
- →Toffoli Gate
Toffoli Gate. The CCX (Toffoli) gate is a 3-qubit gate. It makes quantum computers capable of universal classical logic.
Rotation Gates. Rx, Ry, and Rz gates allow for arbitrary angle rotations, essential for variational algorithms.
Unitary Matrices. Every valid quantum gate is a unitary matrix (U*U = I). This means all quantum logic is reversible.
Outro. You can now compose the logic that powers quantum superiority.
Verify Real Bell State Correlation. Finish checking that measurements on an entangled Bell state pair always come out perfectly correlated.
