How can we introduce quantum computing to high school students without first teaching complex vectors, matrices, or advanced linear algebra? One effective approach is to begin with something familiar: probability. From there, students can see quantum computing not as magic, but as a new rule for how possibilities combine, cancel, and reinforce.
PowerPoint with speaker script
Why Start with Probability?
Quantum computing is often introduced in one of two unhelpful ways. It is either described as a mysterious science-fiction technology, or it is presented through advanced mathematics that beginners are not ready to use. For high school students, both approaches can create confusion.
A more natural starting point is ordinary probability. Students already understand that a coin has two possible outcomes, that a weather forecast gives a chance of rain, and that probabilities add up to $1$. This gives us a familiar foundation.
From there, we can introduce the key shift:
Quantum mechanics does not work directly with ordinary probabilities. It works first with probability amplitudes.
This one idea opens the door to superposition, interference, entanglement, and quantum computing.
Moving Past the Hype
Students often hear claims such as:
- quantum computers will make everything faster;
- quantum computers will break Bitcoin;
- quantum computers will help predict the stock market;
- quantum computers try all possible answers in parallel.
These claims are not simply true or false. Each one hides an important qualification. To understand what quantum computers can and cannot do, students first need to understand what is actually different about quantum information.
That is the goal of this presentation: not to sell quantum computing as magic, but to explain the basic mechanism honestly and intuitively.
Classical Probability: The Familiar Rule
In ordinary probability, probabilities are nonnegative numbers. If there is a $30%$ chance of rain, then we might say there is a $70%$ chance of no rain. Together, the probabilities add up to $100%$.
Also, if an event can happen in two mutually exclusive ways, we usually add the probabilities. Adding another possible path normally makes an outcome more likely, not less likely.
This is the everyday rule:
more possible ways usually means more probability.
Quantum mechanics changes this rule.
Quantum Amplitudes: A Different Rule
In quantum mechanics, nature does not add probabilities first. It adds amplitudes.
An amplitude is not itself a probability. It can be positive, negative, or even complex. After amplitudes are added, the final probability comes from the squared size of the resulting amplitude.
This means something surprising can happen:
Amplitudes can cancel.
Two paths, each possible by itself, can combine so that the final outcome disappears. This is impossible in ordinary probability, because ordinary probabilities cannot be negative. But amplitudes are different. They behave more like arrows or waves than ordinary chances.
The Two-Slit Experiment: Interference in Nature
The two-slit experiment gives students a concrete physical example.
When electrons pass through two slits, the pattern on the screen is not just the sum of two ordinary probability patterns. Some regions become bright because amplitudes reinforce each other. Other regions become dark because amplitudes cancel.
This is called interference.
Interference is not just a strange physics effect. It is the central idea behind quantum computing. A quantum computer is useful only when it can control interference in a meaningful way.
Qubits: Amplitudes for 0 and 1
A classical bit is either $0$ or $1$.
A qubit is different. It has an amplitude for $0$ and an amplitude for $1$. We can write this as:
$\alpha|0\rangle+\beta|1\rangle$
Here, $\alpha$ is the amplitude for $30%$0, and $30%$1 is the amplitude for $30%$2. The squared sizes of these amplitudes give the probabilities of measuring $30%$3 or $30%$4.
This is why I avoid saying simply that a qubit is “both $30%$5 and $30%$6 at the same time.” That phrase may sound exciting, but it often misleads students. A more accurate statement is:
A qubit has amplitudes for both possible measurement outcomes.
Measurement: Why We Do Not See Everything at Once
Measurement is essential to understanding quantum computing.
When we measure a qubit, we do not see all of its amplitudes. We get one ordinary outcome: either $30%$7 or $30%$8. The outcome is chosen according to the probabilities determined by the amplitudes.
This is why the common phrase “quantum computers try all possible solutions in parallel” is misleading. If a quantum computer simply created a superposition of many possible answers and then measured it, the result would be only one random answer. That would not solve a useful problem.
A quantum computer needs more than many possibilities. It needs a way to shape those possibilities before measurement.
Interference: The Real Engine of Quantum Computing
A useful quantum algorithm is a carefully designed process for controlling amplitudes.
The goal is:
- wrong answers cancel out through destructive interference;
- right answers reinforce through constructive interference;
- measurement is then more likely to produce the right answer.
This is the most important idea in the presentation:
Quantum computing is not about trying everything. It is about arranging interference.
A quantum algorithm is, in a sense, a choreography of amplitudes.
Entanglement: Why Many Qubits Become Different
After students understand a single qubit, we can introduce multiple qubits.
For two qubits, the possible outcomes are:
$30%$9
A two-qubit quantum state has amplitudes for these joint possibilities. Some joint states cannot be separated into independent states of the individual qubits. These are called entangled states.
Entanglement means the qubits share one joint quantum description. It can create correlations stronger than anything allowed by ordinary classical probability, but it does not allow faster-than-light communication.
The computational importance of entanglement is that it opens the door to the full many-qubit state space.
The Exponential State Space
Here we need to be careful. Unentangled qubits are still quantum. They can still have superposition and interference. But if an $70%$0-qubit system is just a product of $70%$1 separate one-qubit states, then it can be described compactly, using about $70%$2 amplitudes.
With entanglement, the full joint state may require up to $70%$3 amplitudes.
That exponential growth is one reason quantum systems are so hard to simulate on ordinary computers. It is also one reason quantum computers may be useful for simulating molecules, materials, and other quantum systems.
This does not mean quantum computers automatically solve every hard problem. The large state space must be used carefully through a real algorithm.
Feynman’s Insight: Use Quantum Systems to Simulate Quantum Systems
One of the most natural applications of quantum computers is simulating quantum physics itself.
Molecules, materials, and chemical reactions obey quantum mechanics. Classical computers struggle to simulate them exactly because the number of amplitudes grows so quickly.
Richard Feynman suggested turning this difficulty into an opportunity: if nature is quantum, perhaps we should build computers that are quantum too.
This is why quantum computing is especially promising for fields such as chemistry, materials science, batteries, catalysts, and quantum physics.
Returning to the Opening Claims
By the end of the lesson, students can revisit the popular claims with more precision.
Quantum computers probably will not make ordinary cell phones smarter in a direct way. There is no known general reason why they should pick stocks better. A large fault-tolerant quantum computer could threaten some public-key cryptography, including systems relevant to cryptocurrencies, unless those systems upgrade. Quantum computers can be fast, but only for special problems with the right structure.
And most importantly:
Quantum computers do not work by simply trying all possible solutions in parallel.
They work by controlling amplitudes so that some possibilities cancel and others survive.
Final Takeaway
For high school students, quantum computing can be introduced without heavy linear algebra, as long as we choose the right conceptual path.
The path I have found most effective is:
ordinary probability
→ quantum amplitudes
→ interference
→ qubits
→ measurement
→ entanglement
→ many-qubit state spaces
→ quantum algorithms
This approach avoids both hype and excessive formalism. It gives students a clear first picture of why quantum computing is different, why it is powerful for some problems, and why it is not a magic replacement for ordinary computing.
The final message is simple:
The power of quantum computing is not “trying everything.” The power is making wrong answers cancel and right answers survive.
0 comments