Below is an actual experiment (run on a quantum emulator): five atoms, held in place by laser tweezers, work out the largest set of “antenna sites” that don’t interfere with each other. No algorithm searches for the answer — physics settles into it.
Imagine five candidate spots for radio antennas. Antennas placed too close together interfere, so from any two clashing spots you may only pick one. What is the largest set of spots with no clashes? Computer scientists call this the Maximum Independent Set problem, and for large maps it is one of the notoriously hard ones — the number of combinations explodes.
A neutral-atom quantum computer has a party trick: this exact problem is built into its physics. One atom is placed at each site, at the real geometric position, spaced in micrometers. When a laser excites an atom into a high-energy Rydberg state, it physically prevents any atom within 9.1 µm — the blockade radius — from being excited too. “Too close to both be picked” isn’t a rule the machine checks. It is a law the atoms cannot break.
The sequence diagram beside the 3D experiment above traces the whole run — who does what, and when. Here is each of its six steps in detail. Only step 4 is quantum: everything before it is ordinary programming; everything after it is ordinary checking.
You list the five sites and their coordinates. That’s the whole input — a tiny map, measured in micrometers.
Each site becomes one atom, held at that exact position by an optical tweezer. Distance does the encoding: any two atoms closer than 9.1 µm are automatically “in conflict.” Seven pairs qualify here.
Instead of code, you write a 4-microsecond laser schedule: how strongly to shine (amplitude Ω) and how far off-resonance to tune (detuning δ) at every moment. This schedule is the entire “program.”
The sweep slowly makes “being picked” energetically attractive while blockade keeps clashing picks impossible. The atoms drift toward their lowest-energy arrangement — which is precisely the biggest conflict-free set. This is repeated 1000 times.
At the end of each run a camera snapshots the atoms. Each atom reads out as one bit — 1 picked, 0 not — so every shot returns a five-character bitstring like 10100.
Quantum answers are probabilistic, so a plain classical program checks every returned set against the conflict list, discards the rare invalid ones, and keeps the largest certified answer. Trust comes from this step, not from the quantum box.
Both knobs are plotted below in the same unit (rad/µs). The amplitude Ω rises and falls — turning quantum mixing on, then gently off. The detuning δ sweeps from negative (“being picked costs energy”) through zero to positive (“being picked saves energy”). Done slowly enough, the atoms stay in the lowest-energy state the whole way — so they finish in the lowest-energy answer. Physicists call this an adiabatic sweep: change the question slowly, and the system keeps giving its best answer.
A quantum computer doesn’t print “the answer.” It produces a distribution — run it many times and the good answers show up most often. Here are the five most frequent bitstrings from the real 1000-shot run (reading left to right: atoms n0 n1 n2 n3 n4):
On five atoms, a classical brute-force check (32 combinations) confirms the quantum answer instantly — that’s the point of a demo. The reason to care is scaling: the same recipe on hundreds of atoms explores a solution space no brute force could touch, while step 6 stays cheap — verifying an answer is easy even when finding it is hard.
The problem is encoded by physically placing atoms. Geometry — who is within 9.1 µm of whom — is the conflict graph. No translation layer, no circuit.
Rydberg blockade makes invalid answers energetically forbidden rather than merely discouraged. The machine doesn’t check the rule; it embodies it.
Every quantum output is checked by a boring classical program before it is believed. Probabilistic engine, deterministic gatekeeper.