An exact branch-and-bound solver for generalized qubit mapping shows that the standard layering constraint raises optimal SWAP counts and circuit depth, most strongly on sparsely connected hardware graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem
An exact branch-and-bound solver for generalized qubit mapping shows that the standard layering constraint raises optimal SWAP counts and circuit depth, most strongly on sparsely connected hardware graphs.