GULPS partitions two-qubit unitary synthesis into depth-2 segments solved via linear programming over Littlewood-Richardson inequalities followed by least-squares optimization, yielding faster and lower-cost decompositions than prior synthesizers on heterogeneous ISAs.
Optimal synthesis into fixed xx interactions,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
GULPS: Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets
GULPS partitions two-qubit unitary synthesis into depth-2 segments solved via linear programming over Littlewood-Richardson inequalities followed by least-squares optimization, yielding faster and lower-cost decompositions than prior synthesizers on heterogeneous ISAs.