Finding Matsumoto-Amano normal forms

This program implements a GUI for the MA nomal form function in the newsynth library by Neil J. Ross and Peter Selinger. It normalizes any string with alphabet {X,Y,Z,H,S,T,W} to the Matsumoto-Amano normal form (e is empty string): (e|T) (HT|SHT)* (e|H|SH) (e|X) (e|SS) (e|S) (e|WWWW) (e|WW) (e|W)

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:

Step 1. Input a string with letters from {X,Y,Z,H,S,T,W}

Step 2. Click Normalize button

See Also

Finding MA normal forms for single qutrit operators.

Opened on: 07/10/2019. Last edited on: 08/11/2019