The Harrow-Hassidim-Lloyd algorithm with qutrits
This paper extends the Harrow-Hassidim-Lloyd (HHL) algorithm to qutrits by introducing Weyl-Heisenberg gadgets and a practical implementation scheme, demonstrating that the qutrit version achieves comparable precision with fewer qudits and a similar number of two-qudit gates compared to the traditional qubit-based approach.