Generators and Relations for 3-Qubit Clifford+CS Operators

Xiaoning Bian
(Dalhousie University)
Peter Selinger
(Dalhousie University)

We give a presentation by generators and relations of the group of 3-qubit Clifford+CS operators. The proof roughly consists of two parts: (1) applying the Reidemeister-Schreier theorem recursively to an earlier result of ours; and (2) the simplification of thousands of relations into 17 relations. Both (1) and (2) have been formally verified in the proof assistant Agda. The Reidemeister-Schreier theorem gives a constructive method for computing a presentation of a sub-monoid given a presentation of the super-monoid. To achieve (2), we devise an almost-normal form for Clifford+CS operators. Along the way, we also identify several interesting structures within the Clifford+CS group. Specifically, we identify three different finite subgroups for whose elements we can give unique normal forms. We show that the 3-qubit Clifford+CS group, which is of course infinite, is the amalgamated product of these three finite subgroups. This result is analogous to the fact that the 1-qubit Clifford+T group is an amalgamated product of two finite subgroups.

In Shane Mansfield, Benoît Valiron and Vladimir Zamdzhiev: Proceedings of the Twentieth International Conference on Quantum Physics and Logic (QPL 2023), Paris, France, 17-21st July 2023, Electronic Proceedings in Theoretical Computer Science 384, pp. 114–126.
Published: 30th August 2023.

ArXived at: https://dx.doi.org/10.4204/EPTCS.384.7 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org