Superconducting vs All-to-All Compilation
On a superconducting chip each qubit talks only to fixed neighbours, so distant interactions pay a SWAP tax of extra two-qubit gates; trapped-ion machines let any pair interact directly but run two-qubit gates far more slowly. Neither architecture wins universally — the outcome depends on the circuit's interaction pattern and on which cost your objective weighs.
What do the two architectures look like to a compiler?
A superconducting processor is a chip of fixed circuits cooled near absolute zero; each qubit is wired to a handful of physical neighbours, so the topology is a sparse graph — a line, grid, or IBM's heavy-hex pattern. This is limited connectivity: a two-qubit gate is only available between wired pairs.
A trapped-ion machine holds individual charged atoms in a shared electromagnetic trap; because all the ions sit in one trap and interact through their collective motion, a two-qubit gate can be applied to any pair. This is all-to-all connectivity. (The office analogy: a chip is desks in fixed cubicles — to talk to someone far away you relay messages; a trap is one meeting room where anyone can address anyone. The analogy breaks on speed: the meeting-room conversations are much slower, and it says nothing about error rates.)
Compiling one logical circuit against both archetypes makes the consequences visible without crowning a winner — an archetype is a simplified model of an architecture class, not a claim about any named device.
You’ve read the opening of chapter 9 — 6 more sections follow, with worked examples and circuits you can run on the page. A free account unlocks every chapter of every course (paid plans aren’t live yet — early readers get everything free).