Decomposition of multi-qutrit gates generated by Weyl-Heisenberg strings (2507.09781v1)

Abstract: Decomposing unitary operations into native gates is an essential step for implementing quantum algorithms. For qubit-based devices, where native gates are typically single- and two-qubit operations, a range of decomposition techniques have been developed. In particular, efficient algorithms exist for decomposing exponentials of Pauli strings while taking hardware topology in account. Motivated by the growing interest in qutrit-based quantum computing, we develop analogous decomposition methods for qutrit systems. Specifically, we introduce an algorithm that decomposes the exponential of an arbitrary tensor product of Weyl-Heisenberg operators (plus their Hermitian conjugation) into single- and two-qutrit gates. We further extend this approach to unitaries generated by Gell-Mann string (i.e., a tensor product of Gell-Mann matrices). Since both Gell-Mann matrices and Weyl-Heisenberg operators form (together with identity) complete operator bases of qutrit operators, we can use this result also to decompose any multi-qutrit gate that is diagonal up to single-qutrit rotations. As a practical application, we use our method to decompose the layers of the quantum approximate optimization algorithm for qutrit-based implementations of the graph k-coloring problem. For values of $k$ well-suited to qutrit architectures (e.g., $k=3$ or in general $k=3^n$), our approach yields significantly shallower circuits compared to qubit-based implementations, an advantage that grows with problem size, while also requiring a smaller total Hilbert space dimension. Finally, we also address the routing challenge in qutrit architectures that arises due to the limited connectivity of the devices. In particular, we generalize the Steiner-Gauss method, originally developed to reduce CNOT counts in qubit circuit, to optimize gate routing in qutrit-based systems.