Years 7–10 · Week 12 of 12
Secondary Capstone and Claim Checker
Learning goals
By the end, you can…
- Construct a valid two-qubit circuit for a stated purpose.
- Predict ideal outcomes using gate and state reasoning.
- Compare predicted probabilities with seeded shot counts.
- Fact-check a quantum-computing headline using reliable sources and appropriate limits.
- Reflect on evidence, uncertainty and model limitations.
What you already know
Connect to a familiar idea
Across the pathway you have moved from evidence and models to states, circuits, entanglement and algorithms. The capstone brings these ideas together in one reproducible circuit investigation and one evidence-based claim check.
- H, X, Z and CNOT transform amplitudes and basis states.
- Shot counts fluctuate around predicted probabilities.
- Entanglement, teleportation, algorithms and noise have specific limits.
Opening story
Start with something familiar
A fictional headline announces, 'New quantum chip tries every solution simultaneously and sends results instantly using entanglement.' Your team must build a circuit, report what its simulator actually shows and replace the headline with a claim that the evidence could support.
Plain-English explanation
Build the idea carefully
Design, predict, run and compare
A strong investigation begins with a specific circuit purpose, an explicit qubit-order convention and a prediction made before running shots. A valid two-qubit circuit uses supported gates with distinct CNOT control and target wires and preserves total probability in the ideal state-vector model.
Check the claim and communicate limits
Shot counts are samples, so they should be compared with ideal probabilities using percentages and reasonable sampling variation, not expected to match exactly. A scientific fact-check separates what a demonstration establishes from broader claims about speed, hardware, entanglement and communication. Clear reporting identifies the model, records methods and results, cites sources and states at least one limitation.
Try the model
Two-qubit capstone workspace
Build a supported circuit, record your prediction, run seeded shots, compare results and complete the headline claim checker.
Qubit 0 is the least-significant state-vector bit. Displayed basis labels read q(n−1)…q0.
Ready. Adjust a control, then run the model.
What this model shows: The workspace uses an ideal classical state-vector simulator and seeded sampling; it does not run a quantum processor.
Text alternative for this interactive
Structured capstone form Choose gates using labelled buttons, read the circuit as text and complete prediction, results, source and reflection fields without dragging.
Expected observation: A valid H–CNOT Bell circuit predicts only 00 and 11 ideally, while finite seeded shots divide between those outcomes without needing exact 50:50 counts.
Guided activity
Complete the Quantum Foundations investigation
- State a testable purpose and write your qubit-order convention.
- Build a two-qubit circuit and predict its ideal output probabilities.
- Run at least five hundred seeded shots and record counts and percentages.
- Compare prediction and results, explaining sampling variation.
- Fact-check the fictional headline with two reliable sources.
- Write a limitation and a short learning reflection.
Evidence to collect: A reproducible circuit report containing purpose, circuit, prediction, shot results, comparison, cited claim check, limitation and reflection.
Glossary
Words to know
- capstone
- A culminating task that combines knowledge and skills from a course.
- prediction
- A result stated from a model before examining new data.
- state-vector simulator
- A classical calculation of ideal quantum-state evolution.
- shot count
- The number of repeated simulated or hardware circuit trials.
- sampling variation
- Natural differences between finite-sample frequencies and underlying probabilities.
- fact-check
- A source-based evaluation of a specific factual claim.
- limitation
- A condition that restricts what a method or result can establish.
Short recap
Keep these ideas
- A defensible circuit investigation separates purpose, prediction, method, results and conclusion.
- Finite shot counts should be compared with probabilities rather than expected to match exactly.
- Accurate quantum communication names the model, cites evidence and limits claims to what the evidence supports.
Knowledge check
6 clear questions
Choose an answer for immediate feedback. You may retry, and your best submitted score is kept.
Go Further Optional extension for Years 9–10
For Years 9–10, compare two circuits that have the same immediate computational-basis probabilities at an intermediate step but different relative phase. Add a final H gate to make the difference observable.
Try this
Submit both circuit traces, predicted state vectors using real signed amplitudes, shot results and a paragraph explaining the role of phase.
Adult support Teacher and parent notes
Discuss
- Assess reasoning and transparent limitations, not whether random counts land closest to 50:50.
- Require source titles or IDs and reject unsupported marketing claims.
Answer guidance
A complete submission is reproducible, uses valid gates, predicts before running, distinguishes ideal probability from sampled frequency and corrects both 'all answers' and faster-than-light claims.
Offline activity
Students can submit a paper circuit and use teacher-provided seeded shot tables if devices are unavailable.
Safety
Protect student privacy: certificates and reports are private, contain no public names or scores and require no account details beyond the existing student profile.
Sources and further reading
Checked references for this lesson
These sources support the lesson’s main scientific claims. Links open on the source organisation’s site.
- Circuits IBM Quantum Learning · official learning module · checked 2026-08-02
- Entanglement and correlations Microsoft Learn · official documentation · checked 2026-08-02
- Quantum information science National Institute of Standards and Technology · government explainer · checked 2026-08-02
- Quantum Computation and Quantum Information Cambridge University Press · textbook publisher page · checked 2026-08-02
Content review: Reviewed on 2026-08-02.