Verifying the Smallest Interesting Colour Code with Quantomatic

Liam Garvie
(University of Strathclyde)
Ross Duncan
(University of Strathclyde)

In this paper we present a Quantomatic case study, verifying the basic properties of the Smallest Interesting Colour Code error detecting code.

In Bob Coecke and Aleks Kissinger: Proceedings 14th International Conference on Quantum Physics and Logic (QPL 2017), Nijmegen, The Netherlands, 3-7 July 2017, Electronic Proceedings in Theoretical Computer Science 266, pp. 147–163.
v2 removes the long appendix with the complete proofs. This is still available in v1 of this paper.
Published: 27th February 2018.

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