Your first quantum computation starts here.
No installation knowledge or physics background required. Learn an idea, use it in a real simulation, then solve a problem with code.
One qubit. Two possible outcomes. A different way to compute.
The fundamentals path
- Why quantum computing? →
Understand what quantum computing changes, without promises of universal speedups.
- Classical bit vs qubit →
Distinguish a stored bit from a quantum state and a measurement outcome.
- Meet |0⟩ and |1⟩ →
Read ket notation and prepare a basis state.
- Probability before quantum →
Read a probability distribution and distinguish a prediction from a sample.
- Read a statevector →
Connect amplitudes, probabilities, and normalization.
- Superposition and phase →
Recognize why equal probabilities do not imply identical states.
- See the qubit: Bloch sphere →
Connect a pure qubit's direction to measurement probabilities and relative phase.
- The X gate →
Use a matrix to explain a bit flip.
- The Hadamard gate →
Create and recombine a superposition.
- The Z gate: change phase →
Use Z to change relative phase and reveal it with interference.
- Measurement and shots →
Separate theoretical probabilities from observed frequencies.
- Two qubits, four amplitudes →
Read a joint statevector before introducing controlled gates.
- Two qubits and CNOT →
Use control and target correctly and read Qiskit bit ordering.
- Gate order and circuit depth →
Distinguish operation count, dependency depth, and hardware compilation.
- Entanglement →
Distinguish a coherent Bell state from classical correlation.
- Explore Bell-state phase →
Change a Bell state's relative phase without changing its computational-basis probabilities.
- The four Bell states →
Separate matching versus opposite outcomes from the relative sign of a Bell state.
Completion requires using the simulator successfully and answering a concept check. It is not a certification of mastery.