This program implements the algorithm appears in Lemma 3.3, 3.4 and Proposition 3.6 of the paper Canonical forms for single-qutrit Clifford+T operators. It normalizes any string using alphabet {X,Z,H,S,T,W} to the qutrit Matsumoto-Amano normal form :
For security reasons, I put a limit of 200 on the length of the input string. The output is equivalent to the input in the sense that their matrix products are the same if regarding the alphabets as matrices:
Finding MA normal forms for single qubit operators.
![]() |
Opened on: 07/30/2019. Last edited on: 08/11/2019 |
|