Singapore-based practical guides, tutorials and experiments in AI, computing, modelling, simulation, optimisation and quantum computing, with research notes and hands-on workflows.
QUANTUM SERIES 2026 The complete learning path, from a single qubit to Grover’s algorithm.
This is the index to the Techucation Quantum Series: a sequence of hands-on posts that build quantum computing from the ground up. Each one stands on its own, but together they form a single arc, from what a qubit actually is, through the rules that make quantum mechanics strange, to the algorithms that turn those rules into a real speedup. The order below is a learning path from first principles to algorithms, not the order the posts were written.
New to the topic? Read top to bottom. Already comfortable with qubits and gates? Skip ahead to the algorithms in Section 4. Explore all related research in the Quantum Computing Hub.
Foundational Pre-reading: The Math Behind the Phase
The geometric bridge from qubit statevectors to gates: where |0⟨, |1⟨, |+⟨ and |−⟨ sit, how X and Z rotate them, and how to verify the result in Qiskit.
Moving beyond single qubits: tensor products, product states vs entangled states, Schmidt decomposition, CNOT as the universal entanglement generator, the four Bell states, Bell basis decoding, and why the single-qubit Bloch vector collapses.
Holevo’s bound, pre-shared entanglement as a communication resource, Alice’s local Pauli encoding (I, Z, X, ZX), Bob’s deterministic Bell basis decoding, and full Qiskit 2.x verification.
Scaling to n-qubit Boolean functions: provable exponential query separation, phase kickback, the four canonical oracles, and Qiskit 2.x implementation.
Putting entanglement into action: an interactive simulator where quantum correlation violates Bell’s inequality, beats the classical 75 percent ceiling, and reaches the Tsirelson bound (85.4%).
Leave a comment