Pour water onto hilly ground and it finds the lowest valley by itself. Quantum annealing finds the best answer to a problem in a similar way.
Pour water onto a hilly landscape and it trickles downhill, settling in the lowest valley. It doesn’t try every spot. It just follows the shape of the land.
Quantum annealing works a bit like that. It’s a special kind of quantum computing that searches for the best answer among a huge number of options, the lowest valley in a landscape of possibilities.
The kind of problem it suits
- planning the shortest routes for delivery vans
- building timetables with lots of clashing rules
- choosing the best mix from thousands of options
The quantum twist
Water can get stuck in a small dip on the way down. Quantum effects let the search “tunnel” through hills to reach a lower valley instead of getting stuck.
What it isn’t
It isn’t the same kind of machine as the gate-based quantum computers built by Google or IBM. Annealers are specialists for this one kind of problem.
Where the comparison breaks down
Water always reaches some valley. A quantum annealer doesn’t guarantee the very best answer. For many problems, ordinary computers still do just as well.
How the words fit together
Quantum annealing is one specialised use of qubits. Whether it brings real quantum advantage is still debated.
Annealing machines are good at one kind of problem: finding the best option. They aren't general-purpose quantum computers. They don't always beat ordinary ones either.

When you'll hear it
“It's an annealer, not a gate-based machine.” It's built for one kind of problem, not for running any quantum program.
“It's an optimisation problem.” We're looking for the best option among a huge number of choices.
“Did it beat classical solvers?” Did it actually do better than the best ordinary computer methods?
“Is our problem the kind of best-option search an annealer is built for?”


