Verifying the Smallest Interesting Colour Code with Quantomatic
arXiv:1706.02717 · doi:10.4204/EPTCS.266.10
Abstract
In this paper we present a Quantomatic case study, verifying the basic properties of the Smallest Interesting Colour Code error detecting code.
In Proceedings QPL 2017, arXiv:1802.09737. v2 removes the long appendix with the complete proofs. This is still available in v1 of this paper