💻Quantum Computing Basics
Qubits, superposition, gates, the Bloch sphere and famous algorithms.
Qubits
A classical bit is 0 or 1. A qubit is . Any pure state can be drawn as a point on the Bloch sphere: qubits live in a -dimensional space — 300 qubits exceed the number of atoms in the universe.
Gates
- X (NOT): flips
- H (Hadamard): — creates superposition
- CNOT: flips the target if control is 1 — creates entanglement
- then CNOT on → Bell state
Famous algorithms
- Shor — factors integers exponentially faster (threatens RSA).
- Grover — searches unsorted data in .
- Quantum simulation — chemistry and materials, the most promising near-term use.
The challenge
Decoherence: interaction with the environment destroys superpositions. Error correction combines many physical qubits into one logical qubit.
Key formulas
Qubit
Hadamard
Bell state
Interactive simulation
Loading simulation…
Videos
Further resources
Check your understanding
1. Which gate creates superposition from |0⟩?
Score: 0 / 1