Route the circuit.
Prove it still computes the same thing — signed.
A quantum compiler routes a circuit onto a device's coupling graph — inserting SWAPs so every two-qubit gate acts on physically-connected qubits — and remaps qubits. Whether the routed circuit still computes the same thing is a correctness obligation that today is checked, if at all, by an unsigned, non-reproducible tool. Here it's a signed certificate: a deterministic router plus a byte-exact stabilizer-tableau equivalence check.
Two Clifford circuits implement the same unitary iff they conjugate every Pauli identically; routing
preserves semantics up to the final qubit permutation, so the certificate checks
routed ++ (swaps restoring identity) ≡ source. Every step hashes identically on every
machine and seals a signed wai.quantum.compile receipt binding source, compiled
circuit, and coupling graph to the verdict. Honest boundary: the check is exact for Clifford
circuits (the standard scope for a tableau checker) and covers routing/mapping correctness. Simulated,
no QPU.
Route onto the coupling graph · prove equivalence
The certificate is real · rejects tampering
Compilation correctness — content-addressed, budget-gated, verifiable with a public key
The routing panel takes a random Clifford circuit whose two-qubit gates land on non-adjacent
qubits, and routes it onto the coupling graph — the router inserts SWAPs (moving a qubit along the
shortest path to its partner) until every two-qubit gate is local. The stabilizer tableau then proves
the routed circuit is equivalent to the source, and the receipt binds
(source hash, compiled hash, coupling hash) → equivalent. The second panel shows the
check has teeth: drop a single gate from the routed circuit and the same deterministic check returns
not equivalent — a certificate that would catch a mis-compilation. A compiled circuit you can
put in an auditor's hands, reproduce from the git repo, and verify with only a public key. Reference
engine + spec in the open-standards repo, Apache-2.0.