A mathematical proof has reduced the cost of moving data inside a quantum computer to almost zero.
April 24, 2026
Original Paper
Qubit Routing for (Almost) Free
arXiv · 2604.19717
The Takeaway
Qubits on a quantum chip are physically restricted and must be routed to interact with each other. This movement creates a massive overhead that eats up most of the computer's limited resources. By synthesizing only specific allowed gates, this new method eliminates almost all of that wasted effort. It shifts the overhead from a complex logarithmic factor to a nearly constant value. This breakthrough allows quantum algorithms to run on much smaller and simpler hardware than previously thought possible.
From the abstract
In this paper, we give a mathematical proof that bounds the number of CNOT gates required to synthesize an $n$ qubit phase polynomial with $g$ terms to be at least $O(\frac{gn}{\max (\log g, 1)})$ and at most $O(gn)$. However, when targeting restricted hardware, not all CNOTs are allowed. If we were to use SWAP-based methods to route the qubits on the architecture such that the earlier synthesized gates are natively allowed, we increase the number of CNOTs by a routing overhead factor of $O(\log