First, state-of-the-art quantum compilers (e.g., Qiskit [1]}, Quilc [2]}, \(\rm t|ket\rangle \)  [3]}) lack a good formal high-level intermediate representation (IR).
Once programs are converted to low-level gate sequences, the high-level semantics of quantum simulation kernels are lost and hard to reconstruct from assembly-style gate sequences.
Moreover, simulation kernels face different constraints in different algorithms.
Previous ad-hoc optimizations of quantum simulation [4]}, [5]}, [6]}, [7]}, [8]}, [9]}, [10]}, [11]}, [12]}, [13]}, [14]}, [15]} are mostly algorithm-specific and do not generalize due to the lack of a formal IR that can uniformly represent simulations kernels as well as varying constraints that are attached to them in different algorithms.
