Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
