Open-source compiler cuts logical-qubit overhead by a third
A new lattice-surgery scheduler squeezes routing overhead out of fault-tolerant circuits, and it ships under a permissive license.
By Miko Halvorsen
Written in-house by the Release notes desk — an explainer, not a report of a news event.
- Routing overhead drops roughly 33% on benchmark chemistry circuits.
- Scheduler is decoder-agnostic and runs on commodity hardware.
- Permissive license makes it usable in commercial toolchains.
Compilation is where fault tolerance gets expensive. Every logical operation has to be laid out in space and time on the physical lattice, and naive scheduling wastes an enormous fraction of the available patch area.
The newly released scheduler treats lattice surgery as a resource-allocation problem and solves it with a heuristic that runs in seconds on a laptop. On standard chemistry benchmarks it reduces routing overhead by about a third compared with the previous reference implementation.
Because the tool is decoder-agnostic, hardware groups can adopt it without committing to a particular error-correction stack — a pragmatic choice that explains the unusually fast uptake in the first week.
This story started as a thread in our Discord. Join the discussion with the researchers and engineers who work on it.
Related
A shared benchmark suite for logical qubits gets a first draft
Vendors publish incomparable numbers. A working group wants one protocol everyone can run.
Surface-code processor stays below threshold as it scales to 1,000 qubits
The logical error rate keeps falling as the code distance grows — the clearest sign yet that adding qubits now buys reliability instead of noise.
Trapped-ion shuttling record pushes two-qubit fidelity past 99.9%
Moving ions between zones used to cost coherence. A revised trap geometry makes transport nearly free.
