GULPS: Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets
Evan McKinney, Lev S. Bishop

TL;DR
GULPS is a novel linear programming-based compiler for two-qubit gates that significantly accelerates synthesis while maintaining low circuit cost, leveraging heterogeneous instruction sets.
Contribution
It introduces a linear programming approach for two-qubit gate synthesis that outperforms existing methods in speed and efficiency, especially on heterogeneous hardware.
Findings
GULPS is over 500 times faster than BQSKit and NuOp on Haar-random targets.
GULPS produces circuits 3.9 to 9.2 times faster than Qiskit's XXDecomposer.
All decompositions achieve the double-precision unitary-infidelity floor.
Abstract
Modern quantum hardware exposes heterogeneous two-qubit instruction sets through fractional, continuously parameterized, and per-pair native gates, but synthesis remains largely framed around CNOT and a small catalog of closed-form rules. We present \textbf{GULPS} (Global Unitary Linear Programming Synthesis), a two-qubit compiler that partitions synthesis into depth- segments and uses a linear program over quantum Littlewood--Richardson reachability inequalities to plant the intermediate invariants between them. Each segment becomes an independent low-dimensional least-squares fit, solved by a Gauss--Newton/Levenberg--Marquardt routine. On Haar-random two-qubit targets, GULPS is more than faster than the general-purpose synthesizers BQSKit and NuOp at strictly lower circuit cost. Against Qiskit's specialized \texttt{XXDecomposer} on -family ISAs, GULPS produces…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
