A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Verifying the Smallest Interesting Colour Code with Quantomatic
2018
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
Other Versions
In this paper we present a Quantomatic case study, verifying the basic properties of the Smallest Interesting Colour Code error detecting code.
doi:10.4204/eptcs.266.10
fatcat:nkgbju4bbzf5teckp32ndeikfe