Our comprehensive evaluations show that Paulihedral outperforms state-of-the-art baseline compilers (Qiskit [1]}, \(\rm t|ket\rangle \)  [2]} and algorithm-specific compilers [3]}, [4]}, [5]}) with significant gate count and circuit depth reduction on both fault-tolerant and superconducting backends, and only introduces very small additional compilation time.
We also perform real-system experiments to show that Paulihedral can significantly increase the end-to-end success rate of QAOA programs on IBM's superconducting quantum devices.
