A new exact integer-programming formulation, the Token Meeting Problem, provably minimizes swap gates when routing commuting-gate quantum circuits, with NP-hardness and asymptotic bounds.
Cerezo, Guillaume Verdon, Hsin-Yuan Huang, Lukasz Cincio, and Patrick J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Optimized Qubit Routing for Commuting Gates via Integer Programming
A new exact integer-programming formulation, the Token Meeting Problem, provably minimizes swap gates when routing commuting-gate quantum circuits, with NP-hardness and asymptotic bounds.