Teacher and parent overview
A practical guide for supporting Years 11–12 without presenting analogies or simulations as the underlying physics.
A mathematically supported but approachable introduction to state vectors, measurement, gates, circuits, entanglement and algorithms.
Expected time: 45–60 minutes each week for 12 weeks.
Completion: Complete the 12 lessons and assessments, then predict, simulate, analyse and cite one protocol or algorithm for the capstone.
state vectornormalisationBorn rulerelative phaseunitarytensor productBell stateoracleamplitude amplification
Calculate one- and two-qubit state updates on paper, then compare the prediction with the browser state-vector simulator.
General safety: Use ordinary classroom materials only. Do not use lasers, mains electricity, chemicals, cryogenic materials or improvised laboratory equipment.
Week-by-week support
How is a quantum state different from a classical bit value and from the result of a measurement?
Look for explicit separation of carrier, state and outcome. Strong answers say that amplitudes are not probabilities and identify relative phase as operationally meaningful.
Watch for: A qubit is an ordinary bit that stores 0 and 1 at once.
Use instead: A qubit is a quantum system described by amplitudes relative to a chosen basis; one computational-basis measurement records one classical outcome, either 0 or 1.
Write a classical probability vector as p = [p₀, p₁]ᵀ and a pure qubit state as |ψ⟩ = [α, β]ᵀ. Compare the restrictions p₀ + p₁ = 1 and |α|² + |β|² = 1, and explain why amplitudes permit phase-dependent interference while probabilities do not.
Construct two normalised state vectors with identical computational-basis probabilities but different relative phases. Predict a gate sequence that distinguishes them, then check it in the simulator.
Use three sets of cards labelled system, state and result. Students sort examples, then justify any card whose category depends on context.
Safety: This lesson uses only a browser simulation and paper sorting. No laboratory apparatus, personal data or public student posting is required.
How does a normalised state vector describe a single pure qubit state?
Students should square magnitudes, not raw complex values, and should state that the zero vector cannot be normalised.
Watch for: The amplitudes α and β are the probabilities of 0 and 1.
Use instead: Amplitudes are real or complex components of the state vector; the computational-basis probabilities are their squared magnitudes, |α|² and |β|².
For a complex number z = a + bi, define |z|² = a² + b². A general qubit obeys |α|² + |β|² = 1. Multiplying the whole state by e^(iγ) adds global phase, whereas a factor e^(iφ) on only one component changes relative phase.
Check that [1/√2, i/√2]ᵀ is normalised. Compare it with [1/√2, 1/√2]ᵀ in the computational basis, then predict why a later basis change can distinguish them.
Plot real amplitude pairs on coordinate paper. Mark the unit circle and connect each valid pair to its two computational-basis probabilities.
Safety: The activity is mathematical and simulation-based. Remind students that the coordinate picture represents states, not a qubit's physical path.
How does the Born rule connect a prepared state with individual measurement results and repeated-shot statistics?
Accept approximate shot counts, not only exact expected counts. Require students to identify the basis and to square magnitudes.
Watch for: A 75% probability means exactly 75 of every 100 shots must give that result.
Use instead: The Born rule predicts probabilities, not fixed finite counts; sample proportions fluctuate and tend to approach the probabilities as many independent preparations are measured.
A bra such as ⟨ψ| is the conjugate transpose of the ket |ψ⟩, and putting a bra beside a ket forms an inner product. A projector maps a state onto a chosen subspace. For normalised |ψ⟩ and P₀ = |0⟩⟨0|, the probability of outcome 0 is ⟨ψ|P₀|ψ⟩. If outcome 0 occurs, the normalised post-measurement state is P₀|ψ⟩ divided by the square root of that probability.
Use P₀ = [[1, 0], [0, 0]] and P₁ = [[0, 0], [0, 1]] to calculate both probabilities and conditional post-measurement states for [1/2, √3/2]ᵀ.
Use a biased spinner to model finite sampling, then explicitly list the ways the spinner analogy differs from a quantum measurement.
Safety: No physical quantum apparatus is used. Avoid language suggesting that human awareness causes the measurement outcome.
How can relative phase change later measurement statistics even when the current computational-basis probabilities are unchanged?
Students should connect relative sign or phase with addition and subtraction of amplitudes. Do not accept claims that the sphere is the qubit's physical shape.
Watch for: States with the same 0/1 probabilities are the same quantum state.
Use instead: Computational-basis probabilities alone do not specify a general qubit state; relative phase can differ and can be converted into observable probability differences by a basis-changing circuit.
Up to global phase, a pure qubit can be written |ψ⟩ = cos(θ/2)|0⟩ + e^(iφ)sin(θ/2)|1⟩. The angles θ and φ locate a point on the Bloch sphere. Measuring along different axes corresponds to choosing different orthonormal bases.
For θ = π/2, compare φ = 0, π and π/2. Write each state, predict its Z-basis probabilities and identify its labelled equatorial point.
Use arrow cards for amplitudes. Add or subtract the cards component by component for H–H and H–Z–H, then square the final magnitudes.
Safety: Provide the 2D alternative for students who cannot or prefer not to use a rotatable 3D control. No rapid rotation is automatic.
How do unitary matrices represent reversible changes to a one-qubit state?
Check matrix order, the factor 1/√2 in H and phase signs. Core students may describe Y, S and T qualitatively; extension students should use complex entries accurately.
Watch for: A quantum gate reads the qubit and then chooses a new state.
Use instead: An ideal gate applies a linear unitary transformation without first producing a classical measurement result; measurement is a separate operation.
Write Y = [[0, −i], [i, 0]], S = [[1, 0], [0, i]] and T = [[1, 0], [0, e^(iπ/4)]]. Verify U†U = I for one of these matrices and identify its inverse.
Calculate S|+⟩ and then S²|+⟩. Compare S² with Z and explain why T² = S using their diagonal phase factors.
Prepare gate and state-vector cards. Students perform matrix-vector products on mini-whiteboards, then pair each gate with an inverse.
Safety: No hardware is required. Treat matrix animations as representations of state change, not as pictures of a physical gate moving through a qubit.
How do gate order and basis-changing operations determine what a quantum circuit measures?
Check whether students apply the rightmost matrix first and distinguish state vectors from measurement probabilities. Point out that global phase-equivalent vectors represent the same physical pure state.
Watch for: Gate order does not matter because every gate is reversible.
Use instead: Reversibility does not imply commutativity; different ordered products of unitary gates can produce different final states.
Calculate HZH and verify that it equals X. Then calculate HXZ and ZXH or apply them to |0⟩ to demonstrate explicitly that changing order generally changes the transformation.
Design the shortest circuit using H and Z that maps each of |0⟩, |1⟩, |+⟩ and |−⟩ to a computational-basis state, noting when a single circuit cannot map all four distinct states to distinct bits.
Give groups gate-matrix cards and state cards. Students physically order the circuit left to right, then stack matrices in algebraic order.
Safety: No practical hazards are present. Ensure that step animations can be paused and that all intermediate states are also available as text.
How does the tensor product describe a joint multi-qubit state, and why does its dimension grow with each added qubit?
Require students to state which qubit is leftmost and which is the control. Treat a different consistent endianness convention as valid only if every label and transformation follows it.
Watch for: A two-qubit state is always just two independent one-qubit states written side by side.
Use instead: A two-qubit state belongs to a four-dimensional joint state space; only separable states factor into two individual one-qubit states.
For n qubits the state space has dimension 2ⁿ. Expand |+⟩⊗|0⟩ and apply a CNOT whose control is the plus-state qubit. Test whether the resulting vector can be written as [a,b]ᵀ⊗[c,d]ᵀ.
Set up the factor equations ac, ad, bc and bd for the four amplitudes. Show why the resulting Bell-state vector cannot satisfy them all for normalised one-qubit factors.
Use a four-cell grid and amplitude cards to construct tensor products and perform the CNOT permutation without a device.
Safety: No physical equipment is needed. Avoid claiming that state-vector dimension alone gives a practical speed-up or a current hardware capability.
What makes a Bell state entangled, and what can Bell-test correlations establish without enabling faster-than-light communication?
Reject claims that Bell tests rule out every conceivable hidden-variable theory. Look for the qualified phrase 'local hidden-variable models' and a clear no-signalling explanation.
Watch for: Entanglement lets one observer send an instant message by choosing the other observer's result.
Use instead: Entanglement produces correlations, but each local outcome is random and cannot be controlled to encode a message; comparing correlations requires ordinary classical communication.
Starting from |00⟩, calculate (I⊗H)|00⟩ or the equivalent expression for the course's wire order, then apply the CNOT permutation. Derive the vector [1/√2,0,0,1/√2]ᵀ and all four computational-basis probabilities.
Attempt to factor the Bell vector as [a,b]ᵀ⊗[c,d]ᵀ. Use the zero middle amplitudes and non-zero outer amplitudes to show that no such normalised factors exist.
Give students paired synthetic datasets for several settings. They calculate local frequencies and correlations, then identify which claims require more than a single setting.
Safety: The activity uses generated ideal data. Label it clearly so it is not mistaken for results from a real Bell-test experiment.
How can shared entanglement and two classical bits transfer an unknown qubit state without transferring matter or creating a copy?
Correction tables vary with wire and bit-string conventions. Accept a different table only when the student states a consistent convention and derives all branches correctly.
Watch for: Quantum teleportation instantly moves matter and leaves the original state behind.
Use instead: Teleportation transfers a quantum state using shared entanglement and classical communication; it moves no matter, cannot outrun the classical message and does not leave an independent perfect copy.
Expand the three-qubit state immediately before Alice's measurements and group terms by her two-bit outcomes. Show that Bob's conditional states are |ψ⟩, X|ψ⟩, Z|ψ⟩ and XZ|ψ⟩ up to the chosen bit order and global phase.
Choose |ψ⟩ = (3|0⟩ + 4|1⟩)/5. For each measurement branch, apply the stated correction matrix and verify that Bob's final probabilities are 9/25 and 16/25.
Use three wire strips, gate cards and four classical outcome cards. Students physically trace each branch and place the matching correction.
Safety: Avoid science-fiction imagery of people disappearing or claims of instant transmission. The simulator contains no real hardware connection.
How do an oracle, phase kickback and interference reveal a global property or hidden bit string in these demonstration algorithms?
Require the correct parity definition of s·x, a reversible oracle and qualified claims. Do not accept 'reads all answers' as an explanation.
Watch for: These algorithms work because a quantum computer tries every answer and reads all answers at once.
Use instead: The circuit creates amplitudes over basis states, encodes a structured phase pattern and uses interference so a specific global property is likely or certain in the final measurement; it never reads every branch.
Use the identity H^{⊗n}|x⟩ = 2^(−n/2)Σ_z(−1)^(x·z)|z⟩, where the sum is over every n-bit string z in {0,1}ⁿ. For Bernstein–Vazirani, combine this with phase (−1)^(s·x) and show that the amplitude sum cancels for z ≠ s and reinforces for z = s.
Carry out the sign-sum calculation for n = 2 and s = 10. List the four contributions to each possible output amplitude.
Create plus/minus phase tables on paper for two-bit hidden strings. Students combine columns to see which output pattern reinforces.
Safety: The activity is mathematical and simulated. Avoid linking the demonstration to unsupported claims about current commercial performance.
How does Grover amplitude amplification improve an unstructured search, and why do noise and implementation costs matter?
Require students to distinguish amplitude sign from probability and to qualify the √N statement as an oracle-query result. Do not accept unsupported claims about present processors or quantum advantage.
Watch for: Grover search tests every answer at once and then reads all of them.
Use instead: Grover search uses a phase oracle and interference to increase the marked state's measurement probability; the final measurement returns one candidate, and the advantage is an approximate square-root reduction in oracle queries for the specified unstructured-search problem.
Let sin θ = 1/√N for one marked state. After r Grover iterations, the ideal success probability is sin²((2r+1)θ). Use this finite formula without calculus to compare N = 4 and N = 8 and to see why too many iterations reduce success.
Calculate the N = 8 success probability after zero, one and two iterations. Compare the query count with a simple classical worst-case search while listing costs the oracle model does not include.
Use four signed amplitude cards. Students calculate the mean and reflect each value, then repeat a second iteration to see overshoot.
Safety: All device behaviour shown is simulated. Do not identify a company, processor size or current performance record without separate dated verification.
How can a circuit, prediction, simulation and cited evidence support a clear and appropriately limited quantum-computing claim?
Assess accuracy before presentation polish. Require a prediction made before simulation, a reproducible seed, resolved citations and a limitation tied directly to the selected project.
Watch for: A circuit that works in an ideal browser simulator proves it will work efficiently on current hardware.
Use instead: An ideal simulation verifies specified circuit mathematics for a small model; hardware feasibility also depends on noise, connectivity, compilation, scale and resource overhead and requires separate evidence.
Add an Advanced Investigation that derives one checkpoint using matrices or tensor products, or compares ideal results with a clearly defined simplified noise channel. Separate sampling uncertainty from model bias and hardware claims.
Prepare a one-page technical appendix containing the derivation, normalisation check, seeded configuration and a sensitivity comparison for at least two shot counts or noise settings.
Students exchange printed circuit and prediction sheets for peer review, checking gate order, qubit order, probability totals, source support and overstatement before the final submission.
Safety: Use only the local educational simulator. Do not publish student names or scores, connect to external hardware accounts, or present generated simulation data as a real laboratory dataset.
Source registry
These links were checked on 2 August 2026. Each student lesson shows the subset used for its claims.
