Restricting phase-polynomial synthesis to allowed CNOTs on a given architecture reduces routing overhead from O(log n) or worse to a constant factor of at most 4.
THE PAIRWISE SORTING NETWORK
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Qubit Routing for (Almost) Free
Restricting phase-polynomial synthesis to allowed CNOTs on a given architecture reduces routing overhead from O(log n) or worse to a constant factor of at most 4.