Demonstration of quantum permutation parity determine algorithm in a superconducting qutrit

A quantum algorithm provides a new way in solving certain computing problems and usually faster than classical algorithms. Here we report an implementation of a quantum algorithm to determine the parity of permutation in a single three-dimensional (3D) superconducting transmon qutrit system. The experiment shows the capacity to speed up in a qutrit, which can also be extended to a multi-level system for solving high-dimensional permutation parity determination problem.